M. Moneghetti and F. Collège-de, 40 leçons inaugurales

P. Mounier-kuhn and L. , Informatique en France de la Seconde Guerre mondiale au Plan Calcul

P. L'émergence-d'une-science, , 2010.

E. Lazard and P. Mounier-kuhn, Histoire illustrée de l'informatique, 2016.

L. F. Menabrea and A. A. Lovelace, Sketch of the analytical engine invented by Charles Babbage, 1842.

E. Lazard and P. Mounier-kuhn,

G. Berry, L. 'hyperpuissance-de-l'informatique, P. , and O. Jacob, , 2017.

G. Dowek, L. Paris, and . Pommier, Le logiciel, entre l'esprit et la matière Le logiciel, entre l'esprit et la matière, 2007.

G. W. Leibniz, Nova Methodus pro Maximis et Minimis, in : Acta Eruditorum, 1684.

M. Davis, The Universal Computer: The Road from Leibniz to Turing, 2012.

. Ibid, , pp.2-4

G. Dowek,

, Composé d'axiomes (par exemple « n + 0 = n pour tout n ») et de règles de déduction (par exemple le modus ponens, « de P ? Q et de P je peux déduire Q »)

M. Davis, The Universal Computer, op. cit., chap. 5

K. Gödel, From Frege to Gödel: A Source Book in Mathematical Logic, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme », I. Monatshefte für Mathematik und Physik, vol.38, pp.1879-1931, 1931.

A. Church, « A note on the Entscheidungsproblem », Journal of Symbolic Logic, vol.1, issue.1, pp.40-41, 1936.

A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, vol.42, pp.230-265, 1937.

I. L. Markov, Limits on fundamental limits to computation, vol.512, pp.147-154, 2014.

P. Van-roy and S. Haridi, Programmation. Concepts, techniques et modèles, 2007.

J. Van-de-meent, An Introduction to Probabilistic Programming, Computing Research Repository, 2018.

H. R. Nielson and F. Nielson, Semantics with Applications: An Appetizer, 2007.

B. C. Pierce, Types and Programming Languages, 2002.

H. , Curry et R. Feys, Combinatory Logic, 1958.

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, 1969.

J. Monin, Introduction aux méthodes formelles, 2000.

. Reproduit, L. Dans, C. B. Morris, and . Jones, An early program proof by Alan Turing », Annals of the History of Computing, vol.6, pp.129-143, 1984.

R. W. Floyd, Assigning meaning to programs, Mathematical Aspects of Computer Science (Proceedings of Symposia on Applied Mathematics, vol.19, pp.19-32, 1967.

C. A. Hoare, An axiomatic basis for computer programming, Communications of the ACM, vol.12, issue.10, pp.576-585, 1969.

P. Cousot and R. Cousot, « Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, POPL '77: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pp.238-252, 1977.

E. A. Emerson and E. M. Clarke, Characterizing correctness properties of parallel programs using fixpoints, Automata, Languages and Programming, 7th Colloquium, vol.85

/. Berlin and . Heidelberg, , pp.169-181, 1980.

J. Queille and J. Sifakis, « Specification and verification of concurrent systems in CESAR, International Symposium on Programming

. Colloquium, Lecture Notes in Computer Science, vol.137, pp.337-351, 1982.

D. E. Knuth, The Art of Computer Programming, vol.1, 1997.

. Ibid,

L. Théry, Proving pearl: Knuth's algorithm for prime numbers, Theorem Proving in Higher Order Logics: 16th International Conference, vol.2758, pp.304-318, 2003.

J. Filliâtre, Knuth's prime numbers, Gallery of verified programs

, Pour une analyse de ces prétendues impossibilités, voir A. Asperti, H. Geuvers et R. Natarajan, « Social processes, program verification and all that, Mathematical Structures in Computer Science, vol.19, issue.5, pp.877-896, 2009.

V. Cortier and S. Kremer, « Formal models and techniques for analyzing security protocols: A tutorial », Foundations and Trends in Programming Languages, vol.1, pp.151-267, 2014.

G. Klein, « seL4: Formal verification of an operating-system kernel, Communications of the ACM, vol.53, issue.6, pp.107-115, 2010.

G. Katz, An efficient SMT solver for verifying deep neural networks, Computer Aided Verification: 29th International Conference, CAV 2017, vol.10426, pp.97-117, 2017.

X. Leroy, « Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, pp.107-115, 2009.

J. Jourdan, « A formally-verified C static analyzer, POPL 2015: Proceedings of the 42nd Symposium on Principles of Programming Languages, pp.247-259, 2015.

T. Bourke, « A formally verified compiler for Lustre, PLDI 2017: Proceedings of the 38th Conference on Programming Language Design and Implementation, pp.586-601, 2017.

C. Neil and A. Retardement, Les Arènes, 2018.

C. Maurice, « Après Meltdown et Spectre, comment sécuriser les processeurs ? », Journal du CNRS, 2018.

S. Abiteboul, G. Dowek, L. Paris, and . Pommier, Le logiciel, entre l'esprit et la matière Le logiciel, entre l'esprit et la matière, Le Temps des algorithmes, 2017.