Multi-prover verification of floating-point programs
Abstract
In the context of deductive program verification, supporting floatingpoint computations is tricky.We propose an expressive language to formally specify behavioral properties of such programs. We give a first-order axiomatization of floating-point operations which allows to reduce verification to checking the validity of logic formulas, in a suitable form for a large class of provers including SMT solvers and interactive proof assistants. Experiments using the Frama-C platform for static analysis of C code are presented.
Origin | Files produced by the author(s) |
---|
Loading...