Tyrolean Termination Tool 2

Authors:
Martin Korp;Christian Sternagel;Harald Zankl;Aart Middeldorp
Affiliations:
Institute of Computer Science, University of Innsbruck, Email: ttt2@informatik.uibk.ac.at, Innsbruck, Austria 6020;Institute of Computer Science, University of Innsbruck, Email: ttt2@informatik.uibk.ac.at, Innsbruck, Austria 6020;Institute of Computer Science, University of Innsbruck, Email: ttt2@informatik.uibk.ac.at, Innsbruck, Austria 6020;Institute of Computer Science, University of Innsbruck, Email: ttt2@informatik.uibk.ac.at, Innsbruck, Austria 6020
Venue:
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Year:
2009

Citing 19
Cited 22

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features

Information and Computation
On tree automata that certify termination of left-linear term rewriting systems

Information and Computation
Matrix Interpretations for Proving Termination of Term Rewriting

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

Theoretical Computer Science
Maximal Termination

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Arctic Termination ...Below Zero

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Root-Labeling

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Multi-completion with Termination Tools (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Uncurrying for Termination

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
KBO Orientability

Journal of Automated Reasoning
Loops under Strategies

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Match-bounds revisited

Information and Computation
Increasing interpretations

Annals of Mathematics and Artificial Intelligence
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Termination of string rewriting with matrix interpretations

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Loops under Strategies

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Proving Termination of Integer Term Rewriting

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Well-Definedness of Streams by Termination

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Beyond Dependency Graphs

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Certification of Termination Proofs Using CeTA

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Finding and Certifying Loops

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Satisfiability of non-linear (Ir)rational arithmetic

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
AC completion with termination tools

CADE'11 Proceedings of the 23rd international conference on Automated deduction
CSI: a confluence tool

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Termination of Isabelle functions via termination of rewriting

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Generalized and formalized uncurrying

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Decreasing Diagrams and Relative Termination

Journal of Automated Reasoning
Decreasing diagrams and relative termination

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Termination tools in ordered completion

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Confluence of non-left-linear TRSs via relative termination

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Ordinals and knuth-bendix orders

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proving non-looping non-termination automatically

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Correctness of program transformations as a termination problem

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
KBCV: knuth-bendix completion visualizer

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Formalizing bounded increase

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the second edition of the Tyrolean Termination Tool --a fully automatic termination analyzer for first-order term rewrite systems. The main features of this tool are its (non-)termination proving power, its speed, its flexibility due to a strategy language, and the fact that the source code of the whole project is freely available. The clean design together with a stand-alone OCaml library for term rewriting, make it a perfect starting point for other tools concerned with rewriting as well as experimental implementations of new termination methods.