Proofs of numerical programs when the compiler optimizes - Archive ouverte HAL Access content directly
Journal Articles Innovations in Systems and Software Engineering Year : 2011

Proofs of numerical programs when the compiler optimizes

(1, 2) , (1, 2)
1
2

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.
Fichier principal
Vignette du fichier
ISSE.pdf (584.47 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00777639 , version 1 (21-02-2013)

Identifiers

  • HAL Id : hal-00777639 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More