P. A. Abdulla, A. Collomb-annichini, A. Bouajjani, and B. Jonsson, Using Forward Reachability Analysis for Verification of Lossy Channel Systems, Formal Methods in System Design, vol.25, issue.1, pp.39-65, 2004.
DOI : 10.1023/B:FORM.0000033962.51898.1a

Y. Afek, E. Gafni, D. Frey, M. Raynal, S. Sarkar et al., Asynchrony from Synchrony, Distributed Computing and Networking, 14th International Conference. Proceedings, pp.225-239, 2013.
DOI : 10.1007/978-3-642-35668-1_16

S. F. Allen, R. L. Constable, R. Eaton, C. Kreitz, and L. Lorigo, The Nuprl Open Logical Environment, Automated Deduction -CADE-17, 17th International Conference on Automated Deduction Proceedings, pp.170-176, 2000.
DOI : 10.1007/10721959_12

P. Alvaro, T. Condie, N. Conway, J. M. Hellerstein, and R. Sears, I do declare, ACM SIGOPS Operating Systems Review, vol.43, issue.4, pp.25-30, 2009.
DOI : 10.1145/1713254.1713261

P. Alvaro, N. Conway, J. Hellerstein, and W. R. Marczak, Consistency analysis in bloom: a CALM and collected approach, CIDR 2011 Fifth Biennial Conference on Innovative Data Systems Research Online Proceedings, pp.249-260, 2011.

Y. Amir and J. Kirsch, Paxos for system builders: An overview, Workshop on Large-Scale Distributed Systems and Middleware, 2008.

K. R. Apt and D. Kozen, Limits for automatic verification of finite-state concurrent systems, Information Processing Letters, vol.22, issue.6, pp.307-309, 1986.
DOI : 10.1016/0020-0190(86)90071-2

J. L. Armstrong, The development of erlang, Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), pp.196-203, 1997.

M. P. Ashley-rollman, P. Lee, S. C. Goldstein, P. Pillai, and J. Campbell, A Language for Large Ensembles of Independently Executing Nodes, Logic Programming, 25th International Conference. Proceedings, pp.265-280, 2009.
DOI : 10.1007/3-540-57530-8_13

S. Basu, T. Bultan, and M. Ouederni, Synchronizability for Verification of Asynchronously Communicating Systems, Verification, Model Checking, and Abstract Interpretation -13th International Conference, VMCAI 2012. Proceedings, pp.56-71, 2012.
DOI : 10.1007/978-3-540-78800-3_21

M. Ben-or, Another advantage of free choice (Extended Abstract), Proceedings of the second annual ACM symposium on Principles of distributed computing , PODC '83, pp.27-30, 1983.
DOI : 10.1145/800221.806707

M. Biely, B. Charron-bost, A. Gaillard, M. Hutle, A. Schiper 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

M. Biely, Z. Milosevic, N. Santos, and A. Schiper, S-Paxos: Offloading the Leader for High Throughput State Machine Replication, 2012 IEEE 31st Symposium on Reliable Distributed Systems, pp.111-120, 2012.
DOI : 10.1109/SRDS.2012.66

M. Biely, P. Delgado, Z. Milosevic, and A. Schiper, Distal: A framework for implementing fault-tolerant distributed algorithms, 2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), pp.1-8, 2013.
DOI : 10.1109/DSN.2013.6575306

D. Brand and P. Zafiropulo, On Communicating Finite-State Machines, Journal of the ACM, vol.30, issue.2, pp.323-342, 1983.
DOI : 10.1145/322374.322380

M. Burrows, The chubby lock service for loosely-coupled distributed systems, OSDI

C. Cachin, R. Guerraoui, and L. Rodrigues, Reliable Broadcast, Introduction to Reliable and Secure Distributed Programming, pp.73-135, 2011.
DOI : 10.1007/978-3-642-15260-3_3

T. D. Chandra and S. Toueg, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996.
DOI : 10.1145/226643.226647

