cl-banner

Dependency Pairs Revisited

Nao Hirokawa and Aart Middeldorp

Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA 2004), Lecture Notes in Computer Science 3091, pp. 249 – 268, 2004.

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.

 

  PDF |    doi:10.1007/978-3-540-25979-4_18  |  © Springer

BibTeX 

@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,
publisher = "Springer-Verlag",
pages = "249--268",
year = 2004
}
Nach oben scrollen