AProVE 1.2: Automatic termination proofs in the dependency pair framework
J Giesl, P Schneider-Kamp, R Thiemann - International Joint Conference …, 2006 - Springer
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 …
rewrite systems (TRSs). It is the first tool which automates the new dependency pair …
Mechanizing and improving dependency pairs
J Giesl, R Thiemann, P Schneider-Kamp… - Journal of Automated …, 2006 - Springer
The dependency pair technique is a powerful method for automated termination and
innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates …
innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates …
Automated termination proofs with AProVE
J Giesl, R Thiemann, P Schneider-Kamp… - … Conference on Rewriting …, 2004 - Springer
We describe the system ProVE, an automated prover to verify (innermost) termination of term
rewrite systems (TRSs). For this system, we have developed and implemented efficient …
rewrite systems (TRSs). For this system, we have developed and implemented efficient …
The dependency pair framework: Combining techniques for automated termination proofs
J Giesl, R Thiemann, P Schneider-Kamp - International Conference on …, 2005 - Springer
The dependency pair approach is one of the most powerful techniques for automated
termination proofs of term rewrite systems. Up to now, it was regarded as one of several …
termination proofs of term rewrite systems. Up to now, it was regarded as one of several …
Proving and disproving termination of higher-order functions
J Giesl, R Thiemann, P Schneider-Kamp - International Workshop on …, 2005 - Springer
The dependency pair technique is a powerful modular method for automated termination
proofs of term rewrite systems (TRSs). We present two important extensions of this …
proofs of term rewrite systems (TRSs). We present two important extensions of this …
Tyrolean termination tool: Techniques and features
N Hirokawa, A Middeldorp - Information and Computation, 2007 - Elsevier
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving
termination of rewrite systems. It incorporates several new refinements of the dependency …
termination of rewrite systems. It incorporates several new refinements of the dependency …
Automating the dependency pair method
N Hirokawa, A Middeldorp - Information and computation, 2005 - Elsevier
Developing automatable methods for proving termination of term rewrite systems that resist
traditional techniques based on simplification orders has become an active research area in …
traditional techniques based on simplification orders has become an active research area in …
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates
F Blanqui, A Koprowski - Mathematical Structures in Computer …, 2011 - cambridge.org
Termination is an important property of programs, and is notably required for programs
formulated in proof assistants. It is a very active subject of research in the Turing-complete …
formulated in proof assistants. It is a very active subject of research in the Turing-complete …
Dependency pairs revisited
N Hirokawa, A Middeldorp - … , RTA 2004, Aachen, Germany, June 3-5 …, 2004 - Springer
In this paper we present some new refinements of the dependency pair method for
automatically proving the termination of term rewrite systems. These refinements are very …
automatically proving the termination of term rewrite systems. These refinements are very …
[PDF][PDF] The DP framework for proving termination of term rewriting
R Thiemann - 2007 - informatik.rwth-aachen.de
Termination is the fundamental property of a program that for each input, the evaluation will
eventually stop and return some output. Although the question whether a given program …
eventually stop and return some output. Although the question whether a given program …