Using PVS to validate the algorithms of an exact arithmetic
Theoretical Computer Science - Real numbers and computers
Efficient Reasoning about Executable Specifications in Coq
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
The iRRAM: Exact Arithmetic in C++
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Guaranteed Proofs Using Interval Arithmetic
ARITH '05 Proceedings of the 17th IEEE Symposium on Computer Arithmetic
Implementing Real Numbers With RZ
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
In this paper we present what is thought to be the world@?s shortest correct exact real arithmetic program. The aim is to provide a tractable starting point for formal analysis and further development. In addition the program presented here allows beginners to the field to easily experiment with a practical implementation in order to understand some of the issues involved. The algorithms used have been validated using PVS which provides some grounds for believing them to be correct. However, as neither PVS nor Haskell have been similarly validated, semantic problems in either PVS or Haskell might still undermine the work. A slightly shorter program with the same functionality could be written, but there would be a significant degradation in performance. By performing better range reduction, the performance could be increased. However, we would lose the correctness proofs and the program would become a bit longer and even more opaque.