- Interactive mode can now exploit multiple cores
- Simplified configuration. See an example (available also in the source distribution) or the updated documentation
- A GNU/Emacs mode, available from here
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.
News
TcT version 2.0 released
2013/03/19
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
2013/03/01
Our web interface has been polished,
it features new examples, the competition strategy of 2012 and a dedicated strategy for our
RaML collection.
Complexity Competition 2012
2013/02/02
TcT participated in all four complexity categories of the
complexity competition 2012.
TcT won the runtime complexity category.
It is the only tool participating in the
innermost derivational complexity category,
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 (closed source).
Web Interface
2012/05/10
TcT now features an easy to use web interface.
Resource aware ML
2012/05/10
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
2012/01/01
This version presents the last milestone before version 2.0. Besides various bugfixes, most notably following new features are added:
- Improved documentation for using and extending TcT
- A new interactive interface
- A new notion of complexity preserving transformations, including a wealth of combinators, c.f. the documentation. Most of the old processors are implemented as transformations now.
- TcT now features its own xml output-format which can be translated using the provided XSLT stylesheet to CPF.
- added small polynomial path orders, improved dependency graph decomposition and various simplifications techniques for the (weak) dependency pair setting.