, The Two Equilibria of the Free Pendulum

, The Inverted Pendulum

, Closed-Loop Control for the Inverted Pendulum

, The Inverted Pendulum with Annotations

, Steps in the Formal Study of a Physical System

. .. Vector-field,

, Contour Map of a Lyapunov Function

. .. The-coquelicot-hierarchy,

. .. , The Inverted Pendulum with Annotations (repeated), p.44

, The Coquelicot Hierarchy (repeated)

, Partial Hierarchy of Mathematical Components Analysis, vol.78

. .. , Hierarchy of Mathematical Components Analysis, p.85

, The Methodology of Reflection with Refinement

. .. The-coqeal_ring-tactic, M. José-bacelar-almeida, G. Barbosa, A. Barthe, B. Blot et al., Jasmin: High-Assurance and High-Speed Cryptography, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp.1807-1823, 2017.

S. Aubry, S. Boldo, F. Clément, and F. Faissole, Vincent Martin, and Micaela Mayero. MILC: Mesure et Intégrale de Lebesgue en Coq

A. Anand, S. Boulier, C. Cohen, M. Sozeau, and N. Tabareau, Towards Certified Meta-Programming with Typed Template-Coq, Avigad and Mahboubi [AM18], vol.18, pp.20-39
URL : https://hal.archives-ouvertes.fr/hal-01809681

A. Anand, S. Boulier, N. Tabareau, and M. Sozeau, Typed Template Coq -Certified Meta-Programming in Coq, CoqPL 2018 -The Fourth International Workshop on Coq for Programming Languages, pp.1-2, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01671948

C. Acb-+-]-abhishek-anand, S. Cohen, G. Boulier, and . Malecha, Matthieu Sozeau, and Nicolas Tabareau. metacoq: Metaprogramming in Coq

C. Acm-+-]-reynald-affeldt, A. Cohen, D. Mahboubi, P. Rouhling, and . Strub, The Mathematical Components Analysis Library

C. +-18]-reynald-affeldt, A. Cohen, D. Mahboubi, P. Rouhling, and . Strub, Classical Analysis with Coq

R. Affeldt, C. Cohen, and D. Rouhling, Formalization Techniques for Asymptotic Reasoning in Classical Analysis, Journal of Formalized Reasoning, vol.11, issue.1, pp.43-76, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01719918

J. Avigad and K. Donnelly, Formalizing O Notation in Isabelle/HOL, Automated Reasoning -Second International Joint Conference, vol.3097, pp.357-371, 2004.

J. Avigad, L. De-moura, and S. Kong, Theorem Proving in Lean, 2018.

A. Arsie and C. Ebenbauer, Refining LaSalle's Invariance Principle, Proceedings of the 2009 Conference on American Control Conference, ACC'09, pp.108-112, 2009.

J. , M. Arnaudiès, and H. Fraysse, Cours de mathématiques, Analyse. Dunod, vol.2, 1988.

K. J. Åström and K. Furuta, Swinging up a pendulum by energy control, Automatica, vol.36, issue.2, pp.287-295, 2000.

, Proceedings of the 7th ACM SIG-PLAN International Conference on Certified Programs and Proofs, vol.2018, 2018.

G. Afg-+-11]-michaël-armand, B. Faure, C. Grégoire, L. Keller, B. Théry et al., A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses, Jouannaud and Shao, pp.135-150

R. Atkey, N. Ghani, and P. Johann, A Relationally Parametric Model of Dependent Type Theory, The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.503-516, 2014.

A. Anand and R. A. Knepper, ROSCoq: Robots Powered by Constructive Reals, Interactive Theorem Proving -6th International Conference, vol.9236, pp.34-50, 2015.

K. J. Åström and R. M. Murray, Feedback Systems: An Introduction for Scientists and Engineers, 2008.

, Interactive Theorem Proving -8th International Conference, vol.10499, 2017.

, Interactive Theorem Proving -9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC, vol.10895, 2018.

R. Arthan, The Eudoxus Real Numbers, 2004.

P. Bachmann, Die Analytische Zahlentheorie, p.1894

H. Erwin and . Bareiss, Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination, Mathematics of Computation, vol.22, issue.103, pp.565-578, 1968.

I. Barkana, Defending the beauty of the Invariance Principle, International Journal of Control, vol.87, issue.1, pp.186-206, 2014.

I. Barkana, Can Stability Analysis be really simplified? (Revisiting Lyapunov, Barbalat, LaSalle and all that), AIP Conference Proceedings, vol.1798, issue.1, p.20017, 2017.

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

