Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Inference of monotonicity constraints in datalog programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Termination detection in logic programs using argument sizes (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handbook of theoretical computer science (vol. B)
Abstract interpretation and application to logic programs
Journal of Logic Programming
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Inferring Argument Size Relationships with CLP(R)
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Combining Norms to Prove Termination
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Detecting Optimal Termination Conditions of Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Analysis of Linear Hybrid Systems in CLP
Logic-Based Program Synthesis and Transformation
Fully automatic binding-time analysis for prolog
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
| Hi-index | 0.00 |
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to verify termination for a specified mode. The contribution is a methodology which combines traditional termination analysis and backwards analysis to obtain termination inference. This leads to a better understanding of termination inference, simplifies its formal justification, and facilitates implementation. We evaluate the application of this approach to enhance an existing termination analyzer to perform also termination inference.