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.
CITATION STYLE
Muller, J.-M., Brisebarre, N., de Dinechin, F., Jeannerod, C.-P., Lefèvre, V., Melquiond, G., … Torres, S. (2010). Formalisms for Certifying Floating-Point Algorithms. In Handbook of Floating-Point Arithmetic (pp. 463–491). Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4705-6_13
Mendeley helps you to discover research relevant for your work.