arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.06119cs.PL
收藏

IEEE 754浮点算法的正确逼近及其程序验证

Correct Approximation of IEEE 754 Floating-Point Arithmetic for Program Verification

Roberto Bagnara, Abramo Bagnara, Fabio Biselli, Michele Chiari, Roberta Gori

摘要:

验证使用浮点运算的程序是具有挑战性的几个帐户。对这类程序进行推理的困难之一是由于浮点运算的特殊性:舍入错误、无穷大、非数值对象(NaN)、带符号的零、非正规数、不同的舍入模式,关于浮点运算的一种可能性是通过形式为z = 1的一组三元约束来对程序计算路径建模。x op y,并使用约束传播技术来推断关于变量的可能值的新信息。在这种情况下,我们定义并证明了算法的正确性,以精确地限制变量x,y或z之一的值,从其他两个已知的界限开始。我们对每个操作和IEEE 754二进制浮点标准定义的每个舍入模式都这样做,即使在舍入模式仅部分已知的情况下。这是第一次,这种所谓的过滤算法的定义,并正式证明其正确性。这是为使用浮点运算的程序的形式化验证铺平道路的重要基石。

英文摘要:

Verification of programs using floating-point arithmetic is challenging on several accounts. One of the difficulties of reasoning about such programs is due to the peculiarities of floating-point arithmetic: rounding errors, infinities, non-numeric objects (NaNs), signed zeroes, denormal numbers, different rounding modes, etc. One possibility to reason about floating-point arithmetic is to model a program computation path by means of a set of ternary constraints of the form z = x op y and use constraint propagation techniques to infer new information on the variables' possible values. In this setting, we define and prove the correctness of algorithms to precisely bound the value of one of the variables x, y or z, starting from the bounds known for the other two. We do this for each of the operations and for each rounding mode defined by the IEEE 754 binary floating-point standard, even in the case the rounding mode in effect is only partially known. This is the first time that such so-called filtering algorithms are defined and their correctness is formally proved. This is an important slab for paving the way to formal verification of programs that use floating-point arithmetics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