Multi-prover verification of floating-point programs

Ali Ayad (1, 2) , Claude Marché (3)

1 LRI - Laboratoire de Recherche en Informatique
2 LIST (CEA) - Laboratoire d'Intégration des Systèmes et des Technologies
3 PROVAL - Proof of Programs

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.

Domaines: Logique en informatique [cs.LO]

Ali Ayad, Claude Marché. Multi-prover verification of floating-point programs. Fifth International Joint Conference on Automated Reasoning, Jul 2010, Edinburgh, United Kingdom. ⟨inria-00534333⟩