Detecting non-termination of term rewriting systems using an unfolding operator

Authors:
Étienne Payet
Affiliations:
IREMIA, Université de la Réunion, France
Venue:
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Year:
2006

Citing 16
Cited 2

Counterexamples to termination for the direct sum of term rewriting systems

Information Processing Letters
Termination of rewriting

Journal of Symbolic Computation
Semi-unification

Theoretical Computer Science
Rules and strategies for transforming functional and logic programs

ACM Computing Surveys (CSUR)
Term rewriting and all that

Term rewriting and all that
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Goal independency and call patterns in the analysis of logic programs

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Narrowing Approximations as an Optimization for Equational Logic Programs

PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Narrowing Directed by a Graph of Terms

RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Safe Folding/Unfolding with Conditional Narrowing

ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Rules + strategies for transforming lazy functional logic programs

Theoretical Computer Science
cTI: a constraint-based termination inference tool for ISO-Prolog

Theory and Practice of Logic Programming
Nontermination inference of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving and disproving termination of higher-order functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Simplification Orderings: History Of Results

Fundamenta Informaticae

Deciding Innermost Loops

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Termination prediction for general logic programs

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an approach to nontermination of term rewriting systems inspired by a technique that was designed in the context of logic programming. Our method is based on a classical unfolding operation together with semi-unification and is independent of a particular reduction strategy. We also describe a technique to reduce the explosion of rules caused by the unfolding process. The analyser that we have implemented is able to solve most of the nonterminating examples in the Termination Problem Data Base.