On termination of constraint logic programs
This paper introduces a necessary and sufficient condition for termination of constraint logic programs. The method is based on assigning a dataflow graph to a program, whose nodes are the program points and whose arcs are abstractions of the rules of a transition system, describing the operational behaviour of constraint logic programs. Then termination is proven using a technique inspired by the seminal approach of Floyd for proving termination of flowchart programs.
Unable to display preview. Download preview PDF.
- [AB94]K.R. Apt and R. Bol. Logic programming and negation: a survey. JLP 19, 20: 9–72, 1994.Google Scholar
- [AMP94]K.R. Apt, E. Marchiori, and C. Palamidessi. A declarative approach for first-order built-in's of Prolog. Applicable Algebra in Engineering, Communication and Computation, 5(3/4), pp. 159–191, 1994.Google Scholar
- [BC89]A. Bossi and N. Cocco. Verifying correctness of logic programs. TAPSOFT, LNCS 352, pp. 96–110, 1989.Google Scholar
- [CMM95]L. Colussi, E. Marchiori and M. Marchiori. A dataflow semantics for constraint logic programs. In Proceedings of PLILP'95, to appear, 1995.Google Scholar
- [DSD94]D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. JLP 19, 20: 199–260, 1994.Google Scholar
- [Flo67]R.W. Floyd. Assigning meanings to programs. In J.T. Schwartz, editor, Proceedings Symposium in Applied Mathematics, volume 19 of Math. Aspects in Computer Science, pages 19–32. AMS, 1967.Google Scholar
- [JM94]J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. JLP 19, 20: 503–581, 1994.Google Scholar
- [Man70]Z. Manna. Termination of Programs Represented as Interpreted Graphs. Proc. Spring. J. Comp. Conf., pp. 83–89, 1970.Google Scholar
- [Mes93]F. Mesnard. Etude de la terminaison des programmes logiques avec constraintes aux moyens d'approximations. PhD Thesis, Paris VI, 1993.Google Scholar
- [WS94]B. Wang and R.K. Shyamasundar. A methodology for proving termination of logic programs. JLP 21(1): 1–30, 1994.Google Scholar