R. Bagnara, P. M. Hill, E. Ricci, and E. Zaffanella, Precise widening operators for convex polyhedra, Science of Computer Programming, vol.58, 2005.

R. Bagnara, P. M. Hill, and E. Zaffanella, Not necessarily closed convex polyhedra and the double description method, Formal Aspects of Computing, vol.17, issue.2, 2005.
DOI : 10.1007/s00165-005-0061-1

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, 2008.
DOI : 10.1016/j.scico.2007.08.001

G. Balakrishnan, T. W. Reps, D. Melski, and T. Teitelbaum, WYSINWYX, Verified Software: Theories, Tools and Experiments, 2005.
DOI : 10.1145/1749608.1749612

F. Benoy, A. King, and F. Mesnard, Computing convex hulls with a linear solver, Theory and Practice of Logic Programming, vol.5, issue.1-2, 2005.
DOI : 10.1017/S1471068404002261

F. Besson, T. Jensen, D. Pichardie, and T. Turpin, Result certification for relational program analysis, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00166930

B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., A static analyzer for large safety-critical software, Programming Language Design and Implementation, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00128135

R. G. Bland, New Finite Pivoting Rules for the Simplex Method, Mathematics of Operations Research, vol.2, issue.2, 1977.
DOI : 10.1287/moor.2.2.103

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

. Bugseng, The Parma Polyhedra Library, 1.0 edition, 2012.

D. , C. Barbosa-de-oliveira, and D. Monniaux, Experiments on the feasibility of using a floating-point simplex in an SMT solver, Workshop on Practical Aspects of Automated Reasoning, 2012.

N. V. Chernikova, Algorithm for discovering the set of all the solutions of a linear programming problem, USSR Computational Mathematics and Mathematical Physics, 1968.

G. Claret, L. D. Gonzalez-huesca, Y. Régis-gianas, and B. Ziliani, Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation, Interactive Theorem Proving, 2013.
DOI : 10.1007/978-3-642-39634-2_8

URL : https://hal.archives-ouvertes.fr/hal-00870110

P. Cousot and R. Cousot, Static determination of dynamic properties of programs, International Symposium on Programming, 1976.

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, 1977.
DOI : 10.1145/512950.512973

URL : https://hal.archives-ouvertes.fr/hal-01108790

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, 1978.
DOI : 10.1145/512760.512770

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

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

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

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Fouilhé and S. Boulmé, A Certifying Frontend for (Sub)polyhedral Abstract Domains, Verified Software: Theories, Tools and Experiments, 2014.
DOI : 10.1007/978-3-319-12154-3_13

A. Fouilhé, D. Monniaux, and M. Périn, Efficient certificate generation for the abstract domain of polyhedra, Static Analysis Symposium, 2013.

J. Fourier, Histoire de l'académie, partie mathématique, Mémoire de l'Académie des sciences de l'Institut de France. Imprimerie Royale, p.1827

T. Gal and J. Nedoma, Multiparametric linear programming, Management Science, vol.18, 1972.

A. Gurfinkel, A. Belov, and J. Marques-silva, Synthetizing safe bit-precise invariants, Tools and Algorithms for the Construction and Analysis of Systems, 2014.

N. Halbwachs, Détermination automatique de relations linéaires vérifiées par les variables d'un programme, 1979.

J. Henry, D. Monniaux, and M. Moy, PAGAI: A Path Sensitive Static Analyser, Tools for Automatic Program Analysis, 2012.
DOI : 10.1016/j.entcs.2012.11.003

J. Howe and A. King, Polyhedral Analysis Using Parametric Objectives, Static Analysis Symposium, 2012.
DOI : 10.1007/978-3-642-33125-1_6

B. Jeannet and A. Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, Computer-aided Verification, 2009.
DOI : 10.1007/978-3-642-02658-4_52

URL : https://hal.archives-ouvertes.fr/hal-00786354

C. N. Jones, Polyhedral tools for control, 2005.

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

C. N. Jones, E. C. Kerrigan, and J. M. Maciejowski, On Polyhedral Projection and Parametric Programming, Journal of Optimization Theory and Applications, vol.48, issue.9, 2008.
DOI : 10.1007/s10957-008-9384-4

J. Jourdan, V. Laporte, S. Blazy, X. Leroy, and D. Pichardie, A formallyverified C static analyzer, Principles of Programming Languages, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01078386

N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica, vol.4, 1984.

D. A. Kohler, Projections of convex polyhedral sets, 1967.

X. Leroy, Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, 2009.
DOI : 10.1145/1538788.1538814

URL : https://hal.archives-ouvertes.fr/inria-00415861

F. Logozzo and V. Laviron, SubPolyhedra: a (more) scalable approach to infer linear inequalities, Verification, Model Checking and Abstract Interpretation, 2009.

A. Miné, The octagon abstract domain, Workshop on Analysis, Slicing, and Transformation, 2001.

D. Monniaux, On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure, Computer-aided Verification, 2009.
DOI : 10.1007/978-3-642-02658-4_42

URL : https://hal.archives-ouvertes.fr/hal-00354112

D. Monniaux, Quantifier Elimination by Lazy Model Enumeration, Computer-aided verification, 2010.
DOI : 10.1007/978-3-642-14295-6_51

URL : https://hal.archives-ouvertes.fr/hal-00472831

D. Pichardie, Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certifiés, 2005.

]. A. Simon and A. King, Exploiting Sparsity in Polyhedral Analysis, Static Analysis Symposium, 2005.
DOI : 10.1007/11547662_23

A. Simon and A. King, Taming the Wrapping of Integer Arithmetic, Static Analysis Symposium, 2007.
DOI : 10.1007/978-3-540-74061-2_8

M. Sozeau and N. Oury, First-Class Type Classes, Theorem Proving in Higher Order Logics, 2008.
DOI : 10.1007/11542384_8

URL : https://hal.archives-ouvertes.fr/inria-00628864

H. L. Verge, A note on Chernikova's algorithm, 1992.