Inference of termination conditions for numerical loops

Details Inference of termination conditions for numerical loops Inference of termination conditions for numerical loops

2001-06-26

arxiv.org/abs/cs/0106053v1

Computer Science

Programming Languages

Presented at WST2001

Scientific paper

We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the integers. We present a technique that allows to overcome these difficulties. Our approach is based on transforming a program in way that allows integrating and extending techniques originally developed for analysis of numerical computations in the framework of query-mapping pairs with the well-known framework of acceptability. Such an integration not only contributes to the understanding of termination behaviour of numerical computations, but also allows to perform a correct analysis of such computations automatically, thus, extending previous work on a constraints-based approach to termination. In the last section of the paper we discuss possible extensions of the technique, including incorporating general term orderings.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-641887