Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. The termination competition, http://www.lri.fr/~marche/termination-competition
2. Lecture Notes in Computer Science;T. Aoto,2003
3. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1–2), 133–178 (2000)
4. Cherifa, A.B., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Sci. Comput. Program 9(2), 137–159 (1987)
5. Contejean, E., Marché, C., Monate, B., Urbain, X.: Proving termination of rewriting with c i me, pp. 71–73 (2003), http://cime.lri.fr
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献