Interval arithmetic: From principles to implementation
Journal of the ACM (JACM)
Using Reflection to Build Efficient and Certified Decision Procedures
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Elements of Mathematical Analysis in PVS
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Case Studies in Meta-Level Theorem Proving
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Mechanically verifying real-valued algorithms in acl2
Mechanically verifying real-valued algorithms in acl2
Guaranteed Proofs Using Interval Arithmetic
ARITH '05 Proceedings of the 17th IEEE Symposium on Computer Arithmetic
Theorem Proving with the Real Numbers
Theorem Proving with the Real Numbers
Using Abstraction in the Verification of Simulation Coercion
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
A monadic, functional implementation of real numbers
Mathematical Structures in Computer Science
Proving Bounds on Real-Valued Functions with Computations
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Real Number Calculations and Theorem Proving
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Certified Exact Transcendental Real Number Computation in Coq
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Floating-point arithmetic in the Coq system
Information and Computation
| Hi-index | 0.00 |
Wouldn't it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem proving framework. First, we formally establish upper and lower bounds for trigonometric and transcendental functions. Then, based on these bounds, we develop a rational interval arithmetic where real number calculations can be performed in an algebraic setting. This pragmatic approach has been implemented as a strategy in PVS. The strategy provides a safe way to perform explicit calculations over real numbers in formal proofs.