Refining and compressing abstract domains

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

Volumn 1256, Issue , 1997, Pages 771-781

  Giacobazzi, Roberto ^a   Ranzato, Francesco ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATION THEORY; ADJUNCTIONS;

COMPRESSORS;

EID: 1442284557     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_230     Document Type: Conference Paper

References (23)

1. M. Codish, A. Mulkers, M. Bruynooghe, M. Garcia de la Banda, and M. Hermenegildo. Improving abstract interpretations by combining domains. ACM TOPLAS, 17(l):28-44, 1995.
2. M. Comini and G. Levi.An algebraic theory of observables.In Proc. ILPS'94>pp. 172-186,1994.
3. A. Cortesi, G. File, R. Giacobazzi, C. Palamidessi, and P. Ranzato. Complementation in abstract interpretation. ACM TOPLAS, 19(l):7-47, 1997.
4. A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combinations of abstract domains for logic programming. In Proc. POPL'94, pp. 227-239, 1994.
5. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc, POPL'77, pp. 238-252, 1977.
6. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. POPL'79, pp. 269-282, 1979.
7. P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Proc. POPL'92, pp. 83-94, 1992.
8. 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.
9. G. File, R. Giacobazzi, and F. Ranzato. A unifying view of abstract domain design. ACM Comput. Surv., 28(2):333-336, 1996.
10. G. File and F. Ranzato. Improving abstract interpretations by systematic lifting to the power-set. In Proc. ILPS'94, pp. 655-669, 1994.
11. R. Giacobazzi, "Optimal" collecting semantics for analysis in a hierarchy of logic program semantics. In Proc. STACS'96, LNCS 1046, pp. 503-514, 1996.
12. R. Giacobazzi, C. Palamidessi, and F. Ranzato. Weak relative pseudo-complements of closure operators. Algebra Universalis, 36(3):405-412, 1996.
13. R. Giacobazzi and F. Ranzato. Functional dependencies and Moore-set completions of abstract interpretations and semantics. In Proc. ILPS'BS, pp. 321-335, 1995.
14. R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. To appear in Sci. Comput. Program. Preliminary version in LNCS 1058, pp. 141-155, 1996.
15. T.P. Jensen. Disjunctive strictness analysis. In Proc. LICS'92, pp. 174-185. 1992.
16. K. Muthukumar and M. Hermenegildo. Combined determination of sharing and freeness of program variables through abstract interpretation. In Proc. IGLP'91, pp. 49-63, 1991.
17. A. Mycroft. Completeness and predicate-based abstract interpretation. In Proc. PEPM'93.
18. F. Nielson. Tensor products generalize the relational data flow analysis method. In Proc. 4th Hungarian Comput. Sci. Conf., pp. 211-225, 1985.
19. U. Reddy and S. Kamin. On the power of abstract interpretation.In Proc. IEEE lCCh'92, 1992.
20. R.C. Sekar, P. Mishra, and I.V. Ramakrishnan. On the power and limitation of strictness analysis. To appear in /. ACM. Preliminary version in Proc. POPL'91, pp. 37-48, 1991.
21. R. Sundararajan and J. Conery. An abstract interpretation scheme for groundness, freeness, and sharing analysis of logic programs. In Proc. FST&TCS'9S, LNCS 652, pp. 203-216, 1992.
22. K. Yj and W.L. Harrison. Automatic generation and management of interprocedural program analyses. In Proc. POPL'93, pp. 246-259, 1993.
23. M. Ward. The closure operators of a lattice. Ann. Math., 43(2):191-196, 1942.