A reflexive tactic for polynomial positivity using numerical solvers and floating-point computations

Abstract : Polynomial positivity over the real field is known to be decidable but even the best algorithms remain costly. An incomplete but often efficient alternative consists in looking for positivity witnesses as sum of squares decompositions. Such decompositions can in practice be obtained through convex optimization. Unfortunately, these methods only yield approximate solutions. Hence the need for formal verification of such witnesses. State of the art methods rely on heuristic roundings to exact solutions in the rational field. These solutions are then easy to verify in a proof assistant. However, this verification often turns out to be very costly, as rational coefficients may blow up during computations. Nevertheless, overapproximations with floating-point arithmetic can be enough to obtain proofs at a much lower cost. Such overapproximations being non trivial, it is mandatory to formally prove that rounding errors are correctly taken into account. We develop a reflexive tactic for the Coq proof assistant allowing one to automatically discharge polynomial positivity proofs. The tactic relies on heavy computation involving multivariate polynomials, matrices and floating-point arithmetic. Benchmarks indicate that we are able to formally address positivity problems that would otherwise be untractable with other state of the art methods.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01510979
Contributor : Pierre Roux <>
Submitted on : Thursday, April 20, 2017 - 10:54:01 AM
Last modification on : Thursday, June 27, 2019 - 4:27:50 PM
Long-term archiving on : Friday, July 21, 2017 - 12:56:34 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Érik Martin-Dorel, Pierre Roux. A reflexive tactic for polynomial positivity using numerical solvers and floating-point computations. The 6th ACM SIGPLAN Conference on Certified Programs and Proofs (CPP 2017), Jan 2017, Paris, France. pp.90 - 99, ⟨10.1145/3018610.3018622⟩. ⟨hal-01510979⟩

Share

Metrics

Record views

252

Files downloads

239