G. Bancerek, C. Byli?ski, A. Grabowski, A. Korni?owicz, R. Matuszewski et al., The Role of the Mizar Mathematical Library for Interactive Proof Development in Mizar, Journal of Automated Reasoning, vol.61, issue.1-4, pp.9-32, 2018.

S. Bernard, Y. Bertot, L. Rideau, and P. Strub, Formal Proofs of Transcendence for e and pi as an Application of Multivariate and Symmetric Polynomials, Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, pp.76-87, 2016.

H. Barendregt and A. M. Cohen, Electronic Communication of Mathematics and the Interaction of Computer Algebra Systems and Proof Assistants, Journal of Symbolic Computation, vol.32, issue.1/2, pp.3-22, 2001.

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development -Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science, An EATCS Series, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

. Bcf-+-13]-sylvie, F. Boldo, J. Clément, M. Filliâtre, G. Mayero et al., Wave Equation Numerical Resolution: A Comprehensive Mechanized Proof of a C Program, Journal of Automated Reasoning, vol.50, issue.4, pp.423-456, 2013.

. Bcf-+-17]-sylvie, F. Boldo, F. Clément, V. Faissole, M. Martin et al., A Coq formal proof of the Lax-Milgram theorem, Bertot and Vafeiadis, vol.17, pp.79-89

J. Bernardy, T. Coquand, and G. Moulin, A Presheaf Model of Parametric Type Theory. Electronic Notes in Theoretical Computer Science, vol.319, pp.67-82, 2015.

M. Boespflug, M. Dénès, and B. Grégoire, Full Reduction at Full Throttle, pp.362-377
URL : https://hal.archives-ouvertes.fr/hal-00650940

N. Benton, Machine Obstructed Proof -How many months can it take to verify 30 assembly instructions?, 1st Informal ACM SIGPLAN Workshop on Mechanizing Metatheory, 2006.

N. Benton, The Proof Assistant as an Integrated Development Environment, Programming Languages and Systems -11th Asian Symposium, vol.8301, pp.307-314, 2013.

. Springer, , 2013.

S. Bernard, Fichiers de structures pour R et

S. Bernard, Formalization of the Lindemann-Weierstrass Theorem, pp.65-80
URL : https://hal.archives-ouvertes.fr/hal-01647563

, Interactive Theorem Proving -Third International Conference, ITP 2012, vol.7406, 2012.

S. Boldo, J. Filliâtre, and G. Melquiond, Combining Coq and Gappa for Certifying Floating-Point Programs, 8th International Conference, MKM 2009, Held as Part of CICM 2009, vol.5625, pp.59-74, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00432726

L. M. Brekhovskikh and V. Goncharov, Mechanics of Continua and Wave Dynamics, Springer Series on Wave Phenomena, 1994.

Y. Bertot and G. Gonthier, Sidi Ould Biha, and Ioana Pa?ca. Canonical big operators, pp.86-101

M. P. Jasmin-christian-blanchette, D. Haslbeck, T. Matichuk, and . Nipkow, Mining the Archive of Formal Proofs, telligent Computer Mathematics -International Conference, CICM 2015, Washington, vol.9150, pp.3-17, 2015.

M. Bjmd-+-]-nicolas-brisebarre, E. Joldes, M. Martin-dorel, J. Mayero, I. Muller et al., The Co-qApprox Library

J. Bernardy, P. Jansson, and R. Paterson, Proofs for free -Parametricity for dependent types, Journal of Functional Programming, vol.22, issue.2, pp.107-152, 2012.

S. Boldo, C. Lelay, and G. Melquiond, Improving Real Analysis in Coq: A User-Friendly Approach to Integrals and Derivatives, Certified Programs and Proofs -Second International Conference, vol.2012, pp.289-304, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00712938

. Springer, , 2012.

S. Boldo, C. Lelay, and G. Melquiond, Coquelicot: A User-Friendly Library of Real Analysis for Coq, Mathematics in Computer Science, vol.9, issue.1, pp.41-62, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00860648

S. Boldo, C. Lelay, and G. Melquiond, Formalization of Real Analysis: A Survey of Proof Assistants and Libraries, Mathematical Structures in Computer Science, vol.26, issue.7, pp.1196-1233, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00806920

S. Boldo and G. Melquiond, Flocq: A Unified Library for Proving Floating-Point Algorithms in Coq, 20th IEEE Symposium on Computer Arithmetic, pp.243-252, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00534854

J. , P. Bernardy, and G. Moulin, Type-Theory In Color, ACM SIGPLAN International Conference on Functional Programming, ICFP'13, pp.61-72, 2013.

S. Boldo and G. Melquiond, Computer Arithmetic and Formal Proofs, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01632617

