cTI: A constraint-based termination inference tool for ISO-Prolog

Details cTI: A constraint-based termination inference tool for ISO-Prolog cTI: A constraint-based termination inference tool for ISO-Prolog

2003-09-16

arxiv.org/abs/cs/0309028v1

Computer Science

Programming Languages

16 pages, 3 tables, to appear on "Theory and Practice of Logic Programming"

Scientific paper

We present cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis and checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, for instance by means of user annotations. Moreover, the analysis must be redone every time the class of queries of interest is updated. Termination inference, in contrast, requires neither user annotations nor recomputation. In this approach, terminating classes for all predicates are inferred at once. We describe the architecture of cTI and report an extensive experimental evaluation of the system covering many classical examples from the logic programming termination literature and several Prolog programs of respectable size and complexity.

Affiliated with

Also associated with

No associations

Rating

cTI: A constraint-based termination inference tool for ISO-Prolog does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with cTI: A constraint-based termination inference tool for ISO-Prolog, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and cTI: A constraint-based termination inference tool for ISO-Prolog will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-690404