Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of equations and inequalities. A particularly attractive feature is that suitable 'sum of squares' certificates can be found by sophisticated numerical methods such as semidefinite programming, yet the actual verification of the resulting proof is straightforward even in a highly foundational theorem prover. We will describe our experience with an implementation in HOL Light, noting some successes as well as difficulties. We also describe a new approach to the univariate case that can handle some otherwise difficult examples. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Harrison, J. (2007). Verifying nonlinear real formulas via sums of squares. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4732 LNCS, pp. 102–118). Springer Verlag. https://doi.org/10.1007/978-3-540-74591-4_9
Mendeley helps you to discover research relevant for your work.