S. Berghofer, T. Nipkow, C. Urban, and M. Wenzel, Theorem Proving in Higher Order Logics, 22nd International Conference, vol.5674, 2009.

N. Bourbaki, Topologie générale, Chapitres 1 à 4. Éléments de mathématiques, 1971.

N. Bourbaki, Topologie générale, Chapitres 5 à 10. Éléments de mathématiques, 1974.

S. Boutin, Using Reflection to Build Efficient and Certified Decision Procedures, Theoretical Aspects of Computer Software, Third International Symposium, TACS '97, vol.1281, pp.515-529, 1997.

, Interactive Theorem Proving -4th International Conference, vol.7998, 2013.

Y. Bertot, L. Rideau, and L. Théry, Distant Decimals of ? : Formal Proofs of Some Algorithms Computing Them and Guarantees of Exact Computation, Journal of Automated Reasoning, vol.61, issue.1-4, pp.33-71, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01582524

B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, 1965.

, Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017.

F. Cajori, A History of Mathematical Notations. The Open Court Publishing Company, 1928.

G. Cano, Interaction entre algèbre linéaire et analyse en formalisation des mathématiques. (Interaction between linear algebra and analysis in formal mathematics), 2014.

H. Cartan, Filtres et ultrafiltres, Comptes rendus hebdomadaires des séances de l'Académie des sciences, pp.777-779

H. Cartan, Théorie des filtres, Comptes rendus hebdomadaires des séances de l'Académie des sciences, pp.595-598

G. Cano, C. Cohen, M. Dénès, A. Mörtberg, D. Rouhling et al., The CoqEAL Library

R. Cauderlier and C. Dubois, FoCaLiZe and Dedukti to the Rescue for Proof Interoperability, pp.131-147
URL : https://hal.archives-ouvertes.fr/hal-01592243

C. Cohen, M. Dénès, and A. Mörtberg, Refinements for Free!, Certified Programs and Proofs -Third International Conference, vol.8307, pp.147-162, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01113453

, The Coq Development Team. The Coq proof assistant reference manual, 2019.

L. Cruz-filipe, H. Geuvers, and F. Wiedijk, C-CoRN, the Constructive Coq Repository at Nijmegen, Mathematical Knowledge Management, Third International Conference, MKM, vol.3119, pp.88-103, 2004.

. Springer, , 2004.

T. Coquand and G. P. Huet, The Calculus of Constructions. Information and Computation, vol.76, pp.95-120, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00076024

V. Chellaboina, A. Leonessa, and W. M. Haddad, Generalized Lyapunov and invariant set theorems for nonlinear dynamical systems, Systems & Control Letters, vol.38, issue.4-5, pp.289-295, 1999.

H. Choset, K. M. Lynch, S. Hutchinson, G. A. Kantor, W. Burgard et al., Principles of Robot Motion: Theory, Algorithms, and Implementations, 2005.

F. Chyzak, A. Mahboubi, T. Sibut-pinote, and E. Tassi, A Computer-Algebra-Based Formal Proof of the Irrationality of ?(3), Interactive Theorem Proving -5th International Conference, vol.8558, pp.160-176, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00984057

C. Cohen, real-closed: Theorems for Real Closed Fields in Mathematical Components

C. Cohen, Formalized algebraic numbers: construction and first-order theory, 2012.
URL : https://hal.archives-ouvertes.fr/pastel-00780446

T. Coquand, Une théorie des constructions, 1985.

T. Coquand and C. Paulin, Inductively defined types, COLOG-88, International Conference on Computer Logic, vol.417, pp.50-66, 1988.

D. Chatterjee, A. Patra, and H. K. Joglekar, Swing-up and stabilization of a cart-pendulum system under restricted cart track length, Systems & Control Letters, vol.47, issue.4, pp.355-364, 2002.

C. Cohen and D. Rouhling, LaSalle: A formal proof of LaSalle's invariance principle

C. Cohen and D. Rouhling, LaSalle: A formal proof of LaSalle's invariance principle

C. Cohen and D. Rouhling, A Formal Proof in Coq of LaSalle's Invariance Principle, pp.148-163

C. Cohen and D. Rouhling, A refinement-based approach to large scale reflection for algebra, JFLA 2017 -Vingt-huitième Journées Francophones des Langages Applicatifs, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01414881

M. Chan, D. Ricketts, S. Lerner, and G. Malecha, Formal Verification of Stability Properties of Cyber-physical Systems, CoqPL'16, 2016.

