Automatic Verification of Floating-Point Accumulation Networks
Open Access
- 23 July 2025
- book chapter
- Published by Springer Nature
- p. 215-237
Abstract
Floating-point accumulation networks (FPANs) are key building blocks used in many floating-point algorithms, including compensated summation and double-double arithmetic. FPANs are notoriously difficult to analyze, and algorithms using FPANs are often published without rigorous correctness proofs. In fact, on at least one occasion, a published error bound for a widely used FPAN was later found to be incorrect. In this paper, we present an automatic procedure that produces computer-verified proofs of several FPAN correctness properties, including error bounds that are tight to the nearest bit. Our approach is underpinned by a novel floating-point abstraction that models the sign, exponent, and number of leading and trailing zeros and ones in the mantissa of each number flowing through an FPAN. We also present a new FPAN for double-double addition that is faster and more accurate than the previous best known algorithm.Keywords
All Related Versions
This publication has 45 references indexed in Scilit:
- Scalable Bit-Blasting with Abstractions2024
- Bitwuzla2023
- cvc5: A Versatile and Industrial-Strength SMT Solver2022
- Handbook of Floating-Point Arithmetic2018
- Formal Verification of a Floating-Point Expansion Renormalization Algorithm2017
- CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications2016
- Interval Slopes as a Numerical Abstract Domain for Floating-Point Variables2010
- A Sound Floating-Point Polyhedra Abstract Domain2008
- Z3: An Efficient SMT Solver2008
- Rundungsfehleranalyse einiger Verfahren zur Summation endlicher SummenZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1974