Complete abstract interpretations made constructive

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

Volumn 1450 LNCS, Issue , 1998, Pages 366-377

  Giacobazzi, Roberto ^a   Ranzato, Francesco ^b   Scozzari, Francesca ^a  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; ABSTRACT SEMANTICS; CONTINUOUS SEMANTICS; DIFFERENT DOMAINS; EXPRESSIVE POWER; SEMANTIC FUNCTIONS;

FUNCTIONAL PROGRAMMING;

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

References (20)

1. R. Bagnara, P.M. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. In Proc. 4th Int. Static Analysis Symp., LNCS 1302:53-67, 1997.
2. G. Birkhoff. Lattice Theory. AMS Colloq. Publications vol. XXV, 3rd ed., 1967.
3. G.L. Burn, C. Hankin, and S. Abramsky. Strictness analysis for higher-order functions. Sci. Cormput. Program., 7:249-278, 1986.
4. A. Cortesi, G. Filé, and W. Winsborough. The quotient of an abstract interpretation. Theor. Comput. Sci., 202(1-2):163-192, 1998.
5. P. Cousot. Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique des programmes. PhD thesis, Université Scientifique et Médicale de Grenoble, 1978.
6. P. Cousot. Completeness in abstract interpretation (Invited Lecture). In Proc. 1995 Joint Italian-Spanish Conference on Declarative Programming, pp. 37-38, 1995.
7. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM POPL, pp. 238-252, 1977.
8. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. 6th ACM POPL, pp. 269-282, 1979.
9. P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Proc. 19th ACM POPL, pp. 83-94, 1992.
10. P. Cousot and R. Cousot. Abstract interpretation of algebraic polynomial systems. In Proc. 6th AMAST Conf., LNCS 1349:138-154, 1997.
11. R. Giacobazzi and F. Ranzato. Refining and compressing abstract domains. In Proc. 24th ICALP, LNCS 1256:771-781, 1997.
12. R. Giacobazzi and F. Ranzato. Completeness in abstract interpretation: a domain perspective. In Proc. 6th AMAST Conf., LNCS 1349:231-245, 1997.
13. D. Jacobs and A. Langen. Static analysis of logic programs for independent AND-parallelism. J. Logic Program., 13(2-3): 154-165, 1992.
14. K. Marriott and H. Søndergaard. Precise and efficient groundness analysis for logic programs. ACM Lett. Program. Lang. Syst., 2(1-4):181-196, 1993.
15. A. Mycroft. Abstract interpretation and optimising transformations for applicative programs. PhD thesis, CST-15-81, Univ. of Edinburgh, 1981.
16. A. Mycroft. Completeness and predicate-based abstract interpretation. In Proc. ACM PEPM Conf., pp. 179-185, 1993.
17. U.S. Reddy and S.N. Kamin. On the power of abstract interpretation. Computer Languages, 19(2):79-89, 1993.
18. R.C. Sekar, P. Mishra, and I.V. Ramakrishnan. On the power and limitation of strictness analysis. J. ACM, 44(3):505-525, 1997.
19. H. Søndergaard. An application of abstract interpretation of logic programs: occur check reduction. In Proc. ESOP '86, LNCS 213:327-338, 1986.
20. B. Steffen. Optimal data flow analysis via observational equivalence. In Proc. 14th MFCS Symp., LNCS 379:492-502, 1989.