CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Structures in Computer Science Year : 2011

CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates

Frédéric Blanqui
Adam Koprowski
  • Function : Author
  • PersonId : 860851

Abstract

Termination is an important property of programs; notably required for programs formulated in proof assistants. It is a very active subject of research in the Turing-complete formalism of term rewriting systems, where many methods and tools have been developed over the years to address this problem. Ensuring reliability of those tools is therefore an important issue. In this paper we present a library formalizing 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.
Fichier principal
Vignette du fichier
main.pdf (343.45 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00543157 , version 1 (29-02-2012)

Identifiers

Cite

Frédéric Blanqui, Adam Koprowski. CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates. Mathematical Structures in Computer Science, 2011, 21 (4), pp.827-859. ⟨10.1017/S0960129511000120⟩. ⟨inria-00543157⟩
209 View
196 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More