Optimal inverse projection of floating-point addition
Numerical Algorithms(2019)
摘要
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.
更多查看译文
关键词
Floating-point,Inverse projection,Abstract interpretation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络