R. Bagnara, P. M. Hill, and E. Zaffanella, The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems, Science of Computer Programming, vol.72, issue.1-2, pp.3-21, 2008.
DOI : 10.1016/j.scico.2007.08.001

C. Barrett, A. Stump, and C. Tinelli, The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org, 2010.

D. Boland and G. A. Constantinides, Bounding Variable Values and Round-Off Effects Using Handelman Representations, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.30, issue.11, pp.1691-1704, 2011.
DOI : 10.1109/TCAD.2011.2161307

S. Boulmé and A. Maréchal, Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra, Interactive Theorem Proving (ITP), pp.100-116, 2015.
DOI : 10.1007/978-3-319-22102-1_7

L. Chen, A. Miné, J. Wang, and P. Cousot, Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships, Static Analysis Symposium (SAS), pp.309-325, 2009.
DOI : 10.1007/0-387-32698-7_2
URL : https://hal.archives-ouvertes.fr/hal-00531564

S. Chevillard, M. Jolde?, and C. Lauter, Sollya: An Environment for the Development of Numerical Codes, Mathematical Software -ICMS 2010, pp.28-31, 2010.
DOI : 10.1007/978-3-642-15582-6_5
URL : https://hal.archives-ouvertes.fr/hal-00761644

S. Chevillard, M. Jolde?, and C. Lauter, Certified and Fast Computation of Supremum Norms of Approximation Errors, 2009 19th IEEE Symposium on Computer Arithmetic, pp.169-176, 2009.
DOI : 10.1109/ARITH.2009.18
URL : https://hal.archives-ouvertes.fr/ensl-00334545

P. Clauss, F. J. Fernandez, D. Gabervetsky, and S. Verdoolaege, Symbolic Polynomial Maximization Over Convex Sets and Its Application to Memory Requirement Estimation, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, pp.983-996, 2009.
DOI : 10.1109/TVLSI.2008.2002049
URL : https://hal.archives-ouvertes.fr/inria-00504617

F. Corzilius, U. Loup, S. Junges, and E. Ábrahám, SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox, Theory and Applications of Satisfiability Testing (SAT), pp.442-448, 2012.
DOI : 10.1007/978-3-642-31612-8_35

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-97, 1978.
DOI : 10.1145/512760.512770

G. B. Dantzig and M. N. Thapa, Linear Programming 2: Theory and Extensions, 2003.

L. De-moura and N. Bjørner, Z3: An Efficient SMT Solver, Tools and Algorihtms for the Construction and Analysis of Systems (TACAS), pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24

L. M. De-moura and D. Jovanovic, A Model-Constructing Satisfiability Calculus, LNCS, vol.7737, pp.1-12, 2013.
DOI : 10.1007/978-3-642-35873-9_1

M. Deters, A. Reynolds, T. King, C. Barrett, and C. Tinelli, A tour of CVC4: How it works, and how to use it, 2014 Formal Methods in Computer-Aided Design (FMCAD), pp.7-11, 2014.
DOI : 10.1109/FMCAD.2014.6987586

B. Dutertre, Yices??2.2, Computer Aided Verification (CAV), pp.737-744, 2014.
DOI : 10.1007/978-3-319-08867-9_49

B. Dutertre and L. De-moura, A Fast Linear-Arithmetic Solver for DPLL(T), Computeraided verification (CAV), pp.81-94, 2006.
DOI : 10.1007/11817963_11

B. Dutertre and L. De-moura, Integrating simplex with dpll(t), 2006.

P. Feautrier, Parametric integer programming, RAIRO - Operations Research, vol.22, issue.3, pp.243-268, 1988.
DOI : 10.1051/ro/1988220302431

A. Fouilhé, D. Monniaux, and M. Périn, Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra, Static Analysis Symposium (SAS), pp.345-365, 2013.
DOI : 10.1007/978-3-642-38856-9_19

