Verifying Floating-Point Algorithms

Jean-Michel Muller, Nicolas Brunie, Florent de Dinechin, Claude-Pierre Jeannerod, Mioara Joldes, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol and Serge Torres
Additional contact information
Jean-Michel Muller: CNRS - LIP
Nicolas Brunie: Kalray
Florent de Dinechin: INSA-Lyon - CITI
Claude-Pierre Jeannerod: Inria - LIP
Mioara Joldes: CNRS - LAAS
Vincent Lefèvre: Inria - LIP
Guillaume Melquiond: Inria - LRI
Nathalie Revol: Inria - LIP
Serge Torres: ENS-Lyon - LIP

Chapter Chapter 13 in Handbook of Floating-Point Arithmetic, 2018, pp 479-511 from Springer

Abstract: Abstract While the previous chapters have made clear that it is common practice to verify floating-point algorithms with pen-and-paper proofs, this practice can lead to subtle bugs. Indeed, floating-point arithmetic introduces numerous special cases, and examining all the details would be tedious. As a consequence, the verification process tends to focus on the main parts of the correctness proof, so that it does not grow out of reach.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-76526-6_13

Ordering information: This item can be ordered from
http://www.springer.com/9783319765266

DOI: 10.1007/978-3-319-76526-6_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().