Sciweavers

RTA
2004
Springer

Dependency Pairs Revisited

14 years 3 months ago
Dependency Pairs Revisited
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 very easy to implement, increase the power of the method, result in simpler termination proofs, and make the method more efficient.
Nao Hirokawa, Aart Middeldorp
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where RTA
Authors Nao Hirokawa, Aart Middeldorp
Comments (0)