Journal of Symbolic Computation
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Efficient tests for top-down termination of logical rules
Journal of the ACM (JACM)
Static inference of modes and data dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Termination proofs for logic programs
Termination proofs for logic programs
A practical framework for the abstract interpretation of logic programs
Journal of Logic Programming
Proving termination of logic programs by exploiting term properties
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Advances in distributed computing (ADC) and colloquium on combining paradigms for software development (CCPSD): Vol. 2
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
Inference of inequality constraints in logic programs (extended abstracts)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handbook of theoretical computer science (vol. B)
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Types in logic programming
ESOP'92 Symposium proceedings on 4th European symposium on programming
Proving termination properties of Prolog programs: a semantic approach
Journal of Logic Programming
Strong termination of logic programs
Journal of Logic Programming
Automatic inference of norms: a missing link in automatic termination analysis
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Modular termination proofs for logic and pure PROLOG programs
Advances in logic programming theory
Termination analysis: some practical properties of the norm and level mapping space
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
An Efficient Unification Algorithm
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
Live Data Structures in Logic Programs
Live Data Structures in Logic Programs
Implementing a Finite-domain CLP-language on Top of Prolog: a Transformational Approach
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Proving Termination of General Prolog Programs
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Typed Norms for Typed Logic Programs
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Termination Analysis for Mercury
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Verification Tools in the Development of Provably Correct Compilers
FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
Logic Programs as term Rewriting Systems
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
A Transformational Methodology for Proving Termination of Logic Programs
CSL '91 Proceedings of the 5th Workshop on Computer Science Logic
Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Proving Termination of Prolog Programs
Proceedings of the Conference on Logic of Programs
Termination proofs for logic programs with tabling
ACM Transactions on Computational Logic (TOCL)
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
On Termination of Meta-Programs
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Negation as Failure through Abduction: Reasoning about Termination
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Acceptability with General Orderings
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Reuse of Results in Termination Analysis of Typed Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
On Termination of Logic Programs with Floating Point Computations
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Inference of Termination Conditions for Numerical Loops in Prolog
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Termination of well-typed logic programs
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
A dynamic approach to characterizing termination of general logic programs
ACM Transactions on Computational Logic (TOCL)
On modular termination proofs of general logic programs
Theory and Practice of Logic Programming
Classes of terminating logic programs
Theory and Practice of Logic Programming
Inference of termination conditions for numerical loops in Prolog
Theory and Practice of Logic Programming
Bounded Nondeterminism of Logic Programs
Annals of Mathematics and Artificial Intelligence
cTI: a constraint-based termination inference tool for ISO-Prolog
Theory and Practice of Logic Programming
On termination of meta-programs
Theory and Practice of Logic Programming
Termination of Floating-Point Computations
Journal of Automated Reasoning
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
Termination Analysis of Logic Programs Based on Dependency Graphs
Logic-Based Program Synthesis and Transformation
A New Approach to Non-termination Analysis of Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Termination prediction for general logic programs
Theory and Practice of Logic Programming
Polytool: proving termination automatically based on polynomial interpretations
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
Theory and Practice of Logic Programming
Polynomial interpretations as a basis for termination analysis of logic programs
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Input-termination of logic programs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Improved termination analysis of CHR using self-sustainability analysis
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Probabilistic termination of CHRiSM programs
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
| Hi-index | 0.00 |
Current norm-based automatic termination analysis techniques for logic programs can be split up into different components: inference of mode or type information, derivation of models, generation of well-founded orders, and verification of the termination conditions themselves. Although providing high-precision results, these techniques suffer from an efficiency point of view, as several of these analyses are often performed through abstract interpretation. We present a new termination analysis which integrates the various components and produces a set of constraints that, when solvable, identifies successful termination proofs. The proposed method is both efficient and precise. The use of constraint sets enables the propagation on information over all different phases while the need for multiple analyses is considerably reduced.