B. Aminof, S. Rubin, I. Stoilkovska, J. Widder, and F. Zuleger, Parameterized model checking of synchronous distributed algorithms by abstraction, VMCAI. pp, pp.1-24, 2018.

A. Bakst, K. Von-gleissenthall, R. G. Kici, and R. Jhala, Verifying distributed programs via canonical sequentialization, PACMPL 1(OOPSLA), vol.110, p.27, 2017.

E. Bendersky, , 2018.

M. Biely, B. Charron-bost, A. Gaillard, M. Hutle, A. Schiper et al., Tolerating corrupted communication, PODC. pp, pp.244-253, 2007.

A. Bouajjani, C. Enea, K. Ji, and S. Qadeer, On the completeness of verifying message passing programs under bounded asynchrony, CAV. pp, pp.372-391, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01947855

T. D. Chandra, R. Griesemer, and J. Redstone, Paxos made live: An engineering perspective, PODC. pp, pp.398-407, 2007.

T. D. Chandra and S. Toueg, Unreliable failure detectors for reliable distributed systems, J. ACM, vol.43, issue.2, pp.225-267, 1996.

M. Chaouch-saad, B. Charron-bost, and S. Merz, A reduction theorem for the verification of round-based distributed algorithms, RP. LNCS, vol.5797, pp.93-106, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00408908

B. Charron-bost, H. Debrat, and S. Merz, Formal verification of consensus algorithms tolerating malicious faults, SSS, pp.120-134, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00639048

B. Charron-bost and A. Schiper, The heard-of model: computing in distributed systems with benign faults, Distributed Computing, vol.22, issue.1, pp.49-71, 2009.

C. Chou and E. Gafni, Understanding and verifying distributed algorithms using stratified decomposition, PODC. pp, pp.44-65, 1988.

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

C. Dr?goi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, A logic-based framework for verifying consensus algorithms, VMCAI. pp, pp.161-181, 2014.

C. Dr?goi, T. A. Henzinger, and D. Zufferey, , vol.12, 2018.

C. Dr?goi, T. A. Henzinger, and D. Zufferey, Psync: a partially synchronous language for fault-tolerant distributed algorithms, POPL. pp, pp.400-415, 2016.

C. Dwork, N. Lynch, and L. Stockmeyer, Consensus in the presence of partial synchrony, JACM, vol.35, issue.2, pp.288-323, 1988.

T. Elrad and N. Francez, Decomposition of distributed programs into communicationclosed layers, Sci. Comput. Program, vol.2, issue.3, pp.155-173, 1982.

K. Engelhardt and Y. Moses, Safe composition of distributed programs communicating over order-preserving imperfect channels, IWDC. pp, pp.32-44, 2005.

E. Gafni, Round-by-round fault detectors: Unifying synchrony and asynchrony (extended abstract). In: PODC, pp.143-152, 1998.

K. Gleissenthall, N. Bjørner, and A. Rybalchenko, Cardinalities and Universal Quantifiers for Verifying Parameterized Systems, PLDI. pp, pp.599-613, 2016.

K. Gleissenthall, R. Gökhan-kici, A. Bakst, D. Stefan, and R. Jhala, Pretend synchrony, p.POPL, 2019.

C. Hawblitzel, J. Howell, M. Kapritsos, J. R. Lorch, B. Parno et al., Ironfleet: proving safety and liveness of practical distributed systems, Commun. ACM, vol.60, issue.7, pp.83-92, 2017.

B. Jacobs, J. Smans, and F. Piessens, A quick tour of the VeriFast program verifier, APLAS. LNCS, vol.6461, pp.304-311, 2010.

, Jepsen: Distributed systems safety research. Web page jepsen.io, 2018.

I. V. Konnov, M. Lazic, H. Veith, and J. Widder, A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms, POPL. pp, pp.719-734, 2017.

B. Kragl, S. Qadeer, and T. A. Henzinger, Synchronizing the asynchronous, In: CONCUR. pp, vol.21, p.17, 2018.

L. Lamport, Generalized consensus and paxos, 2005.

G. Le-lann, Asynchrony and real-time dependable computing, WORDS. pp, pp.18-25, 2003.

R. J. Lipton, Reduction: A method of proving properties of parallel programs, Commun. ACM, vol.18, issue.12, pp.717-721, 1975.

N. Lynch, Distributed Algorithms, 1996.

O. Mari?, C. Sprenger, and D. A. Basin, Cutoff Bounds for Consensus Algorithms, CAV. pp, pp.217-237, 2017.

F. Mattern, On the relativistic structure of logical time in distributed systems. Parallel and Distributed Algorithms pp, pp.215-226, 1989.

I. Moraru, D. G. Andersen, and M. Kaminsky, There is more consensus in egalitarian parliaments, SOSP. pp, pp.358-372, 2013.

Y. Moses and S. Rajsbaum, A layered analysis of consensus, SIAM J. Comput, vol.31, issue.4, pp.989-1021, 2002.

B. M. Oki and B. Liskov, Viewstamped replication: A general primary copy, pp.8-17, 1988.

D. Ongaro and J. K. Ousterhout, In search of an understandable consensus algorithm, 2014 USENIX Annual Technical Conference, USENIX ATC '14, pp.305-319, 2014.

O. Padon, K. L. Mcmillan, A. Panda, M. Sagiv, and S. Shoham, Ivy: safety verification by interactive generalization, PLDI. pp, pp.614-630, 2016.

R. Van-renesse, N. Schiper, and F. B. Schneider, Vive la différence: Paxos vs. viewstamped replication vs. zab, IEEE Trans. Dependable Sec. Comput, vol.12, issue.4, pp.472-484, 2015.

N. Santoro and P. Widmayer, Time is not a healer, STACS. LNCS, vol.349, pp.304-313, 1989.

I. Sergey, J. R. Wilcox, and Z. Tatlock, Programming and proving with distributed protocols, PACMPL 2(POPL), vol.28, p.30, 2018.

A. Shimi, A. Hurault, and P. Queinnec, Characterizing asynchronous message-passing models through rounds, OPODIS, 2018.

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

T. Tsuchiya and A. Schiper, Using bounded model checking to verify consensus algorithms, DISC. pp, pp.466-480, 2008.

T. Tsuchiya and A. Schiper, Verification of consensus algorithms using satisfiability solving, Distributed Computing, vol.23, issue.5-6, pp.341-358, 2011.

J. R. Wilcox, D. Woos, P. Panchekha, Z. Tatlock, X. Wang et al., Verdi: a framework for implementing and formally verifying distributed systems, pp.357-368, 2015.