1
Download:
|
|
by Livio Colussi, Elena Marchiori, Massimo Marchiori
http://w3c1.inria.fr/People/Massimo/papers/cp95.ps.gz
Add To MetaCart
Abstract:
Abstract. 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. 1
Citations
| 402 | Assigning meanings to programs – Floyd - 1967 |
| 122 | Termination of logic programs: the never-ending story – Schreye, Decorte - 1994 |
| 62 | Inductive Assertion Method for Logic Programs – Drabent, Maluszynski - 1988 |
| 42 | Verifying correctness of logic programs – Bossi, Cocco - 1989 |
| 34 | Norms on terms and their use in proving universal termination of a logic program – Bossi, Cocco, et al. - 1994 |
| 12 | A methodology for proving termination of logic programs – Wang, Shyamasundar - 1994 |
| 7 | A declarative approach for first-order built-in's of Prolog – Apt, Marchiori, et al. - 1994 |
| 7 | Etude de la terminaison des programmes logiques avec contraintes, au moyen d'approximations – Mesnard - 1993 |
| 6 | Logic Programming and Negation: A Survey. JLP – Apt, Bol - 1994 |
| 5 | Constraint Logic Programming: A Survey. JLP – Jaffar, Maher - 1994 |
| 3 | A dataflow semantics for constraint logic programs – Colussi, Marchiori, et al. - 1995 |
| 3 | Termination of Programs Represented as Interpreted Graphs – Manna - 1970 |
