Assisted verification of elementary functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2005

Assisted verification of elementary functions

Florent de Dinechin
Christoph Lauter
Guillaume Melquiond


The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall error of the implementation with respect to the mathematical function. Such work is function specific, concerns tens of lines of code for each function, and will usually be broken by the smallest change to the code (e.g. for maintenance or optimization purpose). Therefore, it is very tedious and error-prone if done by hand. This article discusses the use of the Gappa proof assistant in this context. Gappa has two main advantages over previous approaches: Its input format is very close to the actual C code to validate, and it automates error evaluation and propagation using interval arithmetic. Besides, it can be used to incrementally prove complex mathematical properties pertaining to the C code. Yet it does not require any specific knowledge about automatic theorem proving, and thus is accessible to a wider community. Moreover, Gappa may generate a formal proof of the results that can be checked independently by a lower-level proof assistant like Coq, hence providing an even higher confidence in the certification of the numerical code.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5683.pdf (234.18 Ko) Télécharger le fichier

Dates and versions

inria-00070330 , version 1 (19-05-2006)


  • HAL Id : inria-00070330 , version 1


Florent de Dinechin, Christoph Lauter, Guillaume Melquiond. Assisted verification of elementary functions. RR-5683, INRIA. 2005, pp.17. ⟨inria-00070330⟩
97 View
123 Download


Gmail Mastodon Facebook X LinkedIn More