Multi-prover verification of floating-point programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Multi-prover verification of floating-point programs


In the context of deductive program verification, supporting floatingpoint computations is tricky.We propose an expressive language to formally specify behavioral properties of such programs. We give a first-order axiomatization of floating-point operations which allows to reduce verification to checking the validity of logic formulas, in a suitable form for a large class of provers including SMT solvers and interactive proof assistants. Experiments using the Frama-C platform for static analysis of C code are presented.
Fichier principal
Vignette du fichier
main.pdf (148.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00534333 , version 1 (10-11-2010)


  • HAL Id : inria-00534333 , version 1


Ali Ayad, Claude Marché. Multi-prover verification of floating-point programs. Fifth International Joint Conference on Automated Reasoning, Jul 2010, Edinburgh, United Kingdom. ⟨inria-00534333⟩
321 View
294 Download


Gmail Facebook Twitter LinkedIn More