The Tyrolean Complexity Tool
(TCT for short)
is a tool for automatically proving polynomial upper bounds on the derivational complexity and runtime complexity of term rewriting systems.
tool provides a complexity preserving transformation fron Jinja bytecode to cTRSs.
is an abbreviation for Higher-Order Complexity Analysis
, and is meant as a laboratory
for the automated complexity analysis of higher-order functional programs.
The rewriting library for Haskell is jointly developed with other members
from the computational logic
Preliminary sources are currently availabe
package provides a translation from resource aware ML
is a tool
based on TTT2
for automatically investigating the implicit computational complexity of
algorithms through rewriting techniques.