Non-Termination Inference of Logic Programs

Details Non-Termination Inference of Logic Programs Non-Termination Inference of Logic Programs

2004-06-22

arxiv.org/abs/cs/0406041v1

Computer Science

Programming Languages

Long version (algorithms and proofs included) of a paper submitted to TOPLAS

Scientific paper

We present a static analysis technique for non-termination inference of logic programs. Our framework relies on an extension of the subsumption test, where some specific argument positions can be instantiated while others are generalized. We give syntactic criteria to statically identify such argument positions from the text of a program. Atomic left looping queries are generated bottom-up from selected subsets of the binary unfoldings of the program of interest. We propose a set of correct algorithms for automating the approach. Then, non-termination inference is tailored to attempt proofs of optimality of left termination conditions computed by a termination inference tool. An experimental evaluation is reported. When termination and non-termination analysis produce complementary results for a logic procedure, then with respect to the leftmost selection rule and the language used to describe sets of atomic queries, each analysis is optimal and together, they induce a characterization of the operational behavior of the logic procedure.

Affiliated with

Also associated with

No associations

Rating

Non-Termination Inference of Logic Programs 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 Non-Termination Inference of Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-Termination Inference of Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-669475