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.