Precise pair-sharing analysis of logic programs

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02)

Volumn , Issue , 2002, Pages 99-108

  Lagoon, Vitaly ^a   Stuckey, Peter J ^a  

^a NONE

Author keywords

Program analysis; Sharing

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; GRAPH THEORY; OPTIMIZATION; PROGRAM COMPILERS;

GROUNDNESS INFORMATION;

LOGIC PROGRAMMING;

EID: 0036992135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571157.571168     Document Type: Conference Paper

References (15)

1. K. R. Apt. Introduction to logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495-574. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.
2. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Boolean functions for dependency analysis: Algebraic properties and efficient representation. In 1st International Symposium on Static Analysis, volume 864 of LNCS, pages 266-280. Springer-Verlag, 1994.
3. R. Bagnara, P. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. In 4th International Symposium on Static Analysis, volume 1302 of LNCS, pages 53-67. Springer-Verlag, 1997.
4. R. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
5. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symp. on Principles of Programming Languages, pages 238-252, 1977.
6. M. García de la Banda, K. Marriott, P.J. Stuckey, and H. Søndergaard. Differential methods in logic program analysis. Journal of Logic Programming, 35(1):1-37, 1998.
7. M. Hermenegildo, F. Bueno, D. Cabeza, M. Carro, M. García de la Banda, and G. Puebla P. López-García. The CIAO multi-dialect compiler and system: An experimentation workbench for future (C)LP systems. In Parallelism and Implementation of Logic and Constraint Logic Programming, pages 65-85. Nova Science, 1999.
8. M. Hermenegildo and K. Greene. &-Prolog and its performance: Exploiting independent And-Parallelism. In D. H. D. Warren and P. Szeredi, editors, Proceedings of the 7th Int. Conf. on Logic Programming, pages 253-268. MIT Press, 1990.
9. D. Jacobs and A. Langen. Static analysis of logic programs for independent AND-parallelism. JLP, 13(2 & 3):291-314, 1992.
10. V. Lagoon and P.J. Stuckey. Precise pair-sharing analysis of logic programs. Technical report, Department of Computer Science and Software Engineering, University of Melbourne, 2002. http://www.cs.mu.oz.au/̃pjs/papers.html.
11. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1988.
12. K. Marriott and H. Søndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems (LOPLAS), 2(1-4):181-196, 1993.
13. K. Muthukumar and M. Hermenegildo. Compile-time derivation of variable dependency using Abstract Interpretation. JLP, 13(2&3):315-347, 1992.
14. D. A. Plaisted. The occur-chack problem in Prolog. In Int. Symp. on Logic Programming, pages 272-280. IEEE Computer Society Press, 1984.
15. H. Søndergaard. An application of abstract interpretation of logic programs: Occur check reduction. In B. Robinet and R. Wilhelm, editors, Proceedings of European Symp. on Programming, volume 213 of LNCS, pages 327-338. Springer-Verlag, 1986.