Author:
Giesl Jürgen,Schneider-Kamp Peter,Thiemann René
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)
2. Borralleras, C.: Ordering-based methods for proving termination automatically. PhD thesis, Universitat Politècnica de Catalunya (2003)
3. E. Contejean, C. Marché, B. Monate, and X. Urbain. CiME. http://cime.lri.fr
4. Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. Applicable Algebra in Eng., Comm. and Computing 15(3,4), 149–171 (2004)
5. Giesl, J., Arts, T., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation 34(1), 21–58 (2002)
Cited by
118 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献