Author:
Ramos Thiago Mendonça Ferreira,Muñoz César,Ayala-Rincón Mauricio,Moscato Mariano,Dutle Aaron,Narkawicz Anthony
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Lecture Notes in Computer Science;T Arts,1996
2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1–2), 133–178 (2000)
3. Avelar, A.B.: Formalização da automação da terminação através de grafos com matrizes de medida. Ph.D. thesis, Universidade de Brasília, Departamento de Matemática, Brasília, Distrito Federal, Brasil (2015). In Portuguese
4. Lecture Notes in Computer Science;Y Forster,2017
5. Lecture Notes in Computer Science;A Krauss,2011
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Formal Verification of Termination Criteria for First-Order Recursive Functions;Journal of Automated Reasoning;2023-11-29
2. Formalization of the Computational Theory of a Turing Complete Functional Language Model;Journal of Automated Reasoning;2022-01-30
3. Formalizing the dependency pair criterion for innermost termination;Science of Computer Programming;2020-09
4. Undecidability of higher-order unification formalised in Coq;Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs;2020-01-20
5. Verified programming of Turing machines in Coq;Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs;2020-01-20