Tyrolean Complexity Tool: Features and Usage

The Tyrolean Complexity Tool, TCT for short, is an open source complexity analyser for term rewrite systems. Our tool TCT features a majority of the known techniques for the automated characterisation of polynomial complexity of rewrite systems and can investigate derivational and runtime complexity, for full and innermost rewriting. This system description outlines features and provides a short introduction to the usage of TCT.

[1]  Johannes Waldmann,et al.  Polynomially Bounded Matrix Interpretations , 2010, RTA.

[2]  Johannes Waldmann,et al.  Max/Plus Tree Automata for Termination of Term Rewriting , 2009, Acta Cybern..

[3]  Georg Moser,et al.  Proving Quadratic Derivational Complexities Using Context Dependent Interpretations , 2008, RTA.

[4]  Jürgen Giesl,et al.  Mechanizing and Improving Dependency Pairs , 2006, Journal of Automated Reasoning.

[5]  Ugo Dal Lago,et al.  Derivational Complexity Is an Invariant Cost Model , 2009, FOPARA.

[6]  Hans Zantema,et al.  Matrix Interpretations for Proving Termination of Term Rewriting , 2006, Journal of Automated Reasoning.

[7]  Harald Zankl,et al.  Modular Complexity Analysis via Relative Complexity , 2010, RTA.

[8]  Georg Moser,et al.  Complexity Analysis by Rewriting , 2008, FLOPS.

[9]  Guillaume Bonfante,et al.  Algorithms with polynomial interpretation termination proof , 2001, Journal of Functional Programming.

[10]  Georg Moser,et al.  A new order-theoretic characterisation of the polytime computable functions☆ , 2012, APLAS.

[11]  Georg Moser,et al.  Automated Complexity Analysis Based on the Dependency Pair Method , 2008, IJCAR.

[12]  Georg Moser,et al.  Proof Theory at Work: Complexity Analysis of Term Rewrite Systems , 2009, ArXiv.

[13]  Georg Moser,et al.  Polynomial Path Orders: A Maximal Model , 2012, ArXiv.

[14]  Hans Zantema,et al.  On tree automata that certify termination of left-linear term rewriting systems , 2005, Inf. Comput..

[15]  Dieter Hofbauer,et al.  Termination Proofs and the Length of Derivations (Preliminary Version) , 1989, RTA.

[16]  Jürgen Giesl,et al.  A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems , 2011, CADE.

[17]  Georg Moser,et al.  Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems , 2011, CAI.

[18]  Georg Moser,et al.  Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations , 2008, FSTTCS.

[19]  Georg Moser,et al.  Closing the Gap Between Runtime Complexity and Polytime Computability , 2010, RTA.