H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli, DPLL(T): Fast Decision Procedures, Computer Aided Verification (CAV), pp.175-188, 2004.
DOI : 10.1007/978-3-540-27813-9_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.8015

N. Halbwachs, Détermination automatique de relations linéaires vérifiées par les variables d'un programme, Thèse de doctorat de troisième cycle, 1979.

D. Handelman, Representing polynomials by positive linear functions on compact convex polyhedra, Pacific Journal of Mathematics, vol.132, issue.1, pp.35-62, 1988.
DOI : 10.2140/pjm.1988.132.35

B. Jeannet and A. Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, Computer Aided Verification (CAV), pp.661-667, 2009.
DOI : 10.1007/978-3-642-02658-4_52
URL : https://hal.archives-ouvertes.fr/hal-00786354

C. N. Jones, E. C. Kerrigan, and J. M. Maciejowski, Lexicographic perturbation for multiparametric linear programming with applications to control, Automatica, vol.43, issue.10, 2007.
DOI : 10.1016/j.automatica.2007.03.008

J. Jourdan, V. Laporte, S. Blazy, X. Leroy, and D. Pichardie, A formally-verified C static analyzer, In ACM Principles of Programming Languages (POPL), pp.247-259, 2015.
DOI : 10.1145/2775051.2676966
URL : https://hal.archives-ouvertes.fr/hal-01078386

D. Jovanovic and L. M. De-moura, Solving non-linear arithmetic, Automated Reasoning (IJCAR), pp.339-354, 2012.

T. V. Khanh, X. Vu, and M. Ogawa, rasat: SMT for polynomial inequality, Proceedings of the 12th International Workshop on Satisfiability Modulo Theories, SMT 2014, affiliated with the 26th International Conference on Computer Aided Verification (CAV 2014), the 7th International Joint Conference on Automated Reasoning (IJCAR 2014), and the 17th International Conference on Theory and Applications of Satisfiability Testing, p.67, 2014.

J. Krivine, Anneaux pr??ordonn??s, Journal d'Analyse Math??matique, vol.12, issue.1, pp.307-326, 1964.
DOI : 10.1007/BF02807438

J. B. Lasserre, Moments, Positive Polynomials and Their Applications, volume 1 of Imperial College Optimization Series, 2010.

V. Loechner and D. K. Wilde, Parameterized polyhedra and their vertices, International Journal of Parallel Programming, vol.2, issue.6, pp.525-549, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00534851

A. Maréchal and M. Périn, Three linearization techniques for multivariate polynomials in static analysis using convex polyhedra, 2014.

A. Maréchal and M. Périn, A linearization technique for multivariate polynomials using convex polyhedra based on Handelman's theorem, Journées Francophones des Langages Applicatifs (JFLA), 2015.

A. Miné, Symbolic Methods to Enhance the Precision of Numerical Abstract Domains, Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.348-363, 2006.
DOI : 10.1007/11609773_23

C. Muñoz and A. Narkawicz, Formalization of Bernstein Polynomials and Applications to Global Optimization, Journal of Automated Reasoning, vol.43, issue.1, pp.151-196, 2013.
DOI : 10.1007/s10817-012-9256-3

P. Néron, A Quest for Exactness: Program Transformation for Reliable Real Numbers, 2013.

A. Prestel and C. N. , Positive Polynomials: From Hilbert's 17th Problem to Real Algebra, 2001.
DOI : 10.1007/978-3-662-04648-7

M. Schweighofer, An algorithmic approach to Schm??dgen's Positivstellensatz, Journal of Pure and Applied Algebra, vol.166, issue.3, pp.307-319, 2002.
DOI : 10.1016/S0022-4049(01)00041-X

A. Stump, G. Sutcliffe, and C. Tinelli, StarExec: A Cross-Community Infrastructure for Logic Solving, Proceedings of the 7th International Joint Conference on Automated Reasoning, 2014.
DOI : 10.1007/978-3-319-08587-6_28