DI Martin Korp  

Description

The Tyrolean Termination Tool 2 (TTT2) is a tool for automatically proving termination of rewrite systems. It is the completely redesigned successor of TTT. Current termination techniques include dependency pairs tranformation, approximated dependency graph, argument filtering, match-bounds, knuth-bendix order, lexicographic path order, matrix interpretation, polynomial interpretation, simple projection and subterm criterion, uncurrying and usable rules. A previous version of TTT2 took part at the international Termination Competition 2007 and 2008.

In the following we concentrate on the part of TTT2 which implements the match-bound technique. For more general information, please check the official web site of TTT2.

Implementation

TTT2 is written in OCaml an consists of about 30000 lines of code. About 15% is used to implement the match-bound technique.

Downloads

To download the latest version of TTT2, visit the official web site of TTT2.

Experiments

To get more detailed information on the experiments done with TTT2, choose the appropriate paper from the publication list and click on Experiments.

Contact

The main authors of TTT2 are Martin Korp, Christian Sternagel, Harald Zankl, and Aart Middeldorp. For any question related to TTT2 do not hesitate to contact us via the e-mail address ttt2__AT__informatik.uibk.ac.at.