Polyhedral Approximation of Multivariate Polynomials using Handelman's Theorem

Abstract : Convex polyhedra are commonly used in the static analysis of programs to represent over-approximations of sets of reachable states of numerical program variables. When the analyzed programs contain nonlinear instructions, they do not directly map to standard polyhedral operations: some kind of linearization is needed. Convex polyhe-dra are also used in satisfiability modulo theory solvers which combine a propositional satisfiability solver with a fast emptiness check for polyhedra. Existing decision procedures become expensive when nonlinear constraints are involved: a fast procedure to ensure emptiness of systems of nonlinear constraints is needed. We present a new linearization algorithm based on Handelman's representation of positive polynomials. Given a polyhedron and a polynomial (in)equality, we compute a polyhedron enclosing their intersection as the solution of a parametric linear programming problem. To get a scalable algorithm, we provide several heuristics that guide the construction of the Handelman's representation. To ensure the correctness of our polyhedral approximation , our Ocaml implementation generates certificates verified by a checker certified in Coq.
Type de document :
Communication dans un congrès
International Conference on Verification, Model Checking, and Abstract Interpretation 2016, Jan 2016, St. Petersburg, United States. International Conference on Verification, Model Checking, and Abstract Interpretation 2016, 2015
Liste complète des métadonnées

Littérature citée [38 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01223362
Contributeur : Alexandre Maréchal <>
Soumis le : lundi 2 novembre 2015 - 15:14:03
Dernière modification le : vendredi 6 juillet 2018 - 10:08:02
Document(s) archivé(s) le : mercredi 3 février 2016 - 10:51:56

Fichier

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

Identifiants

  • HAL Id : hal-01223362, version 1

Collections

Citation

Alexandre Maréchal, Alexis Fouilhé, Tim King, David Monniaux, Michaël Périn. Polyhedral Approximation of Multivariate Polynomials using Handelman's Theorem. International Conference on Verification, Model Checking, and Abstract Interpretation 2016, Jan 2016, St. Petersburg, United States. International Conference on Verification, Model Checking, and Abstract Interpretation 2016, 2015. 〈hal-01223362〉

Partager

Métriques

Consultations de la notice

367

Téléchargements de fichiers

289