On the existence of nonterminating queries for a restricted class of PROLOG-clauses
Artificial Intelligence
An analysis of loop checking mechanisms for logic programs
Theoretical Computer Science
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
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
Termination Analysis for Mercury
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
DART: directed automated random testing
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
CUTE: a concolic unit testing engine for C
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Nontermination inference of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination of String Rewriting Proved Automatically
Journal of Automated Reasoning
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
| Hi-index | 0.00 |
On the one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide this line of research into two kinds of approaches, dynamic versus static analysis, this paper belongs to the latter. It proposes a criterion for detecting non-terminating atomic queries with respect to binary constraint logic programming (CLP) rules, which strictly generalizes our previous works on this subject. We give a generic operational definition and an implemented logical form of this criterion. Then we show that the logical form is correct and complete with respect to the operational definition.