G. Chen, J. Zhou, and S. ?elikovský, On LaSalle's invariance principle and its application to robust synchronization of general vector Liénard equations, IEEE Transactions on Automatic Control, vol.50, issue.6, pp.869-874, 2005.

, Agata Darmochwa?. Compact Spaces. Formalized Mathematics, vol.1, issue.2, pp.383-386, 1990.

D. Delahaye, A Tactic Language for the System Coq, Logic for Programming and Automated Reasoning, 7th International Conference, vol.1955, pp.85-95, 2000.
URL : https://hal.archives-ouvertes.fr/hal-01125070

R. Diaconescu, Axiom of Choice and Complementation, Proceedings of the American Mathematical Society, vol.51, pp.176-178, 1975.

W. Edsger and . Dijkstra, The Humble Programmer, Communications of the ACM, vol.15, issue.10, pp.859-866, 1972.

B. Djalal, Formalisations en Coq pour la décision de problèmes en géométrie algébrique réelle, 2018.

D. Delahaye and M. Mayero, Field, une procédure de décision pour les nombres réels en Coq, Journées francophones des langages applicatifs (JFLA'01), pp.33-48, 2001.

D. Delahaye and M. Mayero, Dealing with Algebraic Expressions over a Field in Coq using Maple, Journal of Symbolic Computation, vol.39, issue.5, pp.569-592, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01125074

D. Delahaye and M. Mayero, Quantifier Elimination over Algebraically Closed Fields in a Proof Assistant using a Computer Algebra System, Electronic Notes in Theoretical Computer Science, vol.151, issue.1, pp.57-73, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01125075

M. Daumas and G. Melquiond, Certification of bounds on expressions involving rounded operators, ACM Transactions on Mathematical Software, vol.37, issue.1, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00127769

L. Mendonça-de-moura, S. Kong, J. Avigad, F. Van-doorn, and J. V. Raumer, The Lean Theorem Prover (System Description), Felty and Middeldorp [FM15], pp.378-388

M. Dénès, A. Mörtberg, and V. Siles, A Refinement-Based Approach to Computational Algebra in Coq, Beringer and Felty, vol.12, pp.83-98

B. Delaware, C. Pit-claudel, J. Gross, and A. Chlipala, Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.689-700, 2015.

E. Doskocz, Y. Shtessel, and C. Katsinis, MIMO Sliding Mode Control of a Robotic "Pick and Place" System Modeled as an Inverted Pendulum on a Moving Cart, Proceedings of Thirtieth Southeastern Symposium on System Theory, pp.379-383, 1998.

M. Eberl, Proving Divide and Conquer Complexities in Isabelle/HOL, Journal of Automated Reasoning, vol.58, issue.4, pp.483-508, 2017.

M. Eberl, Verified Real Asymptotics in Isabelle/HOL, Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '19, 2019.

M. Eberl, Verified Solving and Asymptotics of Linear Recurrences, Proceedings of the 8th ACM SIG-PLAN International Conference on Certified Programs and Proofs, pp.27-37, 2019.

N. R. Fischer, R. Kamalapurkar, and W. E. Dixon, LaSalle-Yoshizawa Corollaries for Nonsmooth Systems, IEEE Transactions on Automatic Control, vol.58, issue.9, pp.2333-2338, 2013.

, Automated Deduction -CADE-25 -25th International Conference on Automated Deduction, vol.9195, 2015.

J. Fmm-+-06]-pascal-fontaine, S. Marion, L. P. Merz, A. Nieto, and . Tiu, Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants, Tools and Algorithms for the Construction and Analysis of Systems, 12th International Conference, TACAS 2006 Held as Part of the Joint European Conferences on Theory and Practice of Software, vol.3920, pp.167-181, 2006.

S. +-15]-nathan-fulton, J. Mitsch, M. Quesel, A. Völp, and . Platzer, KeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems, Felty and Middeldorp [FM15], pp.527-538

J. Michael, M. O. Fischer, and . Rabin, Super-Exponential Complexity of Presburger Arithmetic, Quantifier Elimination and Cylindrical Algebraic Decomposition, pp.122-135, 1998.

G. Gonthier, A. Asperti, J. Avigad, Y. Bertot, C. Cohen et al., A Machine-Checked Proof of the Odd Order Theorem, pp.163-179
URL : https://hal.archives-ouvertes.fr/hal-00816699

F. Garillot, Generic Proof Tools and Finite Group Theory. (Outils génériques de preuve et théorie des groupes finis), École Polytechnique, 2011.
URL : https://hal.archives-ouvertes.fr/pastel-00649586

A. Guéneau, A. Charguéraud, and F. Pottier, A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification, Held as Part of the European Joint Conferences on Theory and Practice of Software, vol.10801, pp.533-560, 2018.

