Skip to main navigation Skip to search Skip to main content

Formal verification of floating-point programs

  • INRIA-Futurs and Xyleme

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper introduces a methodology to perform formal verification of floating-point C programs. It extends an existing tool for the verification of C programs, Caduceus, with new annotations specific to floating-point arithmetic. The Caduceus first-order logic model for C programs is extended accordingly. Then verification conditions expressing the correctness of the programs are obtained in the usual way and can be discharged interactively with the Coq proof assistant, using an existing Coq formalization of floatingpoint arithmetic. This methodology is already implemented and has been successfully applied to several short floatingpoint programs, which are presented in this paper.

Original languageEnglish
Title of host publicationProceedings - 18th IEEE Symposium on Computer Arithmetic, ARITH 18
Pages187-194
Number of pages8
DOIs
Publication statusPublished - 16 Nov 2007
Event18th IEEE Symposium on Computer Arithmetic, ARITH 18 - Montpellier, France
Duration: 25 Jun 200727 Jun 2007

Publication series

NameProceedings - Symposium on Computer Arithmetic

Conference

Conference18th IEEE Symposium on Computer Arithmetic, ARITH 18
Country/TerritoryFrance
CityMontpellier
Period25/06/0727/06/07

Fingerprint

Dive into the research topics of 'Formal verification of floating-point programs'. Together they form a unique fingerprint.

Cite this