MetiTarski: An Automatic Prover for the Elementary Functions
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Certification of bounds on expressions involving rounded operators
ACM Transactions on Mathematical Software (TOMS)
A Formal Theory of Cooperative TU-Games
MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Journal of Automated Reasoning
Design issues and implementations for floating-point divide-add fused
IEEE Transactions on Circuits and Systems II: Express Briefs
Improved bound for stochastic formal correctness of numerical algorithms
Innovations in Systems and Software Engineering
Formally verified conditions for regularity of interval matrices
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Automatic verification of estimate functions with polynomials of bounded functions
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Abstract partial cylindrical algebraic decomposition i: the lifting phase
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Formalization of Bernstein Polynomials and Applications to Global Optimization
Journal of Automated Reasoning
| Hi-index | 14.98 |
Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a theorem prover or proof assistant in a convenient and highly automated as well as interactive way. First, we formally establish upper and lower bounds for elementary functions. Then, based on these bounds, we develop a rational interval arithmetic where real number calculations take place in an algebraic setting. In order to reduce the dependency effect of interval arithmetic, we integrate two techniques: interval splitting and Taylor series expansions. This pragmatic approach has been developed, and formally verified, in a theorem prover. The formal development also includes a set of customizable strategies to automate proofs involving explicit calculations over real numbers. Our ultimate goal is to provide guaranteed proofs of numerical properties with minimal human theorem-prover interaction.