J. Gross, A. Erbsen, and A. Chlipala, Reification by Parametricity -Fast Setup for Proof by Reflection, in Two Lines of Ltac, Avigad and Mahboubi [AM18], pp.289-305

F. Garillot, G. Gonthier, A. Mahboubi, and L. Rideau, Packaging Mathematical Structures, pp.327-342
URL : https://hal.archives-ouvertes.fr/inria-00368403

A. Guéneau, J. Jourdan, A. Charguéraud, and F. Pottier, Formal Proof and Analysis of an Incremental Cycle Detection Algorithm, 10th International Conference on Interactive Theorem Proving, ITP 2019, vol.141, pp.1-18, 2019.

B. Grégoire and X. Leroy, A Compiled Implementation of Strong Reduction, Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), pp.235-246, 2002.

S. Glondu, Extraction certifiée dans Coq-en-Coq, Vingtièmes Journées Francophones des Langages Applicatifs, pp.383-410, 2009.

S. Glondu, Vers une certification de l'extraction de Coq. (Towards certification of the extraction of Coq), 2012.
URL : https://hal.archives-ouvertes.fr/tel-01798332

J. Gilcher, A. Lochbihler, and D. Traytel, Conditional Parametricity in Isabelle/HOL, TABLEAUX -Frontiers of Combining Systems (FroCoS) -Interactive Theorem Proving (ITP) 2017, 2017.

B. Grégoire and A. Mahboubi, Proving Equalities in a Commutative Ring Done Right in Coq, Hurd and Melham [HM05], pp.98-113

G. Gonthier, A. Mahboubi, and E. Tassi, A Small Scale Reflection Extension for the Coq system, 2015.
URL : https://hal.archives-ouvertes.fr/inria-00258384

J. C. Michael, R. Gordon, C. P. Milner, . Wadsworth, and L. Edinburgh, Lecture Notes in Computer Science, vol.78, 1979.

H. Geuvers and M. Niqui, Constructive Reals in Coq: Axioms and Categoricity, Types for Proofs and Programs, International Workshop, TYPES, vol.2277, pp.79-95, 2000.

H. Geuvers and M. Niqui, Bas Spitters, and Freek Wiedijk. Constructive analysis, types and exact real numbers, Mathematical Structures in Computer Science, vol.17, issue.1, pp.3-36, 2007.

A. Guéneau, Procrastination -A proof engineering technique

G. Gonthier, B. Ziliani, A. Nanevski, and D. Dreyer, How to Make Ad Hoc Proof Automation Less Ad Hoc, Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, pp.163-175, 2011.

J. Harrison, Metatheory and Reflection in Theorem Proving: A Survey and Critique, 1995.

J. Harrison, A HOL Theory of Euclidean Space, Hurd and Melham [HM05], pp.114-129

J. Harrison, The HOL Light Theory of Euclidean Space, Journal of Automated Reasoning, vol.50, issue.2, pp.173-190, 2013.

J. Harrison, The HOL Light System REFERENCE, vol.19, 2016.

J. Hölzl, F. Immler, and B. Huffman, Type Classes and Filters for Mathematical Analysis in Isabelle/HOL, Blazy et al. [BPP13], pp.279-294

D. Hilbert, Die logischen Grundlagen der Mathematik, Mathematische Annalen, vol.88, issue.1, pp.151-165, 1922.

R. +-12]-heber-herencia-zapana, S. Jobredeaux, P. Owre, E. Garoche, G. Feron et al., PVS Linear Algebra Libraries for Verification of Control Software Algorithms in C/ACSL, NASA Formal Methods -4th International Symposium, NFM 2012, vol.7226, pp.147-161, 2012.

J. Hurd and T. F. Melham, Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs, vol.3603, 2005.

C. Hoare, An Axiomatic Basis for Computer Programming, Communications of the ACM, vol.12, issue.10, pp.576-580, 1969.

C. Hoare, Proof of Correctness of Data Representations, Acta Informatica, vol.1, pp.271-281, 1972.

W. A. Howard, The formulae-as-types notion of construction, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.479-490, 1980.

F. Haftmann and M. Wenzel, Constructive Type Classes in Isabelle, Types for Proofs and Programs, International Workshop, vol.4502, pp.160-174, 2006.

F. Immler and J. Hölzl, Numerical Analysis of Ordinary Differential Equations in Isabelle/HOL, Beringer and Felty, vol.12, pp.377-392

F. Immler, A Verified ODE Solver and the Lorenz Attractor, Journal of Automated Reasoning, vol.61, issue.1-4, pp.73-111, 2018.

