Some steps into verification of exact real arithmetic

Authors:
Norbert Th. Müller;Christian Uhrhan
Affiliations:
Abteilung Informatik, FB IV, Universität Trier, Germany;Faculty IV, Universität Siegen, Germany
Venue:
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Year:
2012

Citing 5
Cited 0

Computable analysis: an introduction

Computable analysis: an introduction
The iRRAM: Exact Arithmetic in C++

CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
RealLib: An efficient implementation of exact real arithmetic

Mathematical Structures in Computer Science
Implementing Real Numbers With RZ

Electronic Notes in Theoretical Computer Science (ENTCS)
A computer-verified monadic functional implementation of the integral

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The mathematical concept of real numbers is much richer than the double precision numbers widely used as their implementation on a computer. The field of ‘exact real arithmetic' tries to combine the elegance and correctness of the mathematical theories with the speed of double precision hardware, as far as possible. In this paper, we describe an ongoing approach using the specification language ACSL, the tool suite Frama-C (with why and jessie) and the proof assistant Coq to verify central aspects of the iRRAM software package, which is known to be a fast C++ implementation of 'exact' reals numbers.