Formal verification of numerical programs: from C annotated programs to mechanical proofs - Archive ouverte HAL Access content directly
Journal Articles Mathematics in Computer Science Year : 2011

Formal verification of numerical programs: from C annotated programs to mechanical proofs

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

Abstract

Numerical programs may require a high level of guarantee. This can be achieved by applying formal methods, such as machine-checked proofs. But these tools handle mathematical theorems while we are interested in C code, in which numerical computations are performed using floating-point arithmetic, whereas proof tools typically handle exact real arithmetic. To achieve this high level of confidence on C programs, we use a chain of tools: Frama-C, its Jessie plugin, Why and provers among Coq, Gappa, Alt-Ergo, CVC3 and Z3. This approach requires the C program to be annotated: each function must be precisely specified, and we prove the correctness of the program by proving both that it meets its specifications and that no runtime error may occur. The purpose of this paper is to illustrate, on various examples, the features of this approach.
Fichier principal
Vignette du fichier
boldo11mcs.pdf (475.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00777605 , version 1 (17-01-2013)

Identifiers

  • HAL Id : hal-00777605 , version 1

Cite

Sylvie Boldo, Claude Marché. Formal verification of numerical programs: from C annotated programs to mechanical proofs. Mathematics in Computer Science, 2011, 5, pp.377-393. ⟨hal-00777605⟩
450 View
772 Download

Share

Gmail Facebook Twitter LinkedIn More