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.

• Type: Conference
• Year: 2004
• Where: RTA
• Authors: Nao Hirokawa, Aart Middeldorp
• Keywords: Dependency Pair Method, RTA 2004, Simpler Termination Proofs, Term Rewrite Systems, Theoretical Computer Science