Polynomial function intervals for floating-point software verification
DOI10.1007/s10472-014-9409-7zbMath1296.65071OpenAlexW2069520832MaRDI QIDQ457251
Publication date: 26 September 2014
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://publications.aston.ac.uk/id/eprint/23670/1/Polynomial_function_intervals_for_floating_point_software_verification.pdf
theorem provinginterval arithmeticfloating-point software verificationnon-linear numerical constraint solvingpolynomial intervalsvalidated computation
Interval and finite arithmetic (65G30) Algorithms with automatic result verification (65G20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Numerical algorithms for computer arithmetic, etc. (65Y04)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial function intervals for floating-point software verification
- MetiTarski: An automatic theorem prover for real-valued special functions
- Efficient control of the dependency problem based on Taylor model methods
- Taylor forms -- use and limits.
- Certification of bounds on expressions involving rounded operators
- Algorithm 852
- Static Analysis of Numerical Algorithms
- Combining Coq and Gappa for Certifying Floating-Point Programs
- Floats and Ropes: A Case Study for Formal Numerical Program Verification
- Improving Real Analysis in Coq: A User-Friendly Approach to Integrals and Derivatives
- Efficient solving of quantified inequality constraints over the real numbers
- Numerical Software with Result Verification
- Programming Languages and Systems
- Why3 — Where Programs Meet Provers
- On Taylor Model Based Integration of ODEs