F. Immler and C. Traut, The Flow of ODEs, Interactive Theorem Proving -7th International Conference, vol.9807, pp.184-199, 2016.

. Springer, , 2016.

F. Immler and C. Traut, The Flow of ODEs: Formalization of Variational Equation and Poincaré Map, Journal of Automated Reasoning, vol.62, issue.2, pp.215-236, 2019.

J. and Z. Shao, Certified Programs and Proofs -First International Conference, vol.7086, 2011.

C. Keller, A Matter of Trust: Skeptical Communication Between Coq and External Provers. (Question de confiance : communication sceptique entre Coq et des prouveurs externes), 2013.
URL : https://hal.archives-ouvertes.fr/pastel-00838322

K. Hassan and . Khalil, Nonlinear Systems. Pearson Education, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01698610

C. Keller and M. Lasson, Parametricity in an Impredicative Sort, 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, vol.16, pp.381-395, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00730913

D. Kästner, X. Leroy, S. Blazy, B. Schommer, M. Schmidt et al., Closing the Gap -The Formally Verified Optimizing Compiler CompCert, SSS'17: Safety-critical Systems Symposium 2017, Developments in System Safety Engineering: Proceedings of the Twentyfifth Safety-critical Systems Symposium, pp.163-180, 2017.

D. E. Knuth, Teach Calculus with Big O. Notices of the AMS, vol.45, pp.687-688, 1998.

R. Krebbers and B. Spitters, Type Classes for Efficient Exact Real Arithmetic in Coq, Logical Methods in Computer Science, vol.9, issue.1, 2011.

C. Keller and B. Werner, Importing HOL Light into Coq, Interactive Theorem Proving, First International Conference, ITP 2010, vol.6172, pp.307-322, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00520604

J. Lagrange, Mécanique Analytique. Courcier, p.1811

P. Lammich, Automatic Data Refinement. Archive of Formal Proofs, 2013.

E. Landau, Handbuch der Lehre von der Verteilung der Primzahlen, 1909.

J. Lasalle, Some Extensions of Liapunov's Second Method, IRE Transactions on Circuit Theory, vol.7, issue.4, pp.520-527, 1960.

J. Lasalle, The Stability of Dynamical Systems, Society for Industrial and Applied Mathematics, 1976.

M. Steven and . Lavalle, Planning algorithms, 2006.

D. Ldf-+-18]-xavier-leroy, A. Doligez, J. Frisch, D. Garrigue, J. Rémy et al., The OCaml system release 4.07 -Documentation and user's manual, 2018.

H. Lebesgue, Leçons sur l'Intégration et la Recherche des Fonctions Primitives. Gauthier-Villars, Imprimeur-Éditeur, 1950.

C. Lelay, Repenser la bibliothèque réelle de Coq : vers une formalisation de l'analyse classique mieux adaptée. (Reinventing Coq's Reals library : toward a more suitable formalization of classical analysis), 2015.

, Lemma 1 Ltd. ProofPower HOL Reference Manual, 2006.

R. David and . Lester, Proceedings of the Second Workshop on Automated Formal Methods, AFM '07, pp.11-20, 2007.

P. Letouzey, Programmation fonctionnelle certifiée : L'extraction de programmes dans l'assistant Coq. (Certified functional programming : Program extraction within Coq proof assistant), 2004.

P. Letouzey, Extraction in Coq: An Overview, Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE, vol.5028, pp.359-369, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00338973

R. Lozano, I. Fantoni, and D. Block, Stabilization of the inverted pendulum around its homoclinic orbit, Systems & Control Letters, vol.40, issue.3, pp.197-204, 2000.

A. Liapounoff, Problème général de la stabilité du mouvement, Annales de la Faculté des sciences de Toulouse : Mathématiques, vol.9, pp.203-474, 1907.

P. Lammich and A. Lochbihler, Automatic Refinement to Efficient Data Structures: A Comparison of Two Approaches, Journal of Automated Reasoning, vol.63, issue.1, pp.53-94, 2019.

C. Lelay and G. Melquiond, Différentiabilité et intégrabilité en Coq. Application à la formule de d'Alembert, 23èmes Journées Francophones des Langages Applicatifs, pp.119-133, 2012.

, The Lean Mathematical Components Library Developers. The Lean Mathematical Components Library

M. Maggesi, A Formalization of Metric Spaces in HOL Light, Journal of Automated Reasoning, vol.60, issue.2, pp.237-254, 2018.

. Maplesoft, , 2019.

