Author:
Krauss Alexander,Sternagel Christian,Thiemann René,Fuhs Carsten,Giesl Jürgen
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1999)
2. Lecture Notes in Computer Science;G. Barthe,2006
3. Blanqui, F., Koprowski, A.: CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates. Math. Struct. Comp. Science (2011) (to appear)
4. Boyer, R.S., Moore, J S.: A Computational Logic. Academic Press, London (1979)
5. Lecture Notes in Computer Science;L. Bulwahn,2007
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. (Nearest) Neighbors You Can Rely On: Formally Verified k-d Tree Construction and Search in Coq;Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing;2024-04-08
2. Formal Verification of Termination Criteria for First-Order Recursive Functions;Journal of Automated Reasoning;2023-11-29
3. Generic Encodings and Static Analysis of Constructor Rewriting Systems;2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2023-09-11
4. Generic Encodings of Constructor Rewriting Systems;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07
5. Formalization of the Undecidability of the Halting Problem for a Functional Language;Logic, Language, Information, and Computation;2018