The pitfalls of verifying floating-point computations

Abstract : 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.
Document type :
Journal articles
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2008, 30 (3), pp.12. <10.1145/1353445.1353446>


https://hal.archives-ouvertes.fr/hal-00128124
Contributor : David Monniaux <>
Submitted on : Thursday, May 22, 2008 - 11:32:16 AM
Last modification on : Saturday, October 11, 2008 - 2:06:33 AM
Document(s) archivé(s) le : Friday, September 24, 2010 - 12:13:28 PM

Files

floating-point-article.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

David Monniaux. The pitfalls of verifying floating-point computations. ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2008, 30 (3), pp.12. <10.1145/1353445.1353446>. <hal-00128124v5>

Export

Share

Metrics

Record views

7213

Document downloads

5348