Sharing and groundness dependencies in logic programs

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 5, 1999, Pages 948-976

  Codish, Michael ^a   Søndergaard, Harald ^b   Stuckey, Peter J ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Abstract interpretation; Boolean functions; Dataflow analysis; Global analysis; Invariants; Languages; Logic programming; Logics of programs; Optimization; Processors compilers; Specifying and Verifying and Reasoning about Programs assertions; Theory

Indexed keywords

EID: 0013164133     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/330249.330252     Document Type: Article

References (28)

1. ARMSTRONG, T., MARRIOTT, K., SCHACHTE, P., AND SØNDERGAARD, H. 1998. Two classes of Boolean functions for dependency analysis. Sci. Comput. Program. 31, 1, 3-45.
2. BAGNARA, R. AND SCHACHTE, P. 1998. Factorizing equivalent variable pairs in ROBDD-based implementations of Pos. In Proc. 7th Int. Conf. Algebraic Methodology and Software Technology (AMAST '98), A. Haeberer, Ed. Lecture Notes in Computer Science, vol. 1548. Springer, Berlin, 471-485.
3. BAGNARA, R., HILL, P., AND ZAFFANELLA, E. 1997. Set-sharing is redundant for pair-sharing. In Static Analysis: Proc. 4th Int. Symp., P. V. Hentenryck, Ed. Lecture Notes in Computer Science, vol. 1302. Springer, Berlin, 53-67. Extended version to appear in Theoretical Computer Science.
4. BRYANT, R. 1992. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24, 3, 293-318.
5. CODISH, M. AND SONDERGAARD, H. 1998. The Boolean logic of set sharing analysis. In Principles of Declarative Programming, C. Palamidessi, H. Glaser, and K. Meinke, Eds. Lecture Notes in Computer Science, vol. 1490. Springer, Berlin, 89-101.
6. CODISH, M., MULKERS, A., BRUYNOOGHE, M., DE LA BANDA, M. G., AND HERMENEGILDO, M. 1995. Improving abstract interpretations by combining domains. ACM Trans. Program. Lang. Syst. 17, 1, 28-44.
7. CORTESI, A. AND FILÉ, G. 1999. Sharing is optimal. J. Logic Program. 38, 3, 371-386.
8. CORTESI, A., FILÉ, G., GIACOBAZZI, R., PALAMIDESSI, C., AND RANZATO, F. 1995. Complementation in abstract interpretation. In Static Analysis: Proc. 2nd Int. Symp., A. Mycroft, Ed. Lecture-Notes in Computer Science, vol. 983. Springer, Berlin, 100-117.
9. CORTESI, A., FILÉ, G., GIACOBAZZI, R., PALAMIDESSI, C., AND RANZATO, F. 1997. Complementation in abstract interpretation. ACM Trans. Program. Lang. Syst. 19, 1, 7-47.
10. CORTESI, A., FILÉ, G., AND WINSBOROUGH, W. 1991. Prop revisited: Propositional formula as abstract domain for groundness analysis. In Proc. 6th Annual IEEE Symp. Logic m Computer Science. IEEE Computer Society Press, Los Alamitos, California, 322-327.
11. CORTESI, A., FILÉ, G., AND WINSBOROUGH, W. 1992. Comparison of abstract interpretations. In Automata, Languages and Programming: Proc. 19th Int. Coll., W. Kuich, Ed. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, 521-532.
12. CORTESI, A., FILÉ, G., AND WINSBOROUGH, W. 1996. Optimal groundness analysis using propositional logic. J. Logic Program. 27, 2, 137-167.
13. CORTESI, A., FILÉ, G., AND WINSBOROUGH, W. 1998. The quotient of an abstract interpretation. Theor. Comput. Sci. 202, 1-2, 163-192.
14. CORTESI, A., LE CHARLIER, B., AND VAN HENTENRYCK, P. 1995. Evaluation of the domain Prop. J. Logic Program. 23, 3, 237-278.
15. COUSOT, P. AND COUOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM Symp. Principles of Programming Languages. ACM Press, New York, 238-252.
16. COUSOT, P. AND COUSOT, R. 1979. Systematic design of program analysis frameworks. In Proc. 6th ACM Symp. Principles of Programming Languages. ACM Press, New York, 269-282.
17. COUSOT, P. AND COUSOT, R. 1992. Abstract interpretation and application to logic programs. J. Logic Program. 13, 2-3, 103-179.
18. FECHT, C. 1997. Abstrakte interpretation logischer programme: Theorie, implementierung, generierung. Ph.D. thesis, Universität des Saarlandes, Germany.
19. JACOBS, D. AND LANGEN, A. 1989, Accurate and efficient approximation of variable aliasing in logic programs. In Logic Programming: Proc. North American Conf. 1989, E. L. Lusk and R. A. Overbeek, Eds. MIT Press, Cleveland, Ohio, 154-165.
20. JACOBS, D. AND LANGEN, A. 1992. Static analysis of logic programs for independent and parallelism. J. Logic Program. 13, 2 & 3, 291-314.
21. LANGEN, A. 1991. Advanced techniques for approximating variable aliasing in logic programs. Ph.D. thesis, University of Southern California, California.
22. LLOYD, J. W. 1987. Foundations of Logic Programming, second ed. Springer-Verlag, Berlin.
23. MARRIOTT, K. AND SØNDERGAARD, H. 1989. Notes for a tutorial on abstract interpretation of logic programs. Presented at the 1989 North American Conf. Logic Programming.
24. MARRIOTT, K. AND SØNDERGAARD, H. 1993. Precise and efficient groundness analysis for logic programs. Lett. Program. Lang. Syst. 2, 1-4, 181-196.
25. MARRIOTT, K., SØNDERGAARD, H., AND JONES, N. D. 1994. Denotational abstract interpretation of logic programs. ACM Trans. Program. Lang. Syst. 16, 3, 607-648.
26. SCHACHTE, P. 1999. Precise and efficient static analysis of logic programs. Ph.D. thesis, The University of Melbourne, Australia.
27. SCHRÖDER, E. 1877. Der Operationskreis des Logikkalküls. B. G. Teubner, Leibzig, Germany.
28. SØNDERGAARD, H. 1986. An application of abstract interpretation of logic programs: Occur check reduction. In Proc. ESOP 86, B. Robinet and R. Wilhelm, Eds. Lecture Notes in Computer Science, vol. 213. Springer-Verlag, Berlin, 327-338.