N. Agmon and D. Peleg, Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots, SIAM Journal on Computing, vol.36, issue.1, pp.56-82, 2006.
DOI : 10.1137/050645221

J. Bacelar-almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn et al., Full proof cryptography, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, pp.488-500, 2012.
DOI : 10.1145/2382196.2382249

M. Bezem, R. Bol, and J. F. Groote, Formalizing process algebraic verifications in the calculus of constructions, Formal Aspects of Computing, vol.4, issue.3, pp.1-48, 1997.
DOI : 10.1007/BF01212523

F. Bonnet, X. Défago, F. Petit, M. Potop-butucaru, and S. Tixeuil, Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols, Proceedings of the International Conference on Stabilization, Safety, and Security in Distributed Systems, 2012.
DOI : 10.1007/978-3-642-33536-5_28
URL : https://hal.archives-ouvertes.fr/hal-00934186

Z. Bouzid, M. Gradinariu-potop-butucaru, and S. Tixeuil, Optimal byzantineresilient convergence in uni-dimensional robot networks, Theoretical Computer Science, vol.411, pp.34-363154, 2010.

M. Cadilhac, T. Hérault, R. Lassaigne, S. Peyronnet, and S. Tixeuil, Evaluating Complex MAC Protocols for Sensor Networks with APMC, Electronic Notes in Theoretical Computer Science, vol.185, pp.33-46, 2007.
DOI : 10.1016/j.entcs.2007.05.027
URL : https://hal.archives-ouvertes.fr/inria-00089494

D. Cansell and D. Méry, Logics of Specification Languages, chapter The Event-B Modelling Method: Concepts and Case Studies, pp.47-152, 2007.

P. Castéran, V. Filou, and M. Mosbah, Certifying distributed algorithms by embedding local computation systems in the coq proof assistant, Symbolic Computation in Software Science (SCSS'09), 2009.

C. Chou, Mechanical verification of distributed algorithms in higher-order logic, The Computer Journal, vol.38, pp.158-176, 1995.

J. Clément, C. Delporte-gallet, H. Fauconnier, and M. Sighireanu, Guidelines for the Verification of Population Protocols, 2011 31st International Conference on Distributed Computing Systems, pp.215-224, 2011.
DOI : 10.1109/ICDCS.2011.36

T. Coquand and C. Paulin-mohring, Inductively defined types In Per Martin- Löf and Grigori Mints, Proceedings of Colog'88, 1990.

D. Cousineau, D. Doligez, L. Lamport, S. Merz, D. Ricketts et al., TLA???+??? Proofs, Lecture Notes in Computer Science, vol.7436, pp.147-154, 2012.
DOI : 10.1007/978-3-642-32759-9_14
URL : https://hal.archives-ouvertes.fr/hal-00726632

Y. Deng and J. Monin, Verifying Self-stabilizing Population Protocols with Coq, 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering, pp.201-208, 2009.
DOI : 10.1109/TASE.2009.9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.1221

S. Devismes, A. Lamani, F. Petit, P. Raymond, and S. Tixeuil, Optimal Grid Exploration by Asynchronous Oblivious Robots, Proceedings of the International Conference on Stabilization, Safety, and Security in Distributed Systems, 2012.
DOI : 10.1007/978-3-642-33536-5_7
URL : https://hal.archives-ouvertes.fr/hal-00934161

S. Dubois and S. Tixeuil, A taxonomy of daemons in self-stabilization, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00628390

M. J. Fischer, N. A. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/3149.214121

P. Flocchini, G. Prencipe, and N. Santoro, Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, 2012.
DOI : 10.2200/s00440ed1v01y201208dct010

W. Fokkink, Modelling Distributed Systems. EATCS Texts in Theoretical Computer Science, 2007.

G. Gonthier, Formal proof?the four-color theorem, Notices of the AMS, p.1370, 2008.

G. Gonthier, Engineering mathematics: the odd order theorem proof, POPL, pp.1-2, 2013.
DOI : 10.1145/2429069.2429071

P. Küfner, U. Nestmann, and C. Rickmann, Formal Verification of Distributed Algorithms, IFIP TCS, pp.209-224, 2012.
DOI : 10.1007/978-3-642-33475-7_15

L. Lamport, Byzantizing Paxos by Refinement, Lecture Notes in Computer Science, vol.19, issue.2, pp.211-224, 2011.
DOI : 10.1007/978-3-642-03466-4_2

L. Lamport, R. Shostak, and M. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176

X. Leroy, A Formally Verified Compiler Back-end, Journal of Automated Reasoning, vol.27, issue.1, pp.363-446, 2009.
DOI : 10.1007/s10817-009-9155-4
URL : https://hal.archives-ouvertes.fr/inria-00360768

I. Litovsky, Y. Métivier, and É. Sopena, GRAPH RELABELLING SYSTEMS AND DISTRIBUTED ALGORITHMS, Handbook of Graph Grammars and Computing by Graph Transformation, pp.1-56, 1999.
DOI : 10.1142/9789812814951_0001
URL : https://hal.archives-ouvertes.fr/hal-00307042

J. Mccarthy and J. Painter, Correctness of a compiler for arithmetic expressions, Proceedings of Applied Mathematica, pp.33-41, 1967.
DOI : 10.1090/psapm/019/0242403

C. Marshall, R. E. Pease, L. Shostak, and . Lamport, Reaching agreement in the presence of faults, J. ACM, vol.27, issue.2, pp.228-234, 1980.

I. Suzuki and M. Yamashita, Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.28, issue.4, pp.1347-1363, 1999.
DOI : 10.1137/S009753979628292X

L. Théry and G. Hanrot, Primality Proving with Elliptic Curves, 20th International Conference on Theorem Proving in Higher Order Logics, pp.319-333, 2007.
DOI : 10.1007/978-3-540-74591-4_24