Difference between revisions of "Tools:TCT"

From Termination-Portal.org
Jump to navigationJump to search
m (cosmetic changes)
(Deleted information that TCT is based on TTT2 because of the new Haskell implementation of TCT)
 
(2 intermediate revisions by 2 users not shown)
Line 8: Line 8:
 
|shortname=TCT
 
|shortname=TCT
 
|longname=Tyrolean Complexity Tool
 
|longname=Tyrolean Complexity Tool
|homepage=TBA
+
|homepage=http://cl-informatik.uibk.ac.at/software/tct/
 
|country=Austria
 
|country=Austria
 
|university=University of Innsbruck
 
|university=University of Innsbruck
 
|developers=Martin Avanzini, [[People:Georg Moser|Georg Moser]], [[People:Andreas Schnabl|Andreas Schnabl]]
 
|developers=Martin Avanzini, [[People:Georg Moser|Georg Moser]], [[People:Andreas Schnabl|Andreas Schnabl]]
 +
|publication=
 
}}
 
}}
  
 
<!-- If you want to add some additional information to the tool page, you can do so after this comment. -->
 
<!-- If you want to add some additional information to the tool page, you can do so after this comment. -->
 
TCT is a complexity prover based on the termination tool [[Tools:TTT2|TTT2]]. It is specialized in proving
 
polynomial upper bounds on the derivational complexity and runtime complexity of TRSs.
 

Latest revision as of 11:24, 16 April 2010


TCT (Tyrolean Complexity Tool)