Searching Critical Values for Floating-Point Programs

Abstract : Programs with floating-point computations are often derived from mathematical models or designed with the semantics of the real numbers in mind. However, for a given input, the computed path with floating-point numbers may significantly differ from the path corresponding to the same computation with real numbers. As a consequence, developers do not know whether the program can actually produce very unexpected outputs. We introduce here a new constraint-based approach that searches for test cases in the part of the over-approximation where errors due to floating-point arithmetic could lead to unexpected decisions.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01643710
Contributor : Hal Ifip <>
Submitted on : Tuesday, November 21, 2017 - 3:52:44 PM
Last modification on : Monday, November 5, 2018 - 4:32:35 PM

File

419911_1_En_13_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Hélène Collavizza, Claude Michel, Michel Rueher. Searching Critical Values for Floating-Point Programs. 28th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2016, Graz, Austria. pp.209-217, ⟨10.1007/978-3-319-47443-4_13⟩. ⟨hal-01643710⟩

Share

Metrics

Record views

118

Files downloads

74