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.
Type de document :
Communication dans un congrès
The 6th ACM SIGPLAN Conference on Certified Programs and Proofs (CPP 2017), Jan 2017, Paris, France. CPP 2017, pp.90 - 99, 2017, 〈10.1145/3018610.3018622〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01510979
Contributeur : Pierre Roux <>
Soumis le : jeudi 20 avril 2017 - 10:54:01
Dernière modification le : jeudi 27 juillet 2017 - 20:34:38
Document(s) archivé(s) le : vendredi 21 juillet 2017 - 12:56:34

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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. CPP 2017, pp.90 - 99, 2017, 〈10.1145/3018610.3018622〉. 〈hal-01510979〉

Partager

Métriques

Consultations de
la notice

79

Téléchargements du document

57