| HAL: hal-00128124, version 5 |
| arXiv: cs/0701192 |
| DOI: 10.1145/1353445.1353446 |
| Detailed view | Export this paper |
|
|
| ACM Transactions on Programming Languages and Systems 30, 3 (2008) 12 |
|
|
| Available versions: | v1 (2007-01-30) | v2 (2007-04-20) | v3 (2007-06-30) | v4 (2007-10-25) | v5 (2008-05-22) |
|
|
|
|
| The pitfalls of verifying floating-point computations |
|
|
David Monniaux 1, 2 |
|
|
| (2008-05) |
|
|
| Current critical systems commonly use a lot of floating-point computations, and thus the testing or static analysis of programs containing floating-point operators has become a priority. However, correctly defining the semantics of common implementations of floating-point is tricky, because semantics may change with many factors beyond source-code level, such as choices made by compilers. We here give concrete examples of problems that can appear and solutions to implement in analysis software. |
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique de l'école normale supérieure (LIENS) |
| CNRS : UMR8548 – Ecole normale supérieure de Paris - ENS Paris | |
| 2: | VERIMAG (VERIMAG - IMAG) |
| CNRS : UMR5104 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG) | |
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Programming Languages Computer Science/Numerical Analysis |
|
|
| floating-point – program analysis – rounding error – compilers – C programming language – C99 – program semantics |
|
|
| Attached file list to this document: | ||||||||||
|
|
|
| hal-00128124, version 5 | |
| http://hal.archives-ouvertes.fr/hal-00128124 | |
| oai:hal.archives-ouvertes.fr:hal-00128124 | |
| From: David Monniaux | |
| Submitted on: Thursday, 22 May 2008 11:32:16 | |
| Updated on: Saturday, 11 October 2008 02:06:33 | |