Deciding Innermost Loops

Authors:
René Thiemann;Jürgen Giesl;Peter Schneider-Kamp
Affiliations:
Institute of Computer Science, University of Innsbruck, Austria;LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany
Venue:
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Year:
2008

Citing 15
Cited 2

Termination of rewriting

Journal of Symbolic Computation
Overlap closures do not suffice for termination of general term rewriting systems

Information Processing Letters
Unification of infinite sets of terms schematized by primal grammars

Theoretical Computer Science
Term rewriting and all that

Term rewriting and all that
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
Termination of String Rewriting Proved Automatically

Journal of Automated Reasoning
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features

Information and Computation
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
The termination competition

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving and disproving termination of higher-order functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Automated termination analysis for Haskell: from term rewriting to programming languages

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems

Fundamenta Informaticae

From Outermost Termination to Innermost Termination

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Loops under Strategies

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first method to disprove innermosttermination of term rewrite systems automatically. To this end, we first develop a suitable notion of an innermost loop. Second, we show how to detect innermost loops: One can start with any technique amenable to find loops. Then our novel procedure can be applied to decide whether a given loop is an innermost loop. We implemented and successfully evaluated our method in the termination prover AProVE.