X. Allamigeon and R. D. Katz, A Formalization of Convex Polyhedra Based on the Simplex Method, Interactive Theorem Proving (ITP) (LNCS), vol.10499, pp.28-45, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01673390

M. Armand, G. Faure, B. Grégoire, C. Keller, L. Théry et al., A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses, Certified Programs and Proofs (CPP) (LNCS), vol.7086, pp.135-150, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00639130

M. Armand, B. Grégoire, A. Spiwack, and L. Théry, Extending Coq with Imperative Features and Its Application to SAT Verification, Interactive Theorem Proving (ITP) (LNCS), vol.6172, pp.83-98, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00502496

H. Barendregt and E. Barendsen, Autarkic Computations in Formal Proofs, Journal of Automated Reasoning, vol.28, pp.321-336, 2002.

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

F. Besson, Fast Reflexive Arithmetic Tactics the Linear Case and Beyond, Types for Proofs and Programs (TYPES) (LNCS), vol.4502, pp.48-62, 2006.

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

S. Blazy, D. Demange, and D. Pichardie, Validating Dominator Trees for a Fast, Verified Dominance Test, Interactive Theorem Proving (ITP) (LNCS), vol.9236, pp.84-99, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01193281

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

S. Boulmé and T. Vandendorpe, Embedding Untrusted Imperative ML Oracles into Coq Verified Code, 2019.

V. Chvatal, Linear Programming, 1983.

P. Cousot and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Principles of Programming Languages (POPL), 1977.

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Principles of Programming Languages (POPL), 1978.

N. G. De-bruijn, The Mathematical Language AUTOMATH, Its Usage, and Some of Its Extensions, Symposium on Automatic Demonstration (LNM), vol.125, pp.29-61, 1968.

J. Farkas, Theorie der einfachen Ungleichungen, Journal für die Reine und Angewandte Mathematik, vol.124, 1902.

A. Fouilhé and S. Boulmé, A Certifying Frontend for (Sub)Polyhedral Abstract Domains, Verified Software: Theories, Tools, Experiments (VSTTE) (LNCS), 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 Symposium (SAS) (LNCS), vol.7935, pp.345-365, 2013.

J. Fourier, Histoire de l'Académie, partie mathématique (1824), vol.7, 1827.

J. Garrigue, Relaxing the Value Restriction, Asian Programming Languages and Systems Symposium (APLAS) (LNCS), vol.2998, pp.31-45, 2002.

J. C. Michael, R. Gordon, L. Milner, M. C. Morris, C. P. Newey et al., A Metalanguage for Interactive Proof in LCF, Principles of Programming Languages (POPL), pp.119-130, 1978.

J. C. Michael, R. Gordon, C. P. Milner, and . Wadsworth, Edinburgh LCF, vol.78, 1979.

B. Grégoire, L. Pottier, and L. Théry, Proof Certificates for Algebra and Their Application to Automatic Geometry Theorem Proving, Automated Deduction in Geometry (ADG) (LNCS), vol.6301, 2008.

J. Harrison and L. Théry, A Skeptic's Approach to Combining HOL and Maple, Journal of Automated Reasoning, vol.21, pp.279-294, 1998.

M. Jacob, A. Howe, and . King, Polyhedral Analysis using Parametric Objectives, Static Analysis Symposium (SAS) (LNCS), vol.7460, pp.41-57, 2012.

J. Jourdan, V. Laporte, S. Blazy, X. Leroy, and D. Pichardie, A Formally-Verified C Static Analyzer, Principles of Programming Languages (POPL), pp.247-259, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01078386

V. Magron, X. Allamigeon, S. Gaubert, and B. Werner, Formal Proofs for Nonlinear Optimization, Journal of Formalized Reasoning, vol.8, pp.1-24, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00985675

A. Maréchal, D. Monniaux, and M. Périn, Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming, Static Analysis Symposium (SAS) (LNCS), vol.10422, 2017.

G. C. Necula, Proof-Carrying Code, Principles of Programming Languages (POPL), pp.106-119, 1997.

J. C. Reynolds, Types, Abstraction and Parametric Polymorphism, IFIP Congress, pp.513-523, 1983.

J. Tristan and X. Leroy, Formal Verification of Translation Validators: a Case Study on Instruction Scheduling Optimizations, Principles of Programming Languages (POPL), pp.17-27, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00289540

P. Wadler, Theorems for Free!. In Functional Programming Languages and Computer Architecture (FPCA), pp.347-359, 1989.

A. K. Wright, Simple Imperative Polymorphism. Lisp and Symbolic Computation, vol.8, pp.343-355, 1995.