Some Steps into Verification of Exact Real Arithmetic
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.
KeywordsReal Number Double Precision Interval Arithmetic Runtime Environment Proof Assistant
Unable to display preview. Download preview PDF.
- [Bau08]Bauer, A.: Efficient computation with Dedekind reals. In: 5th International Conference on Computability and Complexity in Analysis, CCA 2008, Hagen, Germany, August 21-24 (2008)Google Scholar
- [BHW07]Brattka, V., Hertling, P., Weihrauch, K.: A Tutorial on Computable Analysis. In: Barry Cooper, S., Löwe, B., Sorbi, A. (eds.) New Computational Paradigms: Changing Conceptions of What is Computable, pp. 425–491. Springer, New York (2008)Google Scholar
- [Les08]Lester, D.R.: The world’s shortest correct exact real arithmetic program? In: Proc. 8th Conference on Real Numbers and Computers, pp. 103–112 (2008)Google Scholar
- [We00]Weihrauch, K.: Computable analysis: An introduction. Springer-Verlag New York, Inc. (2000)Google Scholar