Abstract

In this paper we present TcT v3.0, the latest version of our fully automated complexity analyser. TcT implements our framework for automated complexity analysis and focuses on extensibility and automation. TcT is open with respect to the input problem under investigation and the resource metric in question. It is the most powerful tool in the realm of automated complexity analysis of term rewrite systems. Moreover it provides an expressive problem-independent strategy language that facilitates proof search. We give insights about design choices, the implementation of the framework and report different case studies where we have applied TcT successfully.

BibTeX

@inproceedings{AMS:2016,
  author    = {Martin Avanzini and Georg Moser and Michael Schaper},
  title     = "{TcT}: {T}yrolean {C}omplexity {T}ool",
  booktitle = "Proceedings of the 22nd International Conference on Tools and
               Algorithms for the Construction and Analysis of Systems
               (TACAS 2016)",
  series    = "Lecture Notes in Computer Science",
  volume    = 9636,
  pages     = 407--423,
  year      = 2016
}