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
Implication of clauses is undecidable
Theoretical Computer Science
On the existence of nonterminating queries for a restricted class of PROLOG-clauses
Artificial Intelligence
The craft of Prolog
Termination proofs for logic programs
Termination proofs for logic programs
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
An analysis of loop checking mechanisms for logic programs
Theoretical Computer Science
The Mixtus approach to automatic partial evaluation of full Prolog
Proceedings of the 1990 North American conference on Logic programming
A model-theoretic reconstruction of the operational semantics of logic programs
Information and Computation
Mixtus: an automatic partial evaluator for full Prolog
New Generation Computing
Modular termination proofs for logic and pure PROLOG programs
Advances in logic programming theory
From logic programming to Prolog
From logic programming to Prolog
An extended variant of atoms loop check for positive logic programs
New Generation Computing
Goal independency and call patterns in the analysis of logic programs
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Loop checks for logic programs with functions
Theoretical Computer Science
Termination of Logic Programs Using Semantic Unification
LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
Detecting Optimal Termination Conditions of Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
TermiLog: A System for Checking Termination of Queries to Logic Programs
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Halting Problem of One Binary Horn Clause is Undecidable
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
A dynamic approach to characterizing termination of general logic programs
ACM Transactions on Computational Logic (TOCL)
cTI: a constraint-based termination inference tool for ISO-Prolog
Theory and Practice of Logic Programming
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
A non-termination criterion for binary constraint logic programs
Theory and Practice of Logic Programming
Research Summary: Non-termination Analysis of Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A New Approach to Non-termination Analysis of Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
Experiments with Non-Termination Analysis for Java Bytecode
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination prediction for general logic programs
Theory and Practice of Logic Programming
Detecting non-termination of term rewriting systems using an unfolding operator
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Non-termination analysis of logic programs using types
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Automated detection of non-termination and nullpointerexceptions for Java Bytecode
FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
Non-termination analysis and cost-based query optimization of logic programs
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
| Hi-index | 0.00 |
We present a static analysis technique for nontermination inference of logic programs. Our framework relies on an extension of the subsumption test, where some specific argument positions can be instantiated while others are generalized. We give syntactic criteria to statically identify such argument positions from the text of a program. Atomic left looping queries are generated bottom-up from selected subsets of the binary unfoldings of the program of interest. We propose a set of correct algorithms for automating the approach. Then, nontermination inference is tailored to attempt proofs of optimality of left termination conditions computed by a termination inference tool. An experimental evaluation is reported and the analyzers can be tried online at http://www.univ-reunion.fr/~gcc. When termination and nontermination analysis produce complementary results for a logic procedure, then with respect to the leftmost selection rule and the language used to describe sets of atomic queries, each analysis is optimal and together, they induce a characterization of the operational behavior of the logic procedure.