Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. T. Arts. Automatically proving termination and innermost normalisation of term rewriting systems. PhD thesis, Universiteit Utrecht, 1997.
2. T. Arts and J. Giesl. Modularity of termination using dependency pairs. In Nipkow[13], pages 226–240.
3. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Comput. Sci., 236:133–178, 2000.
4. E. Contejean, C. Marché, B. Monate, and X. Urbain. Cime version 2, 2000. Pre-release available at
http://www.lri.fr/~demons/cime.html
.
5. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1):69–115, Feb. 1987.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Certification Problem Format;Electronic Proceedings in Theoretical Computer Science;2014-10-29
2. Elimination Transformations for Associative–Commutative Rewriting Systems;Journal of Automated Reasoning;2006-12-02
3. Automated Termination Proofs with AProVE;Rewriting Techniques and Applications;2004
4. Improved Modular Termination Proofs Using Dependency Pairs;Automated Reasoning;2004
5. Improving Dependency Pairs;Logic for Programming, Artificial Intelligence, and Reasoning;2003