Built-in Treatment of an Axiomatic Floating-Point Theory for SMT Solvers - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Built-in Treatment of an Axiomatic Floating-Point Theory for SMT Solvers

(1) , (2) , (1) , (1)
1
2

Abstract

The treatment of the axiomatic theory of floating-point numbers is out of reach of current SMT solvers, especially when it comes to automatic reasoning on approximation errors. In this paper, we describe a dedicated procedure for such a theory, which provides an interface akin to the instantiation mechanism of an SMT solver. This procedure is based on the approach of the Gappa tool: it performs saturation of consequences of the axioms, in order to refine bounds on expressions. In addition to the original approach, bounds are further refined by a constraint solver for linear arithmetic. Combined with the natural support for equalities provided by SMT solvers, our approach improves the treatment of goals coming from deductive verification of numerical programs. We have implemented it in the Alt-Ergo SMT solver.
Fichier principal
Vignette du fichier
article.pdf (274.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01785166 , version 1 (04-05-2018)

Identifiers

  • HAL Id : hal-01785166 , version 1

Cite

Sylvain Conchon, Guillaume Melquiond, Cody Roux, Mohamed Iguernelala. Built-in Treatment of an Axiomatic Floating-Point Theory for SMT Solvers. 10th International Workshop on Satisfiability Modulo Theories, Jun 2012, Manchester, United Kingdom. pp.12-21. ⟨hal-01785166⟩
202 View
100 Download

Share

Gmail Facebook Twitter LinkedIn More