Completeness in abstract interpretation: A domain perspective

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1349, Issue , 1997, Pages 231-245

  Giacobazzi, Roberto ^a   Ranzato, Francesco ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SEMANTICS; SOFTWARE ENGINEERING;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; ABSTRACT SEMANTICS; ALGEBRAIC THEORIES; CERTAIN HYPOTHESIS; CONTINUOUS SEMANTICS; PROGRAM ANALYSIS;

FORMAL LOGIC;

EID: 84947919083     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0000474     Document Type: Conference Paper

References (27)

1. G. Amato and G. Levi. Properties of the lattice of observables in logic programming. In Proc. APPIA-GULP-PRODE’97, pp. 175-187, 1997.
2. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Two classes of Boolean functions for dependency analysis. To appear in Sci. Comput. Program., 1997.
3. R. Barbuti, R. Giacobazzi, and G. Levi. A general framework for semantics-based bottom-up abstract interpretation of logic programs. ACM TOPLAS, 15(1):133-181, 1993.
4. C. Colby. Accumulated imprecision in abstract interpretation. In Proc. 1st ACM AAS’97, pp. 77-89, 1997.
5. M. Comini and G. Levi. An algebraic theory of observables. In Proc. ILPS’97, pp. 172-186, 1994.
6. A. Cortesi, G. Filé, R. Giacobazzi, C. Palamidessi, and F. Ranzato. Complementation in abstract interpretation. ACM TOPLAS, 19(1):7-47, 1997.
7. P. Cousot. Types as abstract interpretations. In Proc. ACM POPL’97, pp. 316-331, 1997.
8. P. Cousot and R. Cousot: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. ACM POPL’77, pp. 238-252, 1977.
9. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. ACM POPL’79, pp. 269-282, 1979.
10. P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Proc. ACM POPL’92, pp. 83-94, 1992.
11. P. Cousot and R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages). In Proc. IEEE ICCL’94, pp. 95-112, 1994.
12. P. Cousot and R. Cousot. Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form. In Proc. CAV’95, LNCS 939, pp. 293-308, 1995.
13. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. Theor. Comput. Sci., 69(3):289-318, 1989.
14. G. Fild, R. Giacobazzi, and F. Ranzato. A unifying view of abstract domain design. ACM Comput. Surv., 28(2):333-336, 1996.
15. G. Filé and F. Ranzato. The powerset operator on abstract interpretations. To appear in Theor. Comput. Sci., 1998.
16. R. Oiacobazzi. “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics. In Proc. STAGS ‘96, LNCS 1046, pp. 503-514, 1996.
17. R. Giaeobazzi, C. Palamidessi, and F. Ranzato. Weak relative pseudo-complements of closure operators. Algebra Universalis, 36(3):405-412, 1996.
18. R. Giacobazzi and F. Ranzato. Refining and compressing abstract domains. In Proc. ICALP’97, LNCS 1256, pp. 771-781, 1997.
19. R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. To appear in Sci. Comput. Program., 1998.
20. K. Marriott and H. S0ndergaard. Precise and efficient groundness analysis for logic programs. ACM Left. Program. Lang. Syst., 2(1-4):181-196, 1993.
21. A. Mycroft. Abstract interpretation and optimising transformations for applicative programs. PhD thesis, Univ. of Edinburgh, 1981.
22. A. Mycroft. Completeness and predicate-based abstract interpretation. In Proc. ACM PEPM ‘93, pp. 179-185, 1993.
23. U.S. Reddy and S.N. Kamin. On the power of abstract interpretation. In Proc. IEEE ICCL ‘92, 1992.
24. R.C. Sekar, P. Mishra, and I.V. Ramakrishnan. On the power and limitation of strictness analysis. J. ACM, 44(3), 1997.
25. B. Steffen. Optimal data flow analysis via observational equivalence. In Proc. MFCS ‘89, LNCS 379, 1989.
26. B. Steffen, C.B. Jay, and M. Mendler. Compositional characterization of observable program properties. AFCET, 26:403-424, 1992.
27. M. Ward. The closure operators of a lattice. Ann. Math., 43(2):191-196, 1942.