Multi-prover verification of floating-point programs (original) (raw)

Communication Dans Un Congrès Année : 2010

Ali Ayad

Résumé

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.

Connectez-vous pour contacter le contributeur

https://inria.hal.science/inria-00534333

Soumis le : mercredi 10 novembre 2010-14:00:59

Dernière modification le : mercredi 26 février 2025-15:22:03

Archivage à long terme le : vendredi 26 octobre 2012-15:21:07

Dates et versions

inria-00534333 , version 1 (10-11-2010)

Licence

Identifiants

Citer

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⟩

601 Consultations

559 Téléchargements