TcT is a tool for automatically proving polynomial upper bounds on the derivational complexity and
runtime complexity of term rewriting systems.
It is developed by members of the Computation with Bounded Resources
TcT features a majority of the known techniques for the automatic characterisation of polynomial
complexity of a TRS, see also the list of supported techniques.
It is currently the only complexity tool implementing dedicated techniques for all
complexity categories of that competition.
The predecessor of TcT is still available from here.
TcT version 2.0.1 released
TcT version 2.0.1 has been released
This minor release comes with updated documentation, minor bugfixes, and a more consistent naming of techniques
TcT version 2.0 released
TcT version 2.0 has been released
. Besides bug-fixes
and a wealth of minor improvements, notably this release adds to version 1.9:
Web Interface Updated
Our web interface
has been polished,
it features new examples, the competition strategy of 2012 and a dedicated strategy for our
Complexity Competition 2012
TcT participated in all four complexity categories of the
complexity competition 2012
TcT won the runtime complexity
It is the only tool participating in the
innermost derivational complexity
and the only open source
tool capable of proving
innermost runtime complexity
TcT could signifficantly increase its power for innermost runtime complexity,
and was placed closely after AProVE
TcT now features an easy to use web interface
Resource aware ML
We have translated the
Resource aware ML
testbed to term rewrite systems. The resulting set of TRSs can
be downloaded from here
TcT version 1.9 released
This version presents the last milestone before version 2.0. Besides various bugfixes, most notably following new features are added:
The main authors are
A new version is under development by
, Andreas Kochesser, Michael Schaper and Maria Schett.