The boolean logic of set sharing analysis

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

Volumn 1490, Issue , 1998, Pages 89-101

  Codish, Michael ^a   Søndergaard, Harald ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

BOOLEAN LOGIC; DEPENDENCY ANALYSIS; DOMAIN ELEMENTS; EFFICIENT IMPLEMENTATION; GROUNDNESS; LOGICAL FORMS; POSITIVE BOOLEAN FUNCTION; SHARING ANALYSIS;

BOOLEAN FUNCTIONS;

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

References (17)

1. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Two classes of Boolean functions for dependency analysis. Science of Computer Programming, 31(l):3-45, 1998.
2. R. Bagnara, P. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. In P. Van Hentenryck, editor, Static Analysis: Proc. Fourth Int. Symp., volume 1302 of Lecture Notes in Computer Science, pages 53-67. Springer, 1997.
3. F. M. Brown. Boolean Reasoning: The Logic of Boolean Equations. Kluwer Academic Publ., 1990.
4. R. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
5. A. Cortesi, G. File, R. Giacobazzi, C. Palamidessi, and F. Ranzato. Complementation in abstract interpretation. In A. Mycroft, editor, Static Analysis: Proc. Second Int. Symp., volume 983 of Lecture Notes in Computer Science, pages 100117. Springer, 1995.
6. A. Cortesi, G. File, and W. Winsborough. Prop revisited: Prepositional formula as abstract domain for groundness analysis. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, pages 322-327, Amsterdam, The Netherlands, July 15-18 1991. IEEE Computer Society Press.
7. A. Cortesi, G. File, and W. Winsborough. Comparison of abstract interpretations. In W. Kuich, editor, Automata, Languages and Programming: Proc. Nineteenth Int. Coll., volume 623 of Lecture Notes in Computer Science, pages 521-532. Springer-Verlag, 1992.
8. A. Cortesi, G. File, and W. Winsborough. Optimal groundness analysis using propositional logic. Journal of Logic Programming, 27(2):137-167, 1996.
9. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. Fourth ACM Symp. Principles of Programming Languages, pages 238-252. ACM Press, 1977.
10. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2-3):103-179, 1992.
11. D. Jacobs and A. Langen. Accurate and efficient approximation of variable aliasing in logic programs. In E. L. Lusk and R. A. Overbeek, editors, Logic Programming: Proc. North American Conf. 1989, pages 154-165. MIT Press, 1989.
12. D. Jacobs and A. Langen. Static analysis of logic programs for independent and parallelism. Journal of Logic Programming, 13(2 &; 3):291-314, 1992.
13. A. Langen. Advanced Techniques for Approximating Variable Aliasing in Logic Programs. PhD thesis, University of Southern California, California, 1991.
14. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.
15. K. Marriott and H. Søndergaard. Notes for a tutorial on abstract interpretation of logic programs. Tutorial Notes for 1989 North American Conf. Logic Programming. Assoc, for Logic Programming, 1989.
16. K. Marriott and H. Søndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems, 2(1-4):181-196, 1993.
17. H. Søndergaard. An application of abstract interpretation of logic programs: Occur check reduction. In B. Robinet and R. Wilhelm, editors, Proc. ESOP 86, volume 213 of Lecture Notes in Computer Science, pages 327-338. Springer-Verlag, 1986.