Abstract
While the previous chapters have made clear that it is common practice to certify 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 certification process tends to focus on the main parts of the correctness proof, so that it does not grow out of reach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Birkhäuser Boston
About this chapter
Cite this chapter
Muller, JM. et al. (2010). Formalisms for Certifying Floating-Point Algorithms. In: Handbook of Floating-Point Arithmetic. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4705-6_13
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4705-6_13
Published:
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4704-9
Online ISBN: 978-0-8176-4705-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)