Proofs of numerical programs when the compiler optimizes

Sylvie Boldo 1, 2 Thi Minh Tuyen Nguyen 1, 2
2 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : On certain recently developed architectures, a numerical program may give different answers depending on the execution hardware and the compilation. Our goal is to formally prove properties about numerical programs that are true for multiple architectures and compilers.We propose an approach that states the rounding error of each floatingpoint computation whatever the environment and the compiler choices. This approach is implemented in the Frama-C platform for static analysis of C code. Small case studies using this approach are entirely and automatically proved.
Document type :
Journal articles
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-00777639
Contributor : Claude Marché <>
Submitted on : Thursday, February 21, 2013 - 7:08:56 AM
Last modification on : Thursday, April 5, 2018 - 12:30:08 PM
Long-term archiving on : Saturday, April 1, 2017 - 6:52:22 AM

File

ISSE.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00777639, version 1

Collections

Citation

Sylvie Boldo, Thi Minh Tuyen Nguyen. Proofs of numerical programs when the compiler optimizes. Innovations in Systems and Software Engineering, Springer Verlag, 2011, 7, pp.151-160. ⟨hal-00777639⟩

Share

Metrics

Record views

339

Files downloads

689