Proving non-looping non-termination automatically

Authors:
Fabian Emmes;Tim Enger;Jürgen Giesl
Affiliations:
LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany
Venue:
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Year:
2012

Citing 11
Cited 1

Termination of String Rewriting Proved Automatically

Journal of Automated Reasoning
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

Journal of Automated Reasoning
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Loop detection in term rewriting using the eliminating unfoldings

Theoretical Computer Science
VMTL---A Modular Termination Laboratory

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Tyrolean Termination Tool 2

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

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Automating the dependency pair method

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
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 detection of non-termination and nullpointerexceptions for Java Bytecode

FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software

Solving existentially quantified horn clauses

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-looping non-termination.