V. Matrosov, On the Stability of Motion, Journal of Applied Mathematics and Mechanics, vol.26, issue.5, pp.1337-1353, 1962.

M. Mayero, Formalisation et automatisation de preuves en analyses réelle et numérique, 2001.

M. Mayero, Using Theorem Proving for Numerical Analysis (Correctness Proof of an Automatic Differentiation Algorithm), Theorem Proving in Higher Order Logics, 15th International Conference, vol.2410, pp.246-262, 2002.

M. Mayero, Problèmes critiques et preuves formelles. Habilitation à diriger des recherches, vol.13, 2012.

S. Mclaughlin, C. Barrett, and Y. Ge, Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite. Electronic Notes in Theoretical, Computer Science, vol.144, issue.2, pp.43-51, 2006.

S. Mitra and K. Chandy, A Formalized Theory for Verifying Stability and Convergence of Automata in PVS, pp.230-245

, The Mathematical Components Team. The Mathematical Components Library

J. and R. A. García, An extension of LaSalle's invariance principle for switched systems, Systems & Control Letters, vol.55, issue.5, pp.376-384, 2006.

R. Milner, The Use of Machines to Assist in Rigorous Proof, Proceedings Of a Discussion Meeting of the Royal Society of London on Mathematical Logic and Programming Languages, pp.77-88, 1985.

R. M. Murray, Z. Li, and S. Sastry, secrétaires perpétuels. Comptes rendus hebdomadaires des séances de l'Académie des sciences, vol.205, 1937.

, Theorem Proving in Higher Order Logics, 21st International Conference, vol.5170, 2008.

J. and D. Monk, Graduate Texts in Mathematics, 1976.

J. , M. Madiot, and P. Pédrot, Constructive axiomatic for the real numbers, 2011.

E. Mullen, S. Pernsteiner, J. R. Wilcox, Z. Tatlock, and D. Grossman, OEuf: minimizing the Coq extraction TCB, Andronick and Felty [AF18], pp.172-185

Q. Ma and J. C. Reynolds, Types, Abstractions, and Parametric Polymorphism, Part 2, Mathematical Foundations of Programming Semantics, 7th International Conference, vol.598, pp.1-40, 1991.

É. Martin, -. Dorel, and P. Roux, A reflexive tactic for polynomial positivity using numerical solvers and floating-point computations, Bertot and Vafeiadis, vol.17, pp.90-99
URL : https://hal.archives-ouvertes.fr/hal-01510979

G. Malecha, D. Ricketts, M. M. Alvarez, and S. Lerner, Towards Foundational Verification of Cyber-Physical Systems, 2016 Science of Security for Cyber-Physical Systems Workshop, SOSCYPS@CPSWeek, pp.1-5, 2016.

E. Makarov and B. Spitters, The Picard Algorithm for Ordinary Differential Equations in Coq, vol.13, pp.463-468

A. Mahboubi and E. Tassi, Canonical Structures for the Working Coq User, Blazy et al. [BPP13], pp.19-34
URL : https://hal.archives-ouvertes.fr/hal-00816703

A. Mahboubi and E. Tassi, With contributions by Yves Bertot and Georges Gonthier, 2018.

I. Newton, Philosophiae Naturalis Principia Mathematica. Londini, Jussu Societatis Regiae ac Typis Josephi Streater. Prostat apud plures Bibliopolas, p.1687

A. Naumowicz and A. Korni?owicz, A Brief Overview of Mizar, Berghofer et al. [BNUW09], pp.67-72

T. Nipkow, L. C. Paulson, and M. Wenzel, Isabelle/HOL -A Proof Assistant for Higher-Order Logic, Lecture Notes in Computer Science, vol.2283, 2002.

S. Owre, J. M. Rushby, and N. Shankar, PVS: A Prototype Verification System, 11th International Conference on Automated Deduction, vol.607, pp.748-752, 1992.

I. Pa?ca, A Formal Verification for Kantorovitch's Theorem, Journées Francophones des Langages Applicatifs, 2008.

I. Pa?ca, Formal proofs for theoretical properties of Newton's method. Mathematical Structures in Computer Science, vol.21, pp.683-714, 2011.

B. Padlewska and A. Darmochwa?, Topological Spaces and Continuous Functions. Formalized Mathematics, vol.1, issue.1, pp.223-230, 1990.

L. Petzold, Differential/Algebraic Equations are not ODE's, SIAM Journal on Scientific and Statistical Computing, vol.3, issue.3, pp.367-384, 1982.

L. Pottier, Connecting Gröbner Bases Programs with Coq to do Proofs in Algebra, Geometry and Arithmetics, Proceedings of the LPAR 2008 Workshops, Knowledge Exchange: Automated Provers and Proof Assistants, and the 7th International Workshop on the Implementation of Logics, vol.418, 2008.

