AProVE

AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework. AProVE 1.2 is one of the most powerful systems for automated termination proofs of term rewrite systems (TRSs). It is the first tool which automates the new dependency pair framework [8] and therefore permits a completely flexible combination of different termination proof techniques. Due to this framework, AProVE 1.2 is also the first termination prover which can be fully configured by the user.


References in zbMATH (referenced in 148 articles , 1 standard article )

Showing results 121 to 140 of 148.
Sorted by year (citations)

previous 1 2 3 ... 5 6 7 8 next

  1. Giesl, Jürgen; Swiderski, Stephan; Schneider-Kamp, Peter; Thiemann, René: Automated termination analysis for Haskell: from term rewriting to programming languages (2006)
  2. Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter; Falke, Stephan: Mechanizing and improving dependency pairs (2006)
  3. Keiichirou, Kusakari; Masaki, Nakamura; Yoshihito, Toyama: Elimination transformations for associative-commutative rewriting systems (2006)
  4. Koprowski, Adam; Zantema, Hans: Automation of recursive path ordering for infinite labelled rewrite systems (2006)
  5. Lucas, Salvador: On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (2006)
  6. Lucas, Salvador: Proving termination of context-sensitive rewriting by transformation (2006)
  7. Manolios, Panagiotis; Vroon, Daron: Termination analysis with calling context graphs (2006)
  8. Moser, Georg: Derivational complexity of Knuth-Bendix orders revisited (2006)
  9. Obua, Steven: Checking conservativity of overloaded definitions in higher-order logic (2006)
  10. Stump, Aaron; Löchner, Bernd: Knuth-Bendix completion of theories of commuting group endomorphisms (2006)
  11. Wehrman, Ian; Stump, Aaron; Westbrook, Edwin: Slothrop: Knuth-Bendix completion with a modern termination checker (2006)
  12. Aoto, Takahito; Yamada, Toshiyuki: Dependency pairs for simply typed term rewriting (2005)
  13. Boy de la Tour, Thierry; Echenim, Mnacho: Unification in a class of permutative theories (2005)
  14. Contejean, Evelyne; Marché, Claude; Tomás, Ana Paula; Urbain, Xavier: Mechanically proving termination using polynomial interpretations (2005)
  15. Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans: Finding finite automata that certify termination of string rewriting (2005)
  16. Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans: On tree automata that certify termination of left-linear term rewriting systems (2005)
  17. Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter: The dependency pair framework: Combining techniques for automated termination proofs (2005)
  18. Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter: Proving and disproving termination of higher-order functions (2005)
  19. Godoy, Guillem; Tiwari, Ashish: Termination of rewrite systems with shallow right-linear, collapsing, and right-ground rules (2005)
  20. Hendrix, Joe; Clavel, Manuel; Meseguer, José: A sufficient completeness reasoning tool for partial specifications (2005)

previous 1 2 3 ... 5 6 7 8 next


Further publications can be found at: http://aprove.informatik.rwth-aachen.de/index.asp?subform=references.html