L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

T. Elrad and N. Francez, Decomposition of distributed programs into communication-closed layers, Science of Computer Programming, vol.2, issue.3, pp.155-173, 1982.
DOI : 10.1016/0167-6423(83)90013-8

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

B. Charron-bost and A. Schiper, The Heard-Of model: computing in distributed systems with benign faults, Distributed Computing, pp.49-71, 2009.
DOI : 10.1007/s00446-009-0084-6

M. Chaouch-saad, B. Charron-bost, and S. Merz, A Reduction Theorem for the Verification of Round-Based Distributed Algorithms, Lecture Notes in Computer Science, vol.63, issue.5, pp.93-106, 2009.
DOI : 10.1007/3-540-48153-2_6

URL : https://hal.archives-ouvertes.fr/inria-00408908

B. Charron-bost and S. Merz, Formal verification of a Consensus algorithm in the Heard-Of model, Intl. J. Software and Informatics, vol.3, issue.2-3, pp.273-204, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00426388

M. Jaskelioff and S. Merz, Proving the correctness of Disk Paxos Archive of Formal Proofs, 2005.

M. Biely, J. Widder, B. Charron-bost, A. Gaillard, M. Hutle et al., Tolerating corrupted communication, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.244-253, 2007.
DOI : 10.1145/1281100.1281136

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=