Accurate ICP-based floating-point reasoning

• Published in: 2016 Formal Methods in Computer-Aided Design (FMCAD) pp. 177 - 184
• Main Authors: Scheibler, Karsten, Neubauer, Felix, Mahdi, Ahmed, Franzle, Martin, Teige, Tino, Bienmuller, Tom, Fehrer, Detlef, Becker, Bernd
• Format: Conference Proceeding
• Language: English; Japanese
• Published: FMCAD Inc 01.10.2016
• Subjects: Cognition; Computational modeling; Context; dead-code detection; Encoding; floating-point; Iterative closest point algorithm; Lattices; Open area test sites; SMT
• DOI: 10.1109/FMCAD.2016.7886677

In scientific and technical software, floating-point arithmetic is often used to approximate arithmetic on physical quantities natively modeled as reals. Checking properties for such programs (e.g. proving unreachability of code fragments) requires accurate reasoning over floating-point arithmetic. Currently, most of the SMT-solvers addressing this problem class rely on bit-blasting. Recently, methods based on reasoning in interval lattices have been lifted from the reals (where they traditionally have been successful) to the floating-point numbers. The approach presented in this paper follows the latter line of interval-based reasoning, but extends it by including bitwise integer operations and cast operations between integer and floating-point arithmetic. Such operations have hitherto been omitted, as they tend to define sets not concisely representable in interval lattices, and were consequently considered the domain of bit-blasting approaches. By adding them to interval-based reasoning, the full range of basic data types and operations of C programs is supported. Furthermore, we propose techniques in order to mitigate the problem of aliasing during interval reasoning. The experimental results confirm the efficacy of the proposed techniques. Our approach outperforms solvers relying on bit-blasting as well as the existing interval-based SMT-solver.