48 search results - page 1 / 10 » Automatic Termination Proofs in the Dependency Pair Framewor... |
CADE
2006
Springer
14 years 5 months ago
2006
Springer
LPAR
2004
Springer
13 years 10 months ago
2004
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 possible ...
CORR
2011
Springer
13 years 3 days ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
ENTCS
2007
13 years 5 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
RTA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. 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 ver...