Multi-prover verification of floating-point programs

Ali Ayad 1, 2 Claude Marché 3
3 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/inria-00534333
Contributor : Claude Marché <>
Submitted on : Wednesday, November 10, 2010 - 2:00:59 PM
Last modification on : Thursday, February 7, 2019 - 3:03:56 PM
Long-term archiving on : Friday, October 26, 2012 - 3:21:07 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00534333, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

611

Files downloads

384