Convergent bounds for the range of multivariate polynomials
Proceedings of the International Symposium on interval mathematics on Interval mathematics 1985
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques
ACM Transactions on Mathematical Software (TOMS)
Implementing the cylindrical algebraic decomposition within the Coq system
Mathematical Structures in Computer Science
Interval methods for global optimization
Interval methods for global optimization
Proving Bounds on Real-Valued Functions with Computations
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Verified Real Number Calculations: A Library for Interval Arithmetic
IEEE Transactions on Computers
Fast construction of constant bound functions for sparse polynomials
Journal of Global Optimization
Combined Decision Techniques for the Existential Theory of the Reals
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
An efficient algorithm for range computation of polynomials using the Bernstein form
Journal of Global Optimization
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Journal of Automated Reasoning
Verifying nonlinear real formulas via sums of squares
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Certifying the Floating-Point Implementation of an Elementary Function Using Gappa
IEEE Transactions on Computers
On the generation of positivstellensatz witnesses in degenerate cases
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Formal global optimisation with taylor models
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A proof-producing decision procedure for real arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
A review of conflict detection and resolution modeling methods
IEEE Transactions on Intelligent Transportation Systems
Rigorous polynomial approximation using taylor models in Coq
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
dReal: an SMT solver for nonlinear theories over the reals
CADE'13 Proceedings of the 24th international conference on Automated Deduction
JBernstein: a validity checker for generalized polynomial constraints
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
This paper presents a formalization in higher-order logic of a practical representation of multivariate Bernstein polynomials. Using this representation, an algorithm for finding lower and upper bounds of the minimum and maximum values of a polynomial has been formalized and verified correct in the Prototype Verification System (PVS). The algorithm is used in the definition of proof strategies for formally and automatically solving polynomial global optimization problems.