Constraint-based termination analysis of logic programs

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 6, 1999, Pages 1137-1195

  Decorte, Stefaan ^a   De Schreye, Danny ^a   Vandecasteele, Henk ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

1.2.2 Artificial Intelligence : Automatic Programming; 1.2.3 Artificial Intelligence : Deduction and Theorem Proving; Constraint solving; Languages; Logic programming; Termination analysis; Verification

Indexed keywords

EID: 0001004312     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/330643.330645     Document Type: Article

References (54)

1. AGUZZI, G. AND MODIGLIANI, U. 1994. Proving termination of logic programs by transforming them into equivalent term rewriting systems. In Proceedings of FST and TCS. LNCS, vol. 761. Springer-Verlag, 114-124.
2. APT, K. 1990. Logic programming. In Handbook of Theoretical Computer Science. Vol. B, J. van Leeuwen, Ed. Elsevier Science Publishers.
3. APT, K. AND BEZEM, M. 1991. Acyclic programs. New Gen. Comput. 9, 335-363.
4. APT, K. AND PEDRESCHI, D. 1990. Studies in pure Prolog: Termination. In Proceedings Esprit Symposium on Computational Logic. Springer-Verlag, 150-176.
5. APT, K. AND PEDRESCHI, D. 1991. Proving termination of general Prolog programs. In Proc. International Conference on Theoretical Aspects of Computer Science.
6. APT, K. AND PEDRESCHI, D. 1994. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory. Oxford University Press, 183-229.
7. ARTS, T. AND ZANTEMA, H. 1993. Termination of logic programs via labelled term rewrite systems. In Proceedings of CSN'95. 22-34.
8. BAUDINET, M. 1992. Proving termination properties of Prolog programs: A semantic approach. J. Logic Program. 14, 1-29.
9. BEZEM, M. 1992. Characterizing termination of logic programs with level mappings. J. Logic Program. 15, 1 & 2, 79-98.
10. BOSSI, A., COCCO, N., AND FABRIS, M. 1991. Proving termination of logic programs by exploiting term properties. In Proc. CCPSD-TAPSOFT'91. Springer-Verlag, LNCS 494, 153-180.
11. BOSSI, A., COCCO, N., AND FABRIS, M. 1992. Typed norms. In Proc. ESOP'92, B. Krieg-Brueckner, Ed. Springer-Verlag, LNCS 582, 73-92.
12. BRODSKY, A. AND SAGIV, Y. 1989. On termination of Datalog programs. In First International Conference on Deductive and Object Oriented Databases. 95-112.
13. BRODSKY, A. AND SAGIV, Y. 1991. Inference of inequality constraints in logic programs. In Proceedings of the 10th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 227-240.
14. BRONSARD, F., LAKSHMAN, T., AND REDDY, U. 1992. A framework of directionality for proving termination of logic programs. In Proc. JICSLP '92, K. Apt, Ed. MIT Press, 321-335.
15. BRUYNOOGHE, M. 1991. A practical framework for the abstract interpretation of logic programs. J. Logic Program. 10, 2, 91-124.
16. BRUYNOOGHE, M. AND BOULANGER, D. 1994. Abstract interpretation for (constraint) logic programming. In Constraint Programming, J. P. B. Mayoh, E. Tyugu, Ed. NATO ASI Series, vol. F/131. Springer-Verlag, 228-258.
17. CODISH, M. AND TABOCH, C. 1997. A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints. In Proceedings of the Sixth International Conference on Algebraic and Logic Programming. To appear.
18. COUSOT, P. AND HALBWACHS, N. 1978. Automatic discovery of linear restraints among variables of a program. In Proceedings 5th ACM Symposium on Principles of Programming Languages. 84-96.
19. DE SCHREYE, D. AND DECORTE, S. 1994. Termination of logic programs: the never-ending story. J. Logic Program. 19 & 20, 199-260.
20. DE SCHREYE, D. AND VERSCHAETSE, K. 1992. Termination analysis of definite logic programs with respect to call patterns. Tech. Rep. CW 138, Department Computer Science, K.U.Leuven.
21. DE SCHREYE, D. AND VERSCHAETSE, K. 1995. Deriving linear size relations for logic programs by abstract interpretation. New Gen. Comput. 13, 2, 117-154.
22. DE SCHREYE, D., VERSCHAETSE, K., AND BRUYNOOGHE, M. 1992. A framework for analysing the termination of definite logic programs with respect to call patterns. In Proc. FGCS'92. ICOT, Tokyo, 481-488.
23. DEBRAY, S. 1989. Static inference of modes and data dependencies in logic programs. ACM Trans. Program. Lang. Syst. 11, 3 (July), 418-450.
24. DEBRAY, S. K. AND WARREN, D. S. 1986. Automatic mode inference for Prolog programs. In Proceedings 1986 Symposium on Logic Programming. 78-88.
25. DECORTE, S. AND DE SCHREYE, D. 1998. Termination analysis: Some practical properties of the norm and level mapping space. In Proceedings IJCSLP98, the International Joint Conference and Symposium on Logic Programming, J. Jafar, Ed. MIT Press, 235-249.
26. DECORTE, S., DE SCHREYE, D., AND FABRIS, M. 1993. Automatic inference of norms: A missing link in automatic termination analysis. In Proceedings ILPS'93, D. Miller, Ed. 420-436.
27. DECORTE, S., DE SCHREYE, D., AND FABRIS, M. 1997. Exploiting the power of typed norms in automatic inference of interargument relations. Tech. Rep. 246, Department of Computer Science, K.U.Leuven, Belgium.
28. DERSHOWITZ, N. 1987. Termination of rewriting. J. Symbol. Comput. 3, 1 & 2, 69-116.
29. FALASCHI, M., LEVI, G., MARTELLI, M., AND PALAMIDESSI, C. 1989. Declarative modelling of the operational behaviour of logic languages. Theoret. Comput. Sci. 69, 3, 289-318.
30. FRANCHEZ, N., GRUMBERG, O., KATZ, S., AND PNUELI, A. 1985. Proving termination of Prolog programs. In Logics of Programs, R. Parikh, Ed. Springer-Verlag, 89-105.
31. GANZINGER, H. AND WALDMANN, U. 1993. Termination proofs of well-moded logic programs via conditional rewrite systems. In Proceedings of CTRS'92. LNCS 656. Springer-Verlag, 216-222.
32. JANSSENS, G. AND BRUYNOOGHE, M. 1992. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Logic Program. 13, 2 & 3, 205-258.
33. LINDENSTRAUSS, N. AND SAGIV, Y. 1997. Automatic termination analysis of logic programs. In Proc. 14th International Conference on Logic Programming, L. Naish, Ed. 63-77.
34. LLOYD, J. 1987. Foundations of Logic Programming. Springer-Verlag.
35. MARCHIORI, M. 1994. Logic programs as term rewriting systems. In Proceedings of ALP'94. LNCS 850. Springer-Verlag, 223-241.
36. MARTELLI, A. AND MONTANARI, U. 1982. An efficient unification algorithm. ACM Trans. Program. Lang. Syst. 4, 2, 258-282.
37. MARTIN, J. C., KING, A., AND SOPER, P. 1996. Typed norms for typed logic programs. In Proceedings of LOPSTR'96: Logic Program Synthesis and Transformation, J. Gallagher, Ed. Number 1207 in LNCS. Springer-Verlag, 143-153.
38. MELLISH, C. 1985. Some global optimizations for a Prolog compiler. J. Logic Program. 2, 1 (April).
39. MESNARD, F. 1993. Etude de la terminaison des programmes logiques avec contraintes au moyen d'approximations. Ph.D. thesis, Paris VI.
40. MESNARD, F. 1996. Inferring left-terminating classes of queries for constraint logic programs. In Proc. IJCSLP96. MIT-Press, Bonn, Germany, 7-21.
41. MESNARD, F. AND MAILLARD, A. 1998. Clp(x) for automatically proving program properties. J. Logic Program. 37 (1-3), 77-94.
42. MULKERS, A. 1993. Deriving Live Data Structures in Logic Programs by Means of Abstract Interpretation. Number 675 in LNCS. Springer-Verlag.
43. PFENNING, F., ED. 1992. Types in Logic Programming. MIT Press.
44. PLÜMER, L. 1990. Termination Proofs for Logic Programs. Number 446 in LNAI. Springer-Verlag.
45. RAO, M. K., KAPUR, D., AND SHYAMASUNDAR, R. 1998. Transformational methodology for proving termination of logic programs. J. Logic Program. 34, 1, 1-42.
46. RAO, M. K., KAPUR, D., AND SHYAMASUNDAR, R. K. 1992. A transformational methodology for proving termination of logic programs. In Proc. CSL'92. LNCS 626. Springer.
47. RAO, M. K., PANDYA, P., AND SHYAMASUNDAR, R. K. 1993. Verification tools in the development of provably correct compilers. In Proceedings 5th Symposium on Formal Methods Europe FME'93.
48. SOHN, K. AND VAN GELDER, A. 1991. Termination detection in logic programs using argument sizes. In Proceedings 10th Symposium on Principles of Database Systems. ACM Press, 216-226.
49. SPEIRS, C., SOMOGYI, Z., AND SONDERGAARD, H. 1997. Termination Analysis for Mercury. In Proceedings of the Fourth International Symposium on Static Analysis, P. Van Hentenryck, Ed. Number 1302 in LNCS. Springer, 157-171.
50. ULLMAN, J. AND VAN GELDER, A. 1988. Efficient tests for top-down termination of logical rules. J. ACM 35, 2 (April), 345-373.
51. VAN GELDER, A. 1991. Deriving constraints among argument sizes in logic programs. Ann. Math. Artif. Intell. 3.
52. VANDECASTEELE, H. AND DE SCHREYE, D. 1994. Implementing a finite-domain CLP-language on top of Prolog: A transformational approach. In Proceedings of Logic Programming and Automated Reasoning, F. Pfenning, Ed. Lecture Notes in Artificial Intelligence 822. Springer-Verlag, 84-98.
53. VERSCHAETSE, K. 1992. Static termination analysis for definite Horn clause programs. Ph.D. thesis, Dept. Computer Science, K.U.Leuven. Accessible via http://www.cs.kuleuven.ac.be/~lpai.
54. WANG, B. AND SHYAMASUNDAR, R. 1994. A methodology for proving termination of logic programs. J. Logic Program. 21, 1, 1-30.