Guaranteed Proofs Using Interval Arithmetic - Archive ouverte HAL Access content directly
Conference Papers Year : 2005

Guaranteed Proofs Using Interval Arithmetic


This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval splitting and Taylor's series expansions. Although the tools are designed for the proof assistant system PVS, expertise on PVS is not required. The ultimate goal of the tools is to provide guaranteed proofs of numerical properties with a minimal human-theorem prover interaction.
Fichier principal
Vignette du fichier
Daumas_Melquiond_et_Munoz.pdf (142.19 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00164621 , version 1 (22-07-2007)



Marc Daumas, Guillaume Melquiond, César Muñoz. Guaranteed Proofs Using Interval Arithmetic. 17th IEEE Symposium on Computer Arithmetic, 2005, Cape Cod, Massachusetts, United States. pp.188-195, ⟨10.1109/ARITH.2005.25⟩. ⟨hal-00164621⟩
147 View
206 Download



Gmail Facebook X LinkedIn More