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.

BibTeX Entry

@inproceedings{HM-RTA04,
 author    = "Nao Hirokawa and Aart Middeldorp",
 title     = "Dependency Pairs Revisited",
 booktitle = "Proceedings of the 15th International Conference on
              Rewriting Techniques and Applications",
 series    = "Lecture Notes in Computer Science",
 volume    = 3091,
 pages     = "249--268",
 year      = 2004,
 doi       = "10.1007/978-3-540-32033-3\_14"
}