D. Monniaux, A. Maréchal, and M. Périn, Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming". In: Static analysis (SAS). Ed. by Francesco Ranzato, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01555998

R. Bagnara, P. M. Hill, E. Ricci, and E. Zaffanella, Precise widening operators for convex polyhedra, In: Sci. Comput. Program, vol.58, pp.28-56, 2005.

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.

F. Benoy, A. King, and F. Mesnard, Computing Convex Hulls with a Linear Solver, Theory and Practice of Logic Programming 5.1, 2005.

F. Besson, T. P. Jensen, D. Pichardie, and T. Turpin, Certified Result Checking for Polyhedral Analysis of Bytecode Programs, Trustworthy Global Computing (TGC), vol.6084, p.537816, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00537816

S. Boulmé and A. Maréchal, A Coq Tactic for Equality Learning in Linear Arithmetic, Interactive Theorem Proving (ITP), vol.10895, pp.108-125, 2018.

S. Boulmé and A. Maréchal, Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra, J. Automated Reasoning, 2018.

S. Boulmé and A. Maréchal, Toward Certification for Free! Preprint, p.1558252, 2017.

V. Chvátal, Linear Programming. Series of books in the Mathematical Sciences, 1983.

P. Cousot and N. Halbwachs, Automatic Discovery of Linear Restraints Among Variables of a Program, ACM SIGACT-SIGPLAN Symposium on Principles of programming languages (POPL)

A. V. Aho, S. N. Zilles, and T. G. Szymanski, , pp.84-96, 1978.

G. Dantzig and N. Munkund, Thapa. Linear Programming. Introduction, vol.1, pp.0-387, 1997.

A. Fouilhé, Revisiting the abstract domain of polyhedra : constraintsonly representation and formal proof, p.1286086, 2015.

A. Fouilhé and S. Boulmé, A Certifying Frontend for (Sub)polyhedral Abstract Domains, Verified Software: Theories, Tools and Experiments (VSTTE), vol.8471

, , pp.200-215, 2014.

A. Fouilhé, D. Monniaux, and M. Périn, Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra, Static analysis (SAS), 2013.

J. Fourier, Histoire de l'Académie, partie mathématique (1824)". In: Mémoires de l'Académie des sciences de l, Institut de France, vol.7

J. Garrigue, Relaxing the Value Restriction, Functional and Logic Programming, 7th International Symposium (FLOPS), vol.2998, pp.196-213, 2004.

N. Halbwachs, Université Scientifique et Médicale de Grenoble & Institut National Polytechnique de Grenoble, p.288805, 1979.

N. Halbwachs, D. Merchat, and L. Gonnord, Some ways to reduce the space dimension in polyhedra computations, Formal Methods in System Design, vol.29, issue.1, pp.79-95, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00189633

B. Jeannet and A. Miné, Apron: a Library of Numerical Abstract Domains for Static Analysis, Computer Aided Verification, 21st International Conference, vol.5643, pp.661-667, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00786354

C. Jones, N. Eric, C. Kerrigan, and J. M. Maciejowski, On Polyhedral Projections and Parametric Programming", In: J. Optimization Theory and Applications, vol.138, pp.207-220, 2008.

C. N. Jones, E. C. Kerrigan, and J. M. Maciejowski, Lexicographic perturbation for multiparametric linear programming with applications to control, Automatica, 2007.

J. Jourdan, Verasco: a Formally Verified C Static Analyzer, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01327023

J. Jourdan, V. Laporte, S. Blazy, X. Leroy, and D. Pichardie, A Formally-Verified C Static Analyzer, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.247-259, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01078386

L. Khachiyan, Fourier-Motzkin Elimination Method, Encyclopedia of Optimization. Ed. by Christodoulos A. Floudas and Panos M Pardalos, pp.1074-1076, 2009.

L. Khachiyan, E. Boros, K. Borys, M. Khaled, V. Elbassioni et al., Generating All Vertices of a Polyhedron Is Hard, Also as DIMACS TR 2005-21, vol.39, pp.174-190, 2008.

V. Laporte, Verified static analyzes for low-level languages, Theses. Université Rennes, vol.1, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01285624

V. Hervé-le, A note on Chernikova's Algorithm

A. Maréchal, New Algorithmics for Polyhedral Calculus via Parametric Linear Programming. (Nouvelle Algorithmique pour le Calcul Polyédral via Programmation Linéaire Paramétrique)". PhD thesis, p.1695086, 2017.

A. Maréchal and M. Périn, Efficient Elimination of Redundancies in Polyhedra by Raytracing, Verification, Model Checking, and Abstract Interpretation (VMCAI), vol.10145

, , pp.367-385, 2017.

P. Mcmullen and G. C. Shepard, London Mathematical Society lecture note series, Convex polytopes and the upper bound conjecture, vol.3, pp.0-521, 1971.

T. S. Motzkin, Selected papers, pp.3-7643, 1983.

T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall, The double description method, Contributions to the theory of games, vol.2, pp.51-74, 1953.

A. Schrijver, Theory of Linear and Integer Programming. Wiley, pp.0-471, 1998.

G. Singh, M. Püschel, and M. T. Vechev, A practical construction for decomposing numerical abstract domains, Proceedings of the ACM on Programming Languages (PACMPL) 2.POPL, vol.55, 2018.