CoLoR: a Coq library on well-founded rewrite relations and its   application to the automated verification of termination certificates
  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. 
Fr\'ed\'eric Blanqui (LIAMA), Adam Koprowski
cs.LO