Skip to Main content Skip to Navigation

Automated Verification of Termination Certificates

Frédéric Blanqui 1, * Adam Koprowski 2 
* Corresponding author
1 FORMES - Formal Methods for Embedded Systems
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : Termination is an important property required for total correctness of programs/algorithms. In particular it is a well studied subject in the area of term rewriting, where a number of methods and tools for proving termination has been developed over the years. Ensuring reliability of those tools is an important and challenging issue. In this paper we present a methodology and a tool for the automated verification of the results of such automated termination provers. This is accomplished by means of termination certificates, that can be easily generated by termination provers, and then by the transformation of those certificates into full formal proofs in some proof assistant/checker. This last step is done by formalizing the proofs of termination criteria used in modern termination provers. In this paper we describe the formalization of some of these criteria in the proof assistant Coq and the application of those formalizations in the transformation of termination certificates into termination proofs verifiable by Coq.
Document type :
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download
Contributor : Frédéric Blanqui Connect in order to contact the contributor
Submitted on : Wednesday, June 3, 2009 - 8:33:24 AM
Last modification on : Friday, February 4, 2022 - 3:07:51 AM
Long-term archiving on: : Monday, October 15, 2012 - 11:40:36 AM


Files produced by the author(s)


  • HAL Id : inria-00390902, version 1



Frédéric Blanqui, Adam Koprowski. Automated Verification of Termination Certificates. [Research Report] RR-6949, INRIA. 2009, pp.24. ⟨inria-00390902⟩



Record views


Files downloads