On termination of binary CLP programs

Lecture Notes in Computer Science

Volumn 3573, Issue , 2005, Pages 231-244

  Serebrenik, Alexander ^a   Mesnard, Fred ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITÉ DE LA RÉUNION   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; INPUT OUTPUT PROGRAMS;

BINARY CLP PROGRAMS; LINEAR FUNCTIONS; LINEAR LEVEL MAPPINGS; TERMINATION ANALYSIS COMMUNITY;

LOGIC PROGRAMMING;

EID: 26444530957     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11506676_15     Document Type: Conference Paper

References (19)

1. K. R. Apt and M. Bezem. Acyclic programs. New Generation Computing, 9(3/4):335-364, 1991.
2. M. Codish. TerminWeb. Collection of benchmarks available at: http://lvs.cs.bgu.ac.il/~mcodish/suexec/terminweb/bin/terminweb.cgi?command= examples.
3. M. Codish and S. Genaim. Proving termination one loop at a time. In A. Serebrenik and F. Mesnard, editors. Proceedings of the 13th International Workshop on Logic Programming Environments, Technical report CW 371, Department of Computer Science, K.U.Leuven, pages 48-59, 2003.
4. M. Codish and C. Taboch. A semantic basis for termination analysis of logic programs. Journal of Logic Programming, 41(1):103-123, 1999.
5. D. De Schreye, K. Verschaetse, and M. Bruynooghe. A practical technique for detecting non-terminating queries for a restricted class of Horn clauses, using directed, weighted graphs. In D. H. Warren and P. Szeredi, editors, Logic Programming, Proceedings of the Seventh International Conference, pages 649-663. MIT Press, 1990.
6. P. Devienne, P. Lebègue, and J.-C. Routier. Halting problem of one binary horn clause is undecidable. In P. Enjalbert, A. Finkel, and K. W. Wagner, editors, STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings., volume 665 of Lecture Notes in Computer Science, pages 48-57. Springer Verlag, 1993.
7. R. W. Floyd. Assigning meanings to programs. In J. Schwartz, editor, Mathematical Aspects of Computer Science, pages 19-32. American Mathematical Society, 1967. Proceedings of Symposium in Applied Mathematics; v. 19.
8. J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19/20:503-582, May/July 1994.
9. S. Katz and Z. Manna. A closer look at termination. Acta Informatica, 5:333-352, 1975.
10. V. Lagoon, F. Mesnard, and P. J. Stuckey. Termination analysis with types is more accurate. In C. Palamidessi, editor, Logic Programming, 19th International Conference on Logic Programming, pages 254-269. Springer Verlag, 2003.
11. N. Lindenstrauss and Y. Sagiv. Automatic termination analysis of logic programs. In L. Naish, editor, Proceedings of the Fourteenth International Conference on Logic Programming, pages 63-77. MIT Press, July 1997.
12. J. C. Martin and A. King. On the inference of natural level mappings. In M. Bruynooghe and K.-K. Lau, editors, Program Development in Computational Logic, volume 3049 of Lecture Notes in Computer Science. Springer Verlag, 2004.
13. F. Mesnard and U. Neumerkel. Applying static analysis techniques for inferring termination conditions of logic programs. In P. Cousot, editor, Static Analysis, 8th International Symposium, SAS 2001, volume 2126 of Lecture Notes in Computer Science, pages 93-110. Springer Verlag, 2001.
14. F. Mesnard and S. Ruggieri. On proving left termination of constraint logic programs. ACM Transaction on Computational Logic, 4(2):207-259, 2003.
15. S. Ruggieri. Decidability of logic program semantics and applications to testing. Journal of Logic Programming, 46(1-2):103-137, November/December 2000.
16. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
17. A. Serebrenik and D. De Schreye. Inference of termination conditions for numerical loops in Prolog. Theory and Practice of Logic Programming, 2004. to appear.
18. K. Sohn and A. Van Gelder. Termination detection in logic programs using argument sizes. In Proceedings of the Tenth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems, pages 216-226. ACM Press, 1991.
19. W. Winsborough. Multiple specialization using minimal-function graph semantics. Journal of Logic Programming, 13(2/3):259-290, 1992.