Certification of automated termination proofs - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2007

Certification of automated termination proofs


Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools which make use of (intricate) decision procedures. But while some proof assistants can check the soundness of a proof, they lack automation. Regarding automated tools, one still has to be satisfied with their answers Yes/No/Do not know, the validity of which can be subject to question, in particular because of the increasing size and complexity of these tools. In the context of rewriting techniques, we aim at bridging the gap between proof assistants that yield formal guarantees of reliability and highly automated tools one has to trust. We present an approach making use of both shallow and deep embeddings. We illustrate this approach with a prototype based on the CiME rewriting toolbox, which can discover involved termination proofs that can be certified by the coq proof assistant, using the Coccinelle library for rewriting.
No file

Dates and versions

hal-01125298 , version 1 (06-03-2015)


  • HAL Id : hal-01125298 , version 1


Evelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain. Certification of automated termination proofs. [Research Report] CEDRIC-07-1185, CEDRIC Lab/CNAM. 2007. ⟨hal-01125298⟩
99 View
0 Download


Gmail Facebook Twitter LinkedIn More