Formal verification of tricky numerical computations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Formal verification of tricky numerical computations

Abstract

Computer arithmetic has applied formal methods and formal proofs for years. As the systems may be critical and as the properties may be complex to prove (many sub-cases, error-prone computations), a formal guarantee of correctness is a wish that can now be fulfilled. This talk will present a chain of tools to formally verify numerical programs. The idea is to precisely specify what the program requires and ensures. Then, using deductive verification, the tools produce proof obligation that may be proved either automatically or interac-tively in order to guarantee the correctness of the specifications. Many examples of programs from the literature will be specified and formally verified.
Fichier principal
Vignette du fichier
article.pdf (43.78 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01088692 , version 1 (28-11-2014)

Identifiers

  • HAL Id : hal-01088692 , version 1

Cite

Sylvie Boldo. Formal verification of tricky numerical computations. 16th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Sep 2014, Würzburg, Germany. pp.39. ⟨hal-01088692⟩
133 View
81 Download

Share

Gmail Mastodon Facebook X LinkedIn More