Inferring termination conditions for logic programs using backwards analysis
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(7)- scientific article; zbMATH DE number 1948416 (Why is no real title available?)
- Analysis of Linear Hybrid Systems in CLP
- Functional and Logic Programming
- Inferring termination conditions for logic programs using backwards analysis
- A semantic basis for the termination analysis of logic programs
- scientific article; zbMATH DE number 1834571 (Why is no real title available?)
- Loop detection in term rewriting using the eliminating unfoldings
This page was built for publication: Inferring termination conditions for logic programs using backwards analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996201)
