Inferring Termination Conditions for Logic Programs using Backwards Analysis

Details Inferring Termination Conditions for Logic Programs using Backwards Analysis Inferring Termination Conditions for Logic Programs using Backwards Analysis

2003-12-12

arxiv.org/abs/cs/0312023v1

Computer Science

Programming Languages

Scientific paper

This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalises traditional termination analysis where an analyser tries to verify termination for a specified mode. Our contribution is a methodology in which components of traditional termination analysis are combined with backwards analysis to obtain an analyser for termination inference. We identify a condition on the components of the analyser which guarantees that termination inference will infer all modes which can be checked to terminate. The application of this methodology to enhance a traditional termination analyser to perform also termination inference is demonstrated.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-538870