Computer Science – Programming Languages
Scientific paper
2001-10-17
Computer Science
Programming Languages
To appear in Theory and Practice of Logic Programming. To appear in Theory and Practice of Logic Programming
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 overcoming these difficulties. Our approach is based on transforming a program in a 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 us to perform a correct analysis of such computations automatically, by extending previous work on a constraint-based approach to termination. Finally, we discuss possible extensions of the technique, including incorporating general term orderings.
Schreye Danny de
Serebrenik Alexander
No associations
LandOfFree
Inference of termination conditions for numerical loops in 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 Inference of termination conditions for numerical loops in Prolog, 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 in Prolog will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-347480