Optimal Inverse Projection of Floating-Point Addition - Archive ouverte HAL Access content directly
Journal Articles Numerical Algorithms Year : 2020

## Optimal Inverse Projection of Floating-Point Addition

(1) , (1) , (2)
1
2
Diane Gallois-Wong
Sylvie Boldo
Pascal Cuoq
• Function : Author
• PersonId : 1005708

#### Abstract

In a setting where we have intervals for the values of floating-point variables x, a, and b, we are interested in improving these intervals when the floating-point equality $x ⊕ a =$b holds. This problem is common in constraint propagation, and called the inverse projection of the addition. It also appears in abstract interpretation for the analysis of programs containing IEEE 754 operations. We propose floating-point theorems that provide optimal bounds for all the intervals. Fast loop-free algorithms compute these optimal bounds using only floating-point computations at the target precision.

### Dates and versions

hal-01939097 , version 1 (29-11-2018)

### Identifiers

• HAL Id : hal-01939097 , version 1
• DOI :

### Cite

Diane Gallois-Wong, Sylvie Boldo, Pascal Cuoq. Optimal Inverse Projection of Floating-Point Addition. Numerical Algorithms, In press, 83 (3), pp.957--986. ⟨10.1007/s11075-019-00711-z⟩. ⟨hal-01939097⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

148 View