Inferring termination conditions for logic programs using backwards analysis
From MaRDI portal
Publication:2996201
DOI10.1007/3-540-45653-8_47zbMATH Open1275.68046arXivcs/0312023OpenAlexW1496121453MaRDI QIDQ2996201FDOQ2996201
Authors: Samir Genaim, Michael Codish 
Publication date: 6 May 2011
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/cs/0312023
Recommendations
Cited In (7)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
