Semantic basis for the termination analysis of logic programs

Journal of Logic Programming

Volumn 41, Issue 1, 1999, Pages 103-123

  Codish, Michael ^a   Taboch, Cohavit ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; PROGRAM DEBUGGING; PROGRAM INTERPRETERS;

TERMINATION ANALYSIS;

LOGIC PROGRAMMING;

EID: 0032678119     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00006-0     Document Type: Article

References (42)

1. K.R. Apt, D. Pedreschi, Studies in pure Prolog: termination, in: J.W. Lloyd (Ed.), Computational Logic, Springer, Berlin, 1990, pp. 150-176.
2. K.R. Apt, D. Pedreschi, Reasoning about termination of pure Prolog programs, Information and Computation 106 (1) (1993) 109-157.
3. K.R. Apt, D. Pedreschi, Modular termination proofs for logic and pure Prolog programs, in: Advances in Logic Programming Theory, Oxford University Press, Oxford, 1994, pp. 183-229.
4. F. Benoy, A. King, Inferring argument size relationships with CLP(ℛ), in: Sixth International Workshop on Logic Program Synthesis and Transformation (LOPSTR'96), 1996, pp. 204-223.
5. M. Bezem, Characterizing termination of logic programs with level mappings, in: E.L. Lusk, R.A. Overbeek (Eds.), Proceedings of the North American Conference on Logic Programming, MIT Press, Cleveland, Ohio, USA, 1989, pp. 69-80.
6. A. Bossi, N. Cocco, M. Fabris, Proving termination of logic programs by exploiting term properties, in: S. Abramsky, T. Maibaum (Eds.), Proceedings of TAPSOFT'91, number 494 in Lecture Notes in Computer Science, Springer, Berlin, 1991, pp. 153-180.
7. A. Brodsky, Y. Sagiv, Inference of monotonicity constraints in Datalog programs, in: Proceedings of the Eighth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems, 1989, pp. 190-199.
8. L. Cavedon. Continuity, consistency, and completeness properties for logic programs, in: G. Levi, M. Martelli (Eds.), Proceedings of the Sixth International Conference on Logic Programming, The MIT Press, Lisbon, 1989, pp. 571-584.
9. M. Codish, B. Demoen, Analysing logic programs using "prop"-ositional logic programs and a magic wand, The Journal of Logic Programming 25 (3) (1995) 249-274.
10. M. Codish, C. Taboch, A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints, in: M. Hanus, J. Heering, K. Meinke (Eds.), ALP97, number 1290 in Lecture Notes in Computer Science, Southampton, UK, Springer-Verlag, Berlin, 1997, pp. 31-45.
11. A. Cortesi, G. Filè, W. Winsboroug, Prop revisited: propositional formula as abstract domain for groundness analysis, in: Proceedings of the Sixth IEEE Symposium on Logic In Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1991, pp. 322-327.
12. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of the Fourth ACM Symposium on Principles of Programming Languages, 1977, pp. 238-252.
13. P. Cousot, R. Cousot, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, in: M. Bruynooghe, M. Wirsing (Eds.), Proceedings of the Fourth International Symposium on Programming Language Implementation and Logic Programming, number 631 in Lecture Notes in Computer Science, Leuven, Belgium, Springer, Berlin, 1992, pp. 269-295.
14. P. Cousot, N. Halbwachs, Automatic discovery of linear restraints among variables of a program, in: Proceedings of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978, pp. 84-96.
15. D. De Schreye, S. Decorte, Termination of logic programs: the never-ending story, The Journal of Logic Programming 19/20 (1994) 199-260.
16. D. DeSchreye, K. Verschaetse, Deriving linear size relations for logic programs by abstract interpretation, New Generation Computing 13 (2) (1995) 117-154.
17. D. De Schreye, K. Verschaetse, M. Bruynooghe, A framework for analyzing the termination of definite logic programs with respect to call patterns, in: Proceedings of the International Conference on Fifth Generation Computer Systems, ICOT, Japan, 1992, pp. 481-488, Association for Computing Machinery.
18. S. Decorte, D. De Schreye, Demand-driven and constraint-based automatic left-termination analysis for logic programs, in Ref. [37], pp. 78-92.
19. S. Decorte, D. De Schreye, M. Fabris. Automatic inference of norms: a missing link in automatic termination analysis, in: D. Miller (Ed.), Logic Programming - Proceedings of the 1993 International Symposium, MIT Press, Vancouver, Canada, 1993, pp. 420-436.
20. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative modeling of the operational behavior of logic languages, Theoretical Comput. Sci. 69 (3) (1989) 289-318.
21. R.W. Floyd, Assigning meanings to programs, in: J. Schwartz (Ed.), Proceedings of Symposium in Applied Mathematics, vol. 19, Mathematical Aspects of Computer Science, American Mathematical Society, Providence, RI, New York, 1967, pp. 19-32.
22. M. Gabbrielli, R. Giacobazzi, Goal independency and call patterns in the analysis of logic programs, in: Proceedings of the Ninth ACM Symposium on Applied Computing, ACM, New York, 1994, pp. 394-399.
23. M. Gabbrielli, G. Levi, M.C. Meo, Observable, behaviors and equivalences of logic programs, Information and Computation 122 (1) (1995) 1-29.
24. M. Gabbrielli, M.C. Meo, Fixpoint semantics for partial computed answer substitutions and call patterns, in: H. Kirchner, G. Levi (Eds.), Algebraic and Logic Programming, Proceedings of the Third International Conference, number 632 in Lecture Notes in Computer Science, Springer, Berlin, 1992, pp. 84-99.
25. A.V. Gelder, Deriving constraints among argument sizes in logic programs, in: Proceedins of the eleventh ACM Conference on Principles of Database Systems, ACM, New york, 1990, pp. 47-60.
26. R. Giacobazzi, S.K. Debray, G. Levi, Generalized semantics and abstract interpretation for constraint logic programs, The Journal of Logic Programming 25 (3) (1995) 191-247.
27. C.A. Gunter, D.S. Scott, Semantic domains, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, ch. 12, Elsevier, Amsterdam and The MIT Press, North-Holland, New York, 1990, pp. 633-674.
28. C. Holzbaur, OFAI clp(q,r) Manual, Edition 1.3.3. Austrian Research Institute for Artificial Intelligence, Vienna, 1995.
29. J. Jaffar, M.J. Maher, Constraint logic programming: a survey, The Journal of Logic Programming 19&20 (1994) 503-582.
30. M. Karr, Affine relationships among variables of a program, Acta Informatica 6 (1976) 133-151.
31. N. Lindenstrauss, Y. Sagiv, Automatic termination analysis of logic programs, in Ref. [37], pp. 63-77.
32. N. Lindenstrauss, Y. Sagiv, Automatic termination analysis of logic programs (with detailed experimental results). Technical report, Hebrew University, Jerusalem, 1997, Available at http:// www.cs.huji.ac.il/~naomil/app_v.ps.
33. J. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987.
34. Z. Manna, Lectures on the Logic of Computer Programming, Number 31 in Regional Conference Series in Applied Mathematics, Society for Industrial and Applied Mathematics, 1980.
35. K. Marriott, H. Søndergaard, Precise and efficient groundness analysis for logic programs, ACM Letters on Programming Languages and Systems 2 (1-4) (1993) 181-196.
36. F. Mesnard, Inferring left-terminating classes of queries for constraint logic programs, in: M.J. Maher (Ed.), Proceedings of the Joint International Conference and Symposium on Logic Programming, The MIT Press, Bonn, Germany, 1996, pp. 7-21.
37. L. Naish (Ed.), Proceedings of the Fourteenth International Conference on Logic Programming, The MIT Press, Leuven, Belgium, 1997.
38. L. Plümer, Termination Proofs for Logic Programs. Number 446 in Lecture Notes in Artificial Inteligence, Springer, Berlin, 1990.
39. Y. Sagiv, A termination test for logic programs, in: K.U. Vijay, A. Saraswat (Eds.), Proceedings of the International Logic Programming Symposium, MIT Press, San Diego, 1991, pp. 519-532.
40. C. Speirs, Z. Somogyi, H. Søndergaard, Termination analysis for Mercury, in: P. Van Hentenryck (Ed.), Static Analysis: Proceedings of the Fourth International Symposium, number 1302 in Lecture Notes in Computer Science, Springer, Berlin, 1997, pp. 157-171.
41. Swedish Institute of Computer Science, SICStus Prolog User's Manual, Release 3 #6, November 1997.
42. K. Verschaetse, D. De Schreye, Deriving termination proofs for logic programs, using abstract procedures, in: K. Furukawa (Ed.), Proceedings of the Eighth International Conference on Logic Programming, The MIT Press, Paris, France, 1991, pp. 301-315.