Inferring termination conditions for logic programs using backwards analysis

Theory and Practice of Logic Programming

Volumn 5, Issue 1-2, 2005, Pages 75-91

  Genaim, Samir ^a   Codish, Michael ^b  

^a UNIVERSITY OF VERONA   (Italy)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Abstract interpretation; Backwards analysis; Program analysis; Termination analysis

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; BOOLEAN ALGEBRA; CONSTRAINT THEORY; MATHEMATICAL TECHNIQUES; NUMERICAL ANALYSIS; SEMANTICS;

ABSTRACT INTERPRETATION; BACKWARDS ANALYSIS; PROGRAM ANALYSIS; TERMINATION ANALYSIS;

LOGIC PROGRAMMING;

EID: 14544288194     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068404002236     Document Type: Review

References (24)

1. APT, K. R. 1990. Introduction to logic programming. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B: Formal Models and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, 495-574.
2. ARMSTRONG, T., MARRIOTT, K., SCHACHTE, P. AND SØNDERGAARD, H. 1998. Two classes of Boolean functions for dependency analysis. Science of Computer Programming 31, 1, 3-45.
3. BENOY, F. AND KING, A. 1996. Inferring argument size relationships with CLP(R). In Sixth International Workshop on Logic Program Synthesis and Transformation (LOPSTR'96). 204-223.
4. BRODSKY, A. AND SAGIV, Y. 1989. Inference of monotonicity constraints in Datalog programs. In Proceedings of the Eighth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems. 190-199.
5. CODISH, M. AND DEMOEN, B. 1995. Analysing logic programs using "prop"-ositional logic programs and a magic wand. J. Logic Program. 25, 3 (December), 249-274.
6. CODISH, M., GENAIM, S. AND TABOCH, C. 2002. TerminWeb: A Termination Analyzer for Logic Programs. http://www.cs.bgu.ac.il/~mcodi8h/TerminWeb.
7. CODISH, M. AND TABOCH, C. 1999. A semantic basis for the termination analysis of logic programs. The Journal of Logic Programming 41, 1, 103-123.
8. COUSOT, P. AND COUSOT, 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.
9. COUSOT, P. AND COUSOT, R. 1992. Abstract interpretation and application to logic programs. The Journal of Logic Programming 13, 2-3, 103-179.
10. COUSOT, P. AND HALBWACHS, N. 1978. Automatic discovery of linear restraints among variables of a program. In Proceedings of the Fifth Annual ACM Symposium on Principles of Programming Languages. 84-96.
11. DE SCHREYE, D. AND DECORTE, S. 1994. Termination of logic programs: the never-ending story. The Journal of Logic Programming 19 & 20, 199-260.
12. DE SCHREYE, D. AND VERSCHAETSE, K. 1995. Deriving linear size relations for logic programs by abstract interpretation. New Generation Computing 13, 02, 117-154.
13. GENAIM, S. AND CODISH, M., 2001. Inferring termination conditions for logic programs using backwards analysis. In Proceedings of the Eighth International Conference on Logic for Programming, Artificial Intelligence and Reasoning, R. Nieuwenhuis and A. Voronkov, Eds. Lecture Notes in Artificial Intelligence, vol. 2250. Springer-Verlag, 681-690.
14. GIACOBAZZI, R. AND SCOZZARI, F. 1998. A logical model for relational abstract domains. ACM Transactions on Programming Languages and Systems 20, 5, 1067-1109.
15. KARR, M. 1976. Affine relationships among variables of a program. Acta Informatica 6, 133-151.
16. KING, A. AND Lu, L. 2002. A Backward Analysis for Constraint Logic Programs. Theory and Practice of Logic Programming 2, 4-5 (July), 517-547.
17. LINDENSTRAUSS, N. AND SAGIV, Y. 1997. Automatic termination analysis of logic programs. In Proceedings of the Fourteenth International Conference on Logic Programming, L. Naish, Ed. The MIT Press, Leuven, Belgium, 63-77.
18. LLOYD, J. W. 1987. Foundations of Logic Programming, second ed. Springer-Verlag, Berlin.
19. MARRIOTT, K. AND SBNDERGAARD, H. 1993. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems 2, 1-4, 181-196.
20. MESNARD, F. 1996. Inferring left-terminating classes of queries for constraint logic programs. Proc. of JICSLP'96, 1-21.
21. MESNARD, F. AND NEUMERKEL, U. 2001. Applying static analysis techniques for inferring termination conditions of logic programs. In Static Program Analysis Symposium, P. Cousot, Ed. Lecture Notes in Computer Science, vol. 2126. Springer, 93-110.
22. MESNARD, F. AND RUGGIERI, S. 2001. On proving left termination of constraint logic programs. Tech. rep., Universite de La Reunion.
23. SCHACHTE, P. 1999. Precise and efficient static analysis of logic programs. Ph.D. thesis, The University of Melbourne, Australia.
24. SOHN, K. AND VAN GELDER, A. 1991. Termination detection in logic programs using argument sizes. In Intl. Symp. on Principles of Database Systems. ACM Press, 216-226.