B. Ste#en. Property-oriented expansion. In LNCS 1145, 3rd International Symposium on Static Analysis, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Structure-Preserving Binary Relations for Program Abstraction - Schmidt (2002) (1 citation) (Correct)
....second abstraction is a mixture of data and control abstraction: It simpli es the program s data domain (that is, x s value) to EvenOdd = fe; og and de nes A2 = ProgramPoint EvenOdd. In consequence, more precise knowledge is presented about the outcomes of the test at program point p 1 (cf. [38]) in contrast to a control abstraction. The state sets for both abstractions in Figure 3 are just subsets of P(Atom) from Figure 2: A2 = IK ( K ) and A1 = IK ( K ) n fisEven; isOddg, where X n Y denotes the sets of X P(Atom) with occurrences of a 2 Y removed. The characterization of each a ....
B. Ste en. Property-oriented expansion. In R. Cousot and D. Schmidt, editors, Static Analysis Symposium: SAS'96, volume 1145 of Lecture Notes in Computer Science, pages 22-41. Springer-Verlag, 1996.
Expansion-based Removal of Semantic Partial Redundancies - Knoop, Rüthing, Steffen (1999) (1 citation) (Correct)
....our algorithm. Basically, it works by expanding (i.e. unrolling) the program in a demand driven fashion. The expansion is controlled by means of on the y computed semantic equivalence information of program terms. Hence, the algorithm works by means of property oriented expansion in the sense of [17]. x : a b a) y : c b y : c b z : x z : y x : a b a : a (a,c) c,a) b) z : x z : y (x,y) a b,c b) c : a z : a b z : c b Fig. 4. Optimisations achieved by our approach for the examples of Figure 2(c) and Figure 3(a) Conceptually, this approach has previously been ....
....: c,a) b) z : x z : y (x,y) a b,c b) c : a z : a b z : c b Fig. 4. Optimisations achieved by our approach for the examples of Figure 2(c) and Figure 3(a) Conceptually, this approach has previously been applied to the complete elimination of syntactic partial redundancies (cf. [17]) a result which has later been optimized in order to avoid unnecessary code duplication (cf. 4] The approach here parallels the syntactic approach under a semantic perspective leading to substantially stronger optimality results. Its unique power, which will be discussed in detail in the ....
[Article contains additional citation context not shown here]
B. Ste en. Property-oriented expansion. In Proc. 3rd Stat. Analysis Symp. (SAS'96), LNCS 1145, pages 22 - 41. Springer-V., 1996.
ESP: Path-Sensitive Program Verification in Polynomial Time - Das, Lerner, Seigle (2002) (46 citations) (Correct)
No context found.
B. Ste#en. Property-oriented expansion. In LNCS 1145, 3rd International Symposium on Static Analysis, 1996.
c World Scientific Publishing Company - Predicated Partial Redundancy (Correct)
No context found.
B. Ste#en. Property oriented expansion. In Proc. Int. Static Analysis Symposium (SAS'96), Aachen (Germany), volume 1145 of Lecture Notes in Computer Science (LNCS), pages 22--41, Heidelberg, Germany, September 1996. Springer-Verlag.
Loop Quasi-Invariance Code Motion - Song, FUTAMURA, GLÜCK, HU (Correct)
No context found.
B. Ste#en, "Property oriented expansion," Symposium on Static Analysis, LNCS 1145, pp.22--41, Springer-Verlag, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC