Tools on Rewriting

3 tools found.

• AProVE

  last modified: Aug 13, 2020 01:14:00

  

  AProVE is a system for automated termination and innermost termination proofs of term rewrite systems (TRSs). Moreover, AProVE also handles several other formalisms, e.g., logic programs (Prolog), functional programs (Haskell 98), conditional TRSs, TRSs modulo AC, context-sensitive TRSs, etc. The power of AProVE is demonstrated in the annual International Competition of Termination Tools, where AProVE was the most powerful tool for termination of TRSs in 2004, 2005, 2006, 2007, and 2008.

  * AProVE * Web Interface * Download * References * Contributors * Contact ... annual International Competition of Termination Tools and the International Competition on Software ...

  categories termination_tool termination complexity_tool complexity term_rewriting

• TCT

  last modified: May 11, 2019 19:14:05

  

  The Tyrolean Complexity Tool (TCT) is a tool for automatically proving (low) upper bounds on the derivational complexity and runtime complexity of terminating term rewriting systems. Whereas Version 1.0 is strongly based on the automatic termination prover TTT2, Version 2.0 is rewritten from scratch in the purely functional programming language Haskell.

  TcT version 3.3 released 2019/05/10 __________________________________________________________________ ... Compatibility release for recent ghc version (ghc-8.6.5)....

  

  categories complexity_tool complexity term_rewriting LGPL

• CaT

  last modified: Jul 18, 2013 09:14:00

  

  CaT is a powerful analyzer for the complexity of term rewrite systems. It is based on the fast and powerful termination analyzer TTT2. In 2008 and 2009, CaT won all categories in the international termination competition related to complexity in which it participated.

  2010, 2011, 2012, and 2013 in the international termination competition....

  categories complexity_tool complexity term_rewriting