Author:
Nagele Julian,Thiemann René,Winkler Sarah
Publisher
Springer International Publishing
Reference24 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoret. Comput. Sci. 236, 133–178 (2000)
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
3. Blanqui, F., Koprowski, A.: $${\sf CoLoR}$$ : a $${\sf Coq}$$ library on well-founded rewrite relations and its application to the automated verification of termination certificates. Math. Struct. Comput. Sci. 4, 827–859 (2011)
4. Contejean, E., Courtieu, P., Forest, J., Pons, O., Urbain, X.: Automated certified proofs with $${\sf CiME3}$$ . In: Proceedings of the RTA ’11. LIPIcs, vol. 10, pp. 21–30 (2011)
5. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);F Emmes,2012
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Context-sensitive Rewriting;ACM Computing Surveys;2021-07-31