Sciweavers

Share
CADE
2003
Springer

Automating the Dependency Pair Method

9 years 8 months ago
Automating the Dependency Pair Method
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 the past few years. The dependency pair method of Arts and Giesl is one of the most popular such methods. However, there are several obstacles that hamper its automation. In this paper we present new ideas to overcome these obstacles. We provide ample numerical data supporting our ideas.
Nao Hirokawa, Aart Middeldorp
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2003
Where CADE
Authors Nao Hirokawa, Aart Middeldorp
Comments (0)
books