Combining Coq and Gappa for Certifying Floating-Point Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Combining Coq and Gappa for Certifying Floating-Point Programs


Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floating-point arithmetic, such as Gappa, but they target very restrictive logics. On the other hand, there are interactive theorem provers based on the LCF approach, such as Coq, that handle a general-purpose logic but that lack proof automation for floating-point properties. To alleviate these issues, we have implemented a mechanism for calling Gappa from a Coq interactive proof. This paper presents this combination and shows on several examples how this approach offers a significant speedup in the process of verifying floating-point programs.
Fichier principal
Vignette du fichier
09-calculemus-article.pdf (215.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00432726 , version 1 (11-12-2014)



Sylvie Boldo, Jean-Christophe Filliâtre, Guillaume Melquiond. Combining Coq and Gappa for Certifying Floating-Point Programs. 16th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning, Jul 2009, Grand Bend, Ontario, Canada. pp.59-74, ⟨10.1007/978-3-642-02614-0_10⟩. ⟨inria-00432726⟩
303 View
240 Download



Gmail Facebook Twitter LinkedIn More