E. Alkassar, S. Böhme, K. Mehlhorn, and C. Rizkallah, Verification of Certifying Computations, Computer Aided Verification, pp.67-82, 2011.
DOI : 10.1007/978-3-642-03359-9_31

E. Alkassar, S. Böhme, K. Mehlhorn, and C. Rizkallah, A Framework for the Verification of Certifying Computations, Journal of Automated Reasoning, vol.5, issue.2, pp.241-273, 2014.
DOI : 10.1007/978-3-642-03359-9_31

K. Arkoudas and M. C. Rinard, Deductive Runtime Certification, Electronic Notes in Theoretical Computer Science, vol.113, pp.45-63, 2005.
DOI : 10.1016/j.entcs.2004.01.035

D. Bruce, C. T. Hoang, and J. Sawada, A certifying algorithm for 3-colorability of P5-free graphs, The 20th International Symposium on Algorithms and Computation, 2009.

K. Censor-hillel, E. Fischer, G. Schwartzman, and Y. Vasudev, Fast distributed algorithms for testing graph properties, Distributed Computing, pp.43-56, 2016.

D. G. Corneil, B. Dalton, and M. Habib, LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs, SIAM Journal on Computing, vol.42, issue.3, pp.792-807, 2013.
DOI : 10.1137/11083856X
URL : https://hal.archives-ouvertes.fr/hal-00936300

S. Dolev, Self Stabilization, Journal of Aerospace Computing, Information, and Communication, vol.1, issue.6, 2000.
DOI : 10.1038/scientificamerican0603-54
URL : https://hal.archives-ouvertes.fr/inria-00627780

J. Duprat, A Coq toolkit for graph theory, 2001.

U. Finkler and K. Mehlhorn, Checking Priority Queues, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 901?902. SODA '99, 1999.

S. Glesner, Program Checking with Certificates: Separating Correctness-Critical Code, FME 2003: Formal Methods, pp.758-777, 2003.
DOI : 10.1007/978-3-540-45236-2_41

P. Heggernes and D. Kratsch, Linear-time Certifying Recognition Algorithms and Forbidden Induced Subgraphs, Nordic Journal of Computing, vol.14, issue.1, pp.87-108, 2007.

P. Hell and J. Huang, Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs, SIAM Journal on Discrete Mathematics, vol.18, issue.3, pp.554-570
DOI : 10.1137/S0895480103430259

R. W. Hung and M. S. Chang, An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs, Theoretical Computer Science, vol.412, issue.39, pp.5351-5373, 2011.
DOI : 10.1016/j.tcs.2011.06.009

, INRIA: The Coq Proof Assistant

H. Kaplan and Y. Nussbaum, Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs, Discrete Applied Mathematics, vol.157, issue.15, pp.3216-3230, 2009.
DOI : 10.1016/j.dam.2009.07.002

A. Korman, S. Kutten, and D. Peleg, Proof labeling schemes, Distributed Computing, vol.34, issue.2, pp.215-233, 2010.
DOI : 10.1007/s00446-010-0095-3

N. A. Lynch, Distributed Algorithms, 1996.

R. M. Mcconnell, A Certifying Algorithm for the Consecutive-ones Property, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.768-777, 2004.

R. M. Mcconnell, K. Mehlhorn, S. Näher, and P. Schweitzer, Certifying algorithms, Computer Science Review, vol.5, issue.2, pp.119-161, 2011.
DOI : 10.1016/j.cosrev.2010.09.009

K. Mehlhorn and S. Näher, From algorithms to working programs: On the use of program checking in LEDA, Lecture Notes in Computer Science, vol.1450, pp.84-93, 1998.
DOI : 10.1007/BFb0055759

M. Mostafa and B. Bonakdarpour, Decentralized Runtime Verification of LTL Specifications in Distributed Systems, 2015 IEEE International Parallel and Distributed Processing Symposium, 2015.
DOI : 10.1109/IPDPS.2015.95

G. C. Necula and P. Lee, The Design and Implementation of a Certifying Compiler, Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation. pp. 333?344. PLDI '98, 1998.
DOI : 10.1145/989393.989454
URL : http://pag.csail.mit.edu/~mernst/teaching/6.893/readings/necula-pldi98.pdf

S. D. Nikolopoulos and L. Palios, An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs, Theor. Comput. Sci, vol.452, pp.117-131, 2012.
DOI : 10.1007/978-3-540-73814-5_27
URL : http://www.cs.uoi.gr/~stavros/Papers/C-FAW07.pdf

L. Noschinski, C. Rizkallah, and K. Mehlhorn, Verification of Certifying Computations through AutoCorres and Simpl, NASA Formal Methods, pp.46-61, 2014.
DOI : 10.1007/978-3-319-06200-6_4

M. Raynal, Distributed Algorithms for Message-Passing Systems, 2013.
DOI : 10.1007/978-3-642-38123-2
URL : https://hal.archives-ouvertes.fr/hal-00922219

C. Rizkallah, Verification of Program Computations, 2015.

J. M. Schmidt, Construction Sequences and Certifying 3-connectivity, Algorithmica, vol.13, issue.3, pp.192-208, 2012.
DOI : 10.1080/03081088308817512
URL : http://www.mpi-inf.mpg.de/~jeschmid/public/Schmidt2012.pdf

K. Völlinger, Verifying the Output of a Distributed Algorithm Using Certification, Runtime Verification -17th International Conference , RV 2017, pp.424-430, 2017.
DOI : 10.1007/978-3-319-22969-0_14

K. Völlinger and S. Akili, Verifying a Class of Certifying Distributed Programs, NASA Formal Methods -9th International Symposium, NFM 2017, pp.373-388, 2017.
DOI : 10.1007/978-3-319-22969-0_14

K. Völlinger and W. Reisig, Certification of Distributed Algorithms Solving Problems with Optimal Substructure, Software Engineering and Formal Methods -13th International Conference, pp.190-195, 2015.
DOI : 10.1007/978-3-319-22969-0_14

J. R. Wilcox, D. Woos, P. Panchekha, Z. Tatlock, X. Wang et al., Verdi: a framework for implementing and formally verifying distributed systems, ACM SIGPLAN Notices, vol.50, issue.6, pp.357-368, 2015.
DOI : 10.1145/2185376.2185383
URL : http://dl.acm.org/ft_gateway.cfm?id=2737958&type=pdf