Theory of linear and integer programming
Theory of linear and integer programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient tests for top-down termination of logical rules
Journal of the ACM (JACM)
Termination proofs for logic programs
Termination proofs for logic programs
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
Abstract interpretation and application to logic programs
Journal of Logic Programming
A CLP language handling disjunctions of linear constraints
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Reasoning about termination of pure Prolog programs
Information and Computation
Effectiveness of global analysis in strict independence-based automatic parallelization
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Modular termination proofs for logic and pure PROLOG programs
Advances in logic programming theory
Prolog: the standard: reference manual
Prolog: the standard: reference manual
From logic programming to Prolog
From logic programming to Prolog
Constraint-based termination analysis of logic programs
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
Proving Existential Termination of Normal Logic Programs
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Inferring Argument Size Relationships with CLP(R)
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
STAN: A Static Analyzer for CLP(R) Based on Abstract Interpretation
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Termination Analysis for Mercury
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Negation as Failure through Abduction: Reasoning about Termination
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Combining Norms to Prove Termination
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
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
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Detecting Optimal Termination Conditions of Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
On termination of binary CLP programs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
| Hi-index | 0.00 |
We present the implementation of cTI, a system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiringu ser annotations. With termination inference such annotations are no longer necessary. Instead, all provably terminatingclasses to all related predicates are inferred at once. The architecture of cTI is described1 and some optimizations are discussed. Runningti mes for classical examples from the termination literature in LP and for some middle-sized logic programs are given.