TORPA

TORPA: Termination of rewriting proved automatically. The tool TORPA (Termination of Rewriting Proved Automatically) can be used to prove termination of string rewriting systems (SRSs) fully automatically. The underlying techniques include semantic labelling, polynomial interpretations, recursive path order, the dependency pair method and match bounds of right hand sides of forward closures.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 10 articles )

Showing results 1 to 10 of 10.
Sorted by year (citations)

  1. Durand, Irène; Sylvestre, Marc: Left-linear bounded TRSs are inverse recognizability preserving (2011)
  2. Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans: On tree automata that certify termination of left-linear term rewriting systems (2007)
  3. Espada, Miguel Valero; van de Pol, Jaco: Accelerated modal abstractions of labelled transition systems (2006)
  4. Hofbauer, Dieter; Waldmann, Johannes: Termination of string rewriting with matrix interpretations (2006)
  5. Koprowski, Adam; Zantema, Hans: Automation of recursive path ordering for infinite labelled rewrite systems (2006)
  6. Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans: Finding finite automata that certify termination of string rewriting (2005)
  7. Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans: On tree automata that certify termination of left-linear term rewriting systems (2005)
  8. Zantema, H.: Termination of string rewriting proved automatically (2005)
  9. Thiemann, René; Giesl, Jürgen; Schneider-Kamp, Peter: Improved modular termination proofs using dependency pairs (2004)
  10. Zantema, Hans: TORPA: Termination of rewriting proved automatically (2004) ioport