Floats & Ropes: a case study for formal numerical program verification

Sylvie Boldo 1, 2
1 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : We present a case study of a formal verification of a numerical program that computes the discretization of a simple partial differential equation. Bounding the rounding error was tricky as the usual idea, that is to bound the absolute value of the error at each step, fails. Our idea is to find out a precise analytical expression that cancels with itself at the next step, and to formally prove the correctness of this approach.
Type de document :
Article dans une revue
Lecture notes in computer science, springer, 2009, 36th International Colloquium on Automata, Languages and Programming, 5556, pp.91--102. 〈10.1007/978-3-642-02930-1_8〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00432718
Contributeur : Sylvie Boldo <>
Soumis le : mardi 17 novembre 2009 - 09:45:42
Dernière modification le : jeudi 5 avril 2018 - 12:30:08

Identifiants

Collections

Citation

Sylvie Boldo. Floats & Ropes: a case study for formal numerical program verification. Lecture notes in computer science, springer, 2009, 36th International Colloquium on Automata, Languages and Programming, 5556, pp.91--102. 〈10.1007/978-3-642-02930-1_8〉. 〈inria-00432718〉

Partager

Métriques

Consultations de la notice

262