Complementation in Abstract Interpretation

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 1, 1997, Pages 7-47

  Cortesi, Agostino ^a   Filé, Gilberto ^b   Giacobazzi, Roberto ^c   Palamidessi, Catuscia ^d   Ranzato, Francesco ^b  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

^c UNIVERSITY OF PISA   (Italy)

^d UNIVERSITY OF GENOA   (Italy)

Author keywords

Abstract domain; Abstract interpretation; D.3.1 Programming Languages : Formal Definitions and Theory semantics; F.3.1 Logics and Meanings of Programs : Specifying and Verifying and Reasoning about Programs logics of programs; Languages; Theory

Indexed keywords

ANALYSIS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; DESIGN; PROGRAMMING THEORY;

ABSTRACT DOMAIN; ABSTRACT INTERPRETATION; ALIASING ANALYSIS; CLOSURE OPERATOR; COMPLEMENTATION; INTEGER VARIABLE ANALYSIS; PROGRAM ANALYSIS;

LOGIC PROGRAMMING;

EID: 0030778191     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/239912.239914     Document Type: Article

References (43)

1. ARMSTRONG, T., MARRIOTT, K., SCHACHTE, P., AND SØNDERGAARD, H. 1994. Boolean functions for dependency analysis: Algebraic properties and efficient representation. In Proceedings of the 1st International Static Analysis Symposium (SAS '94), B. Le Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 266-280.
2. BIRKHOFF, G. 1967. Lattice Theory. AMS Colloquium Publication, 3rd edition. AMS, Providence, R.I.
3. CODISH, M., MULKERS, A., BRUYNOOGHE, M., GARCÍA DE LA BANDA, M., AND HERMENEGILDO, M. 1995. Improving abstract interpretations by combining domains. ACM Trans. Program. Lang. Syst. 17, 1, 28-44.
4. COMINI, M. AND LEVI, G. 1994. An algebraic theory of observables. In Proceedings of the 1994 International Logic Programming Symposium (ILPS '94), M. Bruynooghe, Ed. The MIT Press, Cambridge, Mass., 172-186.
5. CORTESI, A., FILÉ, G., AND WINSBOROUGH, W. 1992. Comparison of abstract interpretations. In Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP '92), W. Kuich, Ed. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, 521-532.
6. CORTESI, A., FILÉ, G., AND WINSBOROUGH, W. 1996. Optimal groundness analysis using prepositional logic. J. Logic Program. 27, 2, 137-167.
7. COUSOT, P. 1978. Méthodes Itératives de Construction et d'Approximation de Points Fixes d'Opérateurs Monotones sur un Treillis, Analyse Sémantique des Programmes. Ph.D. thesis, Université Scientifique et Médicale de Grenoble, Grenoble, France.
8. COUSOT, P. AND COUSOT, R. 1976. Static determination of dynamic properties of programs. In Proceedings of the 2nd International Symposium on Programming. Dunod, Paris, 106-130.
9. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages (POPL '77). ACM Press, New York, 238-252.
10. COUSOT, P. AND COUSOT, R. 1979. Systematic design of program analysis frameworks. In Conference Record of the 6th ACM Symposium on Principles of Programming Languages (POPL '79). ACM Press, New York, 269-282.
11. COUSOT, P. AND COUSOT, R. 1992a. Abstract interpretation and application to logic programs. J. Logic Program. 13, 2-3, 103-179.
12. COUSOT, P. AND COUSOT, R. 1992b. Inductive definitions, semantics and abstract interpretation. In Conference Record of the 19th ACM Symposium on Principles of Programming Languages (POPL '92). ACM Press, New York, 83-94.
13. COUSOT, P. AND COUSOT, R. 1994. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and per analysis of functional languages). In Proceedings of the IEEE International Conference on Computer Languages (ICCL '94). IEEE Computer Society Press, Los Alamitos, Calif., 95-112.
14. DART, P. 1988. Dependency analysis and query interfaces for deductive databases. Ph.D. thesis, Univ. of Melbourne, Melbourne, Australia.
15. DART, P. 1991. On derived dependencies and connected databases. J. Logic Program. 11, 2, 163-188.
16. DAVEY, B. A. AND PRIESTLEY, H. A. 1990. Introduction to Lattices and Order. Cambridge University Press, Cambridge, U.K.
17. DWINGER, P. 1954. On the closure operators of a complete lattice. Indagationes Mathematicæ 16, 560-563.
18. FILÉ, G. AND RANZATO, F. 1996. Complementation of abstract domains made easy. In Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming (JICSLP '96), M. Maher, Ed. The MIT Press, Cambridge, Mass., 348-362.
19. FILÉ, G., GIACOBAZZI, R., AND RANZATO, F. 1996. A unifying view of abstract domain design. ACM Comput. Surv. 28, 2, 333-336.
20. FRINK, O. 1962. Pseudo-complements in semi-lattices. Duke Math. J. 29, 505-514.
21. GIACOBAZZI, R. 1996. "Optimal" collecting semantics for analysis in a hierarchy of logic program semantics. In Proceedings of the 13th International Symposium on Theoretical Aspects of Computer Science (STACS '96), C. Puech and R. Reischuk, Eds Lecture Notes in Computer Science, vol. 1046. Springer-Verlag, Berlin, 503-514.
22. GIACOBAZZI, R. AND RANZATO, F. 1996. Complementing logic program semantics. In Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP '96), M. Hanus and M. Rodríguez Artalejo, Eds. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 238-253.
23. GIACOBAZZI, R., PALAMIDESSI, C., AND RANZATO, F. 1996. Weak relative pseudo-complements of closure operators. Algebra Universalis 36, 3, 405-412.
24. GIERZ, G., HOFMANN, K. H., KEIMEL, K., LAWSON, J. D., MISLOVE, M., AND SCOTT, D. S. 1980. A Compendium of Continuous Lattices. Springer-Verlag, Berlin.
25. GRÄTZER, G. 1978. General Lattice Theory. Birkhäuser Verlag, Basel, Switzerland.
26. HUNT, S. 1990. PERs generalize projections for strictness analysis. In Proceedings of the 1990 Glasgow Functional Programming Workshop, S. Peyton Jones, G. Hutton, and C. K. Holst, Eds. Workshops in Computing. Springer-Verlag, Berlin, 156-168.
27. JACOBS, D. AND LANGEN, A. 1989. Accurate and efficient approximation of variable aliasing in logic programs. In Proceedings of the 1989 North American Conference on Logic Programming (NACLP '89), E. L. Lusk and R. A. Overbeek, Eds. The MIT Press, Cambridge, Mass., 154-165.
28. JACOBS, D. AND LANGEN, A. 1992. Static analysis of logic programs for independent AND-parallelism. J. Logic Program. 13, 2-3, 154-165.
29. KAM, J. B. AND ULLMAN, J. D. 1977. Monotone data flow analysis frameworks. Acta Informatica 7, 305-317.
30. KILDALL, G. A. 1973. A unified approach to global program optimization. In Conference Record of the 1st ACM Symposium on Principles of Programming Languages (POPL '73). ACM Press, New York, 194-206.
31. MARCHIORI, E. 1996. Prime factorizations of abstract domains using first order logic. In Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP '96), M. Hanus and M. Rodríguez Artalejo, Eds. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 209-223.
32. MARRIOTT, K. AND SØNDERGAARD, H. 1993. Precise and efficient groundness analysis for logic programs. ACM Lett. Program. Lang. Syst. 2, 1-4, 181-196.
33. MORGADO, J. 1962. Note on complemented closure operators of complete lattices. Portugaliæ Mathematica 21, 3, 135-142.
34. MUTHUKUMAR, K. AND HERMENEGILDO, M. 1991. Combined determination of sharing and freeness of program variables through abstract interpretation. In Proceedings of the 8th International Conference on Logic Programming (ICLP '91), K. Furukawa, Ed. The MIT Press, Cambridge, Mass., 49-63.
35. MYCROFT, A. 1980. The theory and practice of transforming call-by-need into call-by-value. In Proceedings of the 4th International Symposium on Programming, B. Robinet, Ed. Lecture Notes in Computer Science, vol. 83. Springer-Verlag, Berlin, 270-281.
36. MYCROFT, A. 1981. Abstract interpretation and optimising transformations for applicative programs. Ph.D. thesis, CST-15/81, Univ. of Edinburgh, Edinburgh, Scotland.
37. MYCROFT, A. 1993. Completeness and predicate-based abstract interpretation. In Proceedings of the ACM Symposium on Partial Evaluation and Program Manipulation (PEPM '93). ACM Press, New York, 179-185.
38. NIELSON, F. 1985. Tensor products generalize the relational data flow analysis method. In Proceedings of the 4th Hungarian Computer Science Conference, M. Arató, I. Kátai, and L. Varga, Eds. 211-225.
39. SUNDARARAJAN, R. AND CONERY, J. 1992. An abstract interpretation scheme for groundness, freeness, and sharing analysis of logic programs. In Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS '92), R. Shyamasundar, Ed. Lecture Notes in Computer Science, vol. 652. Springer-Verlag, Berlin, 203-216.
40. VARLET, J. 1963. Contribution à l'étude des treillis pseudo-complémentés et des treillis de Stone. Mémoires de la Société Royale des Sciences de Liège 8, 4, 1-71.
41. WADLER, P. AND HUGHES, R. J. M. 1987. Projections for strictness analysis. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (FPCA '87), G. Kahn, Ed. Lecture Notes in Computer Science, vol. 274. Springer-Verlag, Berlin, 385-407.
42. WARD, M. 1942. The closure operators of a lattice. Ann. Math. 43, 2, 191-196.
43. YI, K. AND HARRISON, W. L. 1993. Automatic generation and management of interprocedural program analyses. In Conference Record of the 20th ACM Symposium on Principles of Programming Languages (POPL '93). ACM Press, New York, 246-259.