The quotient of an abstract interpretation

Theoretical Computer Science

Volumn 202, Issue 1-2, 1998, Pages 163-192

  Cortesi, Agostino ^a   Filé, Gilberto ^b   Winsborough, William ^c  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000554159     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00137-0     Document Type: Article

References (23)

1. S. Abramski, C. Hankin, Abstract Interpretation of Declarative Languages, Ellis Horwood, Chichester, U.K., 1987.
2. T. Armstrong, K. Marriott, P. Schachte, H. Søndergaard, Boolean functions for dependency analysis: Algebraic properties and efficient representations, in: Proc. Static Analysis Symp., Lecture Notes in Computer Science, vol. 864, Springer, Berlin, 1994, pp. 266-280.
3. R. Barbuti, R. Giacobazzi, G. Levi, A general framework for semantics-based bottom-up abstract interpretation of logic programs, ACM TOPLAS 15 (1) (1993) 133-181.
4. M. Codish, A. Mulkers, M. Bruynooghe, M. Garcia de la Banda, M. Hermenegildo, Improving abstract interpretations by combining domains, ACM TOPLAS 17 (1) (1995) pp. 28-44.
5. P. Cousot, R. Cousot, Abstract interpretation: a unified framework for static analysis of programs by construction of approximation of fixpoints, in: Proc. 4th ACM POPL, 1977.
6. P. Cousot, R. Cousot, Abstract interpretation and applications to logic programs, J. Logic Programming 13 (1992).
7. A. Cortesi. G. Filè, Optimalities in the abstract domain sharing, Manuscript, University of Padova, 1996.
8. A. Cortesi, G. Filè, R. Giacobazzi, C. Palamidessi, F. Ranzato, Complementation in abstract interpretation, ACM TOPLAS 19 (1), (1997) 7-47.
9. A. Cortesi, G. Filè, W. Winsborough, Prop revisited: prepositional formula as abstract domain for groundness analysis, in: Proc. 6th IEEE LICS, Amsterdam, 1991, pp. 322-327.
10. A. Cortesi, G. Filè, W. Winsborough, Comparison of abstract interpretations, in: Proc. 19th Internat Colloquium on Automata, Languages and Programming ICALP'92, Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992, 523-534.
11. A. Cortesi, G. Filè, W. Winsborough, Optimal groundness analysis using propositional logic, J. Logic Programming 27 (2) (1996) 137-167.
12. A. Cortesi, P. Van Hentenryck, B. Le Charlier, Combinations of abstract domains for logic programming, in: Proc. 21th ACM POPL, Portland, 1994; ACM Sigplan Notices 29 (6) (1994) 227-239.
13. P.W. Dart, On derived dependencies and connected databases, J. Logic Prograniming 11 (1991) 163-188.
14. B.A. Davey, H.A. Priestley, Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990.
15. G. Filè, F. Ranzato, Improving abstract interpretations by systematic lifting to the powerset, in: Proc. ILPS '94, MIT Press, New York, 1994, pp.655-669.
16. D. Jacobs, A. Langen, Accurate and efficient approximation of variable aliasing in logic programs, J. Logic Programming 13 (1992) 291-314.
17. J.L. Lassez, M.J. Maher, K.G. Marriott, Unification revisited, in: J. Minker (Ed.) Foundation of Deductive Databases and Logic Programming, 1986.
18. K. Marriott, Frameworks for abstract interpretation, Acta Inform. 30 (2) (1993) 103-129.
19. K. Marriott, H. Søndergaard, Notes for a tutorial on abstract interpretation of logic programs, in: Proc. NACLP, Cleveland, 1989.
20. K. Marriott, H. Søndergaard, Precise and efficient groundness analysis for logic programs, ACM LOPLAS 2 (1-4)(1993) 181-196.
21. K. Marriott, H. Søndergaard, N. Jones, Denotational abstract interpretation of logic programs, ACM TOPLAS 16 (1994) 607-648.
22. P. Naur, Checking of operands types in Algol compilers, BIT 5 (1965) 151-163.
23. P. Van Hentenryck, A. Cortesi, B. Le Charlier, Evaluation of the domain Prop, J. Logic Programming 23 (3) (1995) 237-278.