Author:
BLANQUI FRÉDÉRIC,KOPROWSKI ADAM
Abstract
Termination is an important property of programs, and is notably required for programs formulated in proof assistants. It is a very active subject of research in the Turing-complete formalism of term rewriting. Over the years, many methods and tools have been developed to address the problem of deciding termination for specific problems (since it is undecidable in general). Ensuring the reliability of those tools is therefore an important issue.In this paper we present a library formalising important results of the theory of well-founded (rewrite) relations in the proof assistant Coq. We also present its application to the automated verification of termination certificates, as produced by termination tools.The sources are freely available athttp://color.inria.fr/.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference94 articles.
1. Termination of Term Rewriting by Semantic Labelling.;Zantema;Fundamenta Informaticae,1995
2. Waldmann J. (2008) Report on the Termination Competition. Proceedings of WST'09. (Available at http://www.imn.htwk-leipzig.de/~waldmann/talk/09/wst/paper.pdf.)
3. Certification of Termination Proofs Using CeTA
4. Coq Modulo Theory
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献