Interval Semantics for Standard Floating-Point Arithmetic
W.W. Edmonson, M.H. van Emden

TL;DR
This paper introduces an interval-based interpretation of floating-point arithmetic that makes all operations well-defined, including traditionally undefined cases, facilitating verification and potential hardware implementation.
Contribution
It proposes a novel interval semantics for floating-point numbers, redefining undefined operations to improve numerical reliability and verification.
Findings
All floating-point operations, including undefined ones, are given well-defined interval semantics.
Interval interpretation enables verification of numerical algorithms.
Implications for hardware implementation of floating-point arithmetic are discussed.
Abstract
If the non-zero finite floating-point numbers are interpreted as point intervals, then the effect of rounding can be interpreted as computing one of the bounds of the result according to interval arithmetic. We give an interval interpretation for the signed zeros and infinities, so that the undefined operations 0*inf, inf - inf, inf/inf, and 0/0 become defined. In this way no operation remains that gives rise to an error condition. Mathematically questionable features of the floating-point standard become well-defined sets of reals. Interval semantics provides a basis for the verification of numerical algorithms. We derive the results of the newly defined operations and consider the implications for hardware implementation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Digital Filter Design and Implementation · Formal Methods in Verification
