A case study in abstract interpretation based program transformation: Blocking command elimination

Electronic Notes in Theoretical Computer Science

Volumn 45, Issue , 2001, Pages 41-64

  Cousot, Patrick ^a   Cousot, Radhia ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CODES (SYMBOLS); MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; SET THEORY; THEOREM PROVING;

ABSTRACT INTERPRETATION; BLOCKING CODES; PROGRAM TRANSFORMATIONS; STATIC PROGRAM ANALYSIS;

SEMANTICS;

EID: 0005372156     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80954-X     Document Type: Conference Paper

References (22)

1. Abramsky S., Jung A. Domain theory. Abramsky S., Gabbay Dov M., Maibaum T.S.E. Semantic Structures, volume 3 of Handbook of Logic in Computer Science, chapter 1. 1994;1-168 Clarendon Press
2. Apt K.R., Plotkin G.D. Countable nondeterminism and random assignment. J. ACM. 33:(4):Oct. 1986;724-767
3. Burstall R.M., Darlington J. A transformation system for developing recursive programs. J. ACM. 24:(1):Jan. 1977;44-67
4. Cousot P. Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique de programmes. Thése d'État és sciences mathématiques. Mar. 1978;21 Université scientifique et médicale de Grenoble, Grenoble, France
5. Cousot P. Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. ENTCS. 6:1997;. http://www.elsevier.nl/ locate/entcs/volume6.html, 25 pages.
6. th POPL. 1977;238-252 ACM Press, Los Angeles, CA
7. Cousot P., Cousot R. Constructive versions of Tarski's fixed point theorems. Pacific J. Math. 82:(1):1979;43-57
8. th POPL. 1979;269-282 ACM Press, San Antonio, TX
9. Cousot P., Cousot R. Abstract interpretation frameworks. J. Logic and Comp. 2:(4):Aug. 1992;511-547
10. de Bakker J.W.J., Meyer Ch.-J., Zucker J.I. On infinite computations in denotational semantics. Theoret. Comput. Sci. 26:1983;53-82. Corrigendum: Theoret. Comput. Sci. 29:1984;229-230
11. Jones N., Gomard C.K., Sestoft P. Partial Evaluation and Automatic Program Generation. Int. Series in Computer Science. June 1993;Prentice-Hall
12. Jones N.D. Abstract interpretation and partial evaluation in functional and logic programming. Bruynooghe M. Proc. Int. Symp. ILPS '1994. Nov. 1994;17-22 MIT Press. 13-17
13. Jones N.D. An introduction to partial evaluation. ACM Comput. Surv. 28:(3):Sep. 1996;480-504
14. th Int. Symp. SAS '97, Paris, France, 8-10 Sep. 1997. LNCS 1302 :1997;396-405 Springer-Verlag, Paris, France
15. st POPL. Oct. 1973;194-206 ACM press, Boston, MA
16. Kleene S.C. Representation of events in nerve nets and finite automata. Automata Studies. 1956;3-42
17. Pnueli A., Shtrichman O., Siegel M. The code validation tool CVT: Automatic verification of a compilation process. STTT. 2:(2):1998;192-201
18. Reynolds J.C. The discoveries of continuations. Lisp and Symbolic Computation. 6:(3/4):Nov. 1993;233-248
19. st Int. Symp. SAS '94, Namur, Belgium, 20-22 Sep. 1994. LNCS 864 :1994;162-178 Springer-Verlag
20. Tarski A. A lattice theoretical fixpoint theorem and its applications. Pacific J. Math. 5:1955;285-310
21. Wadler P. Deforestation: Transforming programs to eliminate trees. Theoret. Comput. Sci. 73:(2):28 Mar. 1990;231-248
22. Weiser M. Program slicing. IEEE Trans. Software Engrg. SE-10:(4):Jul. 1984;352-357