A. Platzer and J. Quesel, KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description), Automated Reasoning, 4th International Joint Conference, vol.5195, pp.171-178, 2008.

L. Pottier and L. Théry, gbcoq: Certified Gröbner bases computations, 1998.

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

J. C. Reynolds, Polymorphism is not Set-Theoretic, Semantics of Data Types, International Symposium, vol.173, pp.145-156, 1984.
URL : https://hal.archives-ouvertes.fr/inria-00076261

D. Rouhling, A Formal Proof in Coq of a Control Function for the Inverted Pendulum, Andronick and Felty [AF18], pp.28-41
URL : https://hal.archives-ouvertes.fr/hal-01639819

. Rtca-inc, DO-178C, Software Considerations in Airborne Systems and Equipment Certification, 2011.

A. Saibi, Generic tools of Modelisation and Demonstration. Application to Category Theory. Theses, 1999.
URL : https://hal.archives-ouvertes.fr/tel-00523810

D. Schepler, coq-topology: Topology Library for Coq

D. Schepler, coq-zorns-lemma: Set Theory Library for Coq

, The Sage Developers. SageMath, the Sage Mathematics Software System, 2019.

C. Simpson, Computer Theorem Proving in Mathematics. Letters in Mathematical Physics, vol.69, issue.1, pp.287-315, 2004.

B. Skorulski, The Tichonov Theorem. Formalized Mathematics, vol.9, issue.2, pp.373-376, 2001.

N. Shiroma, O. Matsumoto, S. Kajita, and K. Tani, Cooperative Behavior of a Wheeled Inverted Pendulum for Object Transportation, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems. IROS 1996, pp.396-401, 1996.

K. Slind and M. Norrish, A Brief Overview of HOL4, pp.28-32

T. Sugihara, Y. Nakamura, and H. Inoue, Realtime Humanoid Motion Generation through ZMP Manipulation Based on Inverted Pendulum Control, Proceedings of the 2002 IEEE International Conference on Robotics and Automation, ICRA 2002, pp.1404-1409, 2002.

N. Shankar and S. Owre, Principles and Pragmatics of Subtyping in PVS, Recent Trends in Algebraic Development Techniques, 14th International Workshop, WADT '99, Château de Bonas, vol.1827, pp.37-52, 1999.

M. Sozeau and N. Oury, First-Class Type Classes, pp.278-293
URL : https://hal.archives-ouvertes.fr/inria-00628864

G. Scarciotti, L. Praly, and A. Astolfi, Invariance-Like Theorems and "lim inf" Convergence Properties, IEEE Transactions on Automatic Control, vol.61, issue.3, pp.648-661, 2016.

, Coq Workshop, 2018.

P. Strub, multinomials: Multinomials for Ssreflect

B. Spitters and E. Van-der-weegen, Type classes for mathematics in type theory, Mathematical Structures in Computer Science, vol.21, issue.4, pp.795-825, 2011.

C. The and . Team, The COQTAIL Library

L. Théry, grobner: A formalisation of Gröbner basis in ssreflect

L. Théry, A Machine-Checked Implementation of Buchberger's Algorithm, Journal of Automated Reasoning, vol.26, issue.2, pp.107-137, 2001.

A. Timany and M. Sozeau, Consistency of the Predicative Calculus of Cumulative Inductive Constructions (pCuIC), 2017.
URL : https://hal.archives-ouvertes.fr/hal-01615123

N. Tabareau, É. Tanter, and M. Sozeau, Equivalences for Free: Univalent Parametricity for Effective Transport, Proceedings of the ACM on Programming Languages, vol.2, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01559073

, The Univalent Foundations Program. Homotopy Type Theory: Univalent Foundations of Mathematics, 2013.

P. Wadler, Theorems for Free, Proceedings of the fourth international conference on Functional programming languages and computer architecture, FPCA 1989, pp.347-359, 1989.

I. Weiss, The Reals as Rational Cauchy Filters, New Zealand Journal of Mathematics, vol.46, pp.21-51, 2016.

, The Seventeen Provers of the World, Lecture Notes in Computer Science, vol.3600, 2006.

F. Wiedijk, Pollack-inconsistency. Electronic Notes in Theoretical Computer Science, vol.285, pp.85-100, 2012.

A. Wilansky, Topology for Analysis. Dover books on mathematics, 2008.

N. Wirth, Program Development by Stepwise Refinement, Communications of the ACM, vol.14, issue.4, pp.221-227, 1971.