Automated verification of termination certificates - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Automated verification of termination certificates


In order to increase user confidence, many automated theorem provers provide certificates that can be independently verified. In this paper, we report on our progress in developing a standalone tool for checking the correctness of certificates for the termination of term rewrite systems, and formally proving its correctness in the proof assistant Coq. To this end, we use the extraction mechanism of Coq and the library on rewriting theory and termination called CoLoR.
Fichier principal
Vignette du fichier
main.pdf (151.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00763495 , version 1 (11-12-2012)



Frédéric Blanqui, Kim Quyen Ly. Automated verification of termination certificates. 15th National Symposium of Selected ICT Problems, Dec 2012, Hanoi, Vietnam. ⟨hal-00763495⟩
352 View
75 Download



Gmail Facebook X LinkedIn More