T. D. Chandra, R. Griesemer, and J. Redstone, Paxos made live, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.398-407, 2007.
DOI : 10.1145/1281100.1281103

M. Chaouch-saad, B. Charron-bost, and S. Merz, A Reduction Theorem for the Verification of Round-Based Distributed Algorithms, RP, 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, Int. J. Software and Informatics, vol.3, issue.2-3, pp.273-303, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00426388

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

B. Charron-bost, H. Debrat, and S. Merz, Formal Verification of Consensus Algorithms Tolerating Malicious Faults, SSS, pp.120-134, 2011.
DOI : 10.1007/978-3-642-24550-3_11
URL : https://hal.archives-ouvertes.fr/hal-00639048

S. Chaudhuri, More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993.
DOI : 10.1006/inco.1993.1043

H. Debrat and S. Merz, Verifying fault-tolerant distributed algorithms in the heard-of model. Archive of Formal Proofs, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00760686

A. Desai, P. Garg, and P. Madhusudan, Natural proofs for asynchronous programs using almost-synchronous reductions, Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA 2014, pp.709-725, 2014.

E. D. Osualdo, J. Kochems, and C. L. Ong, Automatic verification of erlang-style concurrency, Static Analysis -20th International Symposium , SAS 2013 Proceedings, pp.454-476, 2013.

C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, A Logic-Based Framework for Verifying Consensus Algorithms, pp.161-181, 2014.
DOI : 10.1007/978-3-642-54013-4_10

C. Dwork, N. Lynch, and L. Stockmeyer, Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988.
DOI : 10.1145/42282.42283

T. Elrad, N. Francez, J. M. Falerio, S. K. Rajamani, K. Rajan et al., Decomposition of distributed programs into communication-closed layers, ACM Symposium on Principles of Distributed Computing, PODC '12, pp.155-173, 1982.
DOI : 10.1016/0167-6423(83)90013-8

I. Filipovic, P. W. O-'hearn, N. Rinetzky, and H. Yang, Abstraction for concurrent objects, Theor. Comput. Sci, vol.411, pp.51-524379, 2010.

M. J. Fischer, N. A. Lynch, and M. S. 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

L. Fredlund and H. Svensson, Mcerlang: a model checker for a distributed functional programming language, Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, pp.125-136, 2007.

E. Gafni, Round-by-round fault detectors (extended abstract), Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.143-152, 1998.
DOI : 10.1145/277697.277724

J. Gray, Notes on data base operating systems, Operating Systems, pp.393-481, 1978.
DOI : 10.1007/3-540-08755-9_9

R. Guerraoui and L. Rodrigues, Introduction to Reliable Distributed Programming, 2006.

P. Haller and M. Odersky, Scala Actors: Unifying thread-based and event-based programming, Theoretical Computer Science, vol.410, issue.2-3, pp.202-220, 2009.
DOI : 10.1016/j.tcs.2008.09.019

C. Hewitt, P. Bishop, and R. Steiger, A universal modular ACTOR formalism for artificial intelligence, Proceedings of the 3rd International Joint Conference on Artificial Intelligence, pp.235-245, 1973.

C. A. Hoare, Communicating sequential processes, Communications of the ACM, vol.21, issue.8, pp.666-677, 1978.
DOI : 10.1145/359576.359585

A. John, I. Konnov, U. Schmid, H. Veith, and J. Widder, Parameterized model checking of fault-tolerant distributed algorithms by abstraction, 2013 Formal Methods in Computer-Aided Design, pp.201-209, 2013.
DOI : 10.1109/FMCAD.2013.6679411

F. P. Junqueira, B. C. Reed, and M. Serafini, Zab: High-performance broadcast for primary-backup systems, 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN), pp.245-256, 2011.
DOI : 10.1109/DSN.2011.5958223

C. E. Killian, J. W. Anderson, R. Braud, R. Jhala, and A. Vahdat, Mace: language support for building distributed systems, SIGPLAN Conference on Programming Language Design and Implementation, pp.179-188, 2007.

