PV1 $T_CT$: Tyrolean Complexity Tooldetermines the complexity, including proof, of a given integer transition system or term rewrite system

Application domain/field

Type of tool

Complexity analyser

Expected input

Program/system

Format:

Depends on the instance that is used:

Expected output

If successful, textual representation of the obtained complexity judgement, and corresponding proof tree. If not successful, it will print the uncompleted proof tree and the reason for failure.

Internals

TCT has several instances which provide automated complexity analysis for different kinds of systems:

Comments

License: BSD3
Complexity

Links

Last commit date

18 August 2020

Related papers

Last publication date

9 April 2016

Related tools

AProVE

ProVerB specific

View/edit source (Markdown)



ProVerB is a part of SLEBoK. Last updated: July 2022.