48 search results - page 3 / 10 » Automatic Termination Proofs in the Dependency Pair Framewor... |
JAR
2006
13 years 7 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
CSL
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
IANDC
2007
13 years 7 months ago
2007
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 dependen...
RTA
2004
Springer
14 years 22 days ago
2004
Springer
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
LOPSTR
2009
Springer
14 years 1 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...