A. D. Kshemkalyani and M. Singhal, Distributed Computing: Principles , Algorithms, and Systems, 2011.
DOI : 10.1017/CBO9780511805318

L. Lamport, The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998.
DOI : 10.1145/279227.279229

L. Lamport, Distributed algorithms in TLA (abstract), Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing , PODC '00, 2000.
DOI : 10.1145/343477.343497

L. Lamport, The PlusCal Algorithm Language, Theoretical Aspects of Computing -ICTAC 2009, 6th International Colloquium Proceedings, pp.36-60, 2009.
DOI : 10.1007/978-3-642-03466-4_2

Y. A. Liu, S. D. Stoller, B. Lin, and M. Gorbovitski, From clarity to efficiency for distributed algorithms, Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2012, part of SPLASH 2012, pp.395-410, 2012.

N. Lynch, Distributed Algorithms, 1996.

N. A. Lynch and M. R. Tuttle, Hierarchical correctness proofs for distributed algorithms, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing , PODC '87, pp.137-151, 1987.
DOI : 10.1145/41840.41852

Y. Mao, F. P. Junqueira, and K. Marzullo, Mencius: Building efficient replicated state machine for wans, 8th USENIX Symposium on Operating Systems Design and Implementation, pp.369-384, 2008.

O. Mari´cmari´c, C. Sprenger, and D. Basin, Consensus refined, IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2015.

V. R. Mark, R. L. Bickford, and . Constable, Logic of events, a framework to reason about distributed systems, 2012 Languages for Distributed Algorithms Workshop

H. Miller, P. Haller, E. Burmako, and M. Odersky, Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization, OOPSLA, pp.183-202, 2013.

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, I, Information and Computation, vol.100, issue.1, pp.1-40, 1992.
DOI : 10.1016/0890-5401(92)90008-4

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, II, Information and Computation, vol.100, issue.1, pp.41-77, 1992.
DOI : 10.1016/0890-5401(92)90009-5

I. Moraru, D. G. Andersen, and M. Kaminsky, There is more consensus in Egalitarian parliaments, Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP '13, pp.358-372
DOI : 10.1145/2517349.2517350

L. Moura and N. Bjorner, Z3: An Efficient SMT Solver, Lecture Notes in Computer Science, vol.4963, pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24

P. Parvedy, M. Raynal, and C. Travers, Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes, Parallel Computing Technologies, pp.49-58, 2005.
DOI : 10.1007/11535294_5

N. Santoro and P. Widmayer, Agreement in synchronous networks with ubiquitous faults, Theoretical Computer Science, vol.384, issue.2-3, pp.232-249, 2007.
DOI : 10.1016/j.tcs.2007.04.036

N. Schiper, V. Rahli, R. Van-renesse, M. Bickford, and R. L. Constable, Developing Correctly Replicated Databases Using Formal Tools, 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, pp.395-406, 2014.
DOI : 10.1109/DSN.2014.45

P. Schnoebelen, Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets, MFCS, pp.616-628, 2010.
DOI : 10.1007/978-3-642-15155-2_54

T. Tsuchiya and A. Schiper, Model checking of consensus algorithms, SRDS, pp.137-148, 2007.

T. Tsuchiya and A. Schiper, Using Bounded Model Checking to Verify Consensus Algorithms, DISC, pp.466-480, 2008.
DOI : 10.1007/978-3-540-87779-0_32

T. Tsuchiya and A. Schiper, Verification of consensus algorithms using satisfiability solving, Distributed Computing, pp.341-358, 2011.
DOI : 10.1007/s00446-010-0123-3

J. Widder and U. Schmid, The Theta-Model: achieving synchrony without clocks, Distributed Computing, pp.29-47, 2009.
DOI : 10.1007/s00446-009-0080-x

J. R. Wilcox, D. Woos, P. Panchekha, Z. Tatlock, X. Wang et al., Verdi: a framework for implementing and formally verifying distributed systems, Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.357-368, 2015.