Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt et al., Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993.

J. Anderson, Multi-writer composite registers, Distributed Computing, vol.7, issue.4, pp.175-195, 1994.

G. Bracha, Asynchronous Byzantine agreement protocols, Information & Computation, vol.75, issue.2, pp.130-143, 1987.

T. D. Dickerson, P. Gazzillo, M. Herlihy, and R. Koskinen, Adding concurrency to smart contracts, vol.17, pp.303-312, 2017.

R. Guerraoui, P. Kuznetsov, M. Monti, M. Pavlovic, and S. , The consensus number of a cryptocurrency. PODC'19, pp.307-316, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02364290

V. Hadzilacos and S. Toueg, A modular approach to fault-tolerant broadcasts and related problems, vol.83, 1994.

M. P. Herlihy and J. Wing, Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990.

D. Imbs and M. Raynal, Trading t-resilience for efficiency in asynchronous Byzantine reliable broadcast, Parallel Processing Letters, vol.26, issue.4, p.pages, 2016.

D. Imbs, A. Mostéfaoui, M. Perrin, and R. M. , Set-constrained delivery broadcast: definition, abstraction power, and computability limits. ICDCN'18, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02053261

L. Lamport, R. Shostack, and M. Pease, The Byzantine generals problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, 1982.

S. Nakamoto, Bitcoin: A peer-to-peer electronic cash system, 2008.

M. Pease, R. Shostak, and L. L. , Reaching agreement in the presence of faults, Journal of the ACM, vol.27, pp.228-234, 1980.

M. Raynal, Fault-tolerant message-passing distributed systems: an algorithmic approach, vol.492, 2018.

M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski, Conflict-free replicated data types. SSS'11, LNCS, vol.6976, pp.386-400, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00609399