Martin Korp, Aart Middeldorp. Proving Termination of Rewrite Systems Using Bounds. In Franz Baader, editor, Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings. Volume 4533 of Lecture Notes in Computer Science, pages 273-287, Springer, 2007. [doi]
@inproceedings{KorpM07,
title = {Proving Termination of Rewrite Systems Using Bounds},
author = {Martin Korp and Aart Middeldorp},
year = {2007},
doi = {10.1007/978-3-540-73449-9_21},
url = {http://dx.doi.org/10.1007/978-3-540-73449-9_21},
tags = {termination, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KorpM07},
cites = {0},
citedby = {0},
pages = {273-287},
booktitle = {Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings},
editor = {Franz Baader},
volume = {4533},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-73447-5},
}