Author:
Thiemann René,Giesl Jürgen,Schneider-Kamp Peter
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge (1998)
3. Dershowitz, N.: Termination of rewriting. J. Symb. Comp. 3, 69–116 (1987)
4. Diekert, V.: Makanin’s algorithm. In: Lothaire, M. (ed.) Combinatorics on Words, pp. 387–442. Cambridge University Press, Cambridge (2002)
5. Endrullis, J.: Jambox, http://joerg.endrullis.de
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Certification of Nontermination Proofs Using Strategies and Nonlooping Derivations;Verified Software: Theories, Tools and Experiments;2014
2. Certification of Nontermination Proofs;Interactive Theorem Proving;2012
3. Loops under Strategies ... Continued;Electronic Proceedings in Theoretical Computer Science;2010-12-24
4. From Outermost Termination to Innermost Termination;Lecture Notes in Computer Science;2009
5. Loops under Strategies;Rewriting Techniques and Applications;2009