A. S. Aiyer, L. Alvisi, and R. A. Bazzi, Bounded wait-free implementation of optimally resilient Byzantine storage without (unproven) cryptographic assumptions, Proc. 21st Int'l Symposium on Distributed Computing (DISC'07), Springer LNCS 4731, pp.7-19, 2007.

H. Attiya, Efficient and Robust Sharing of Memory in Message-Passing Systems, Journal of Algorithms, vol.34, issue.1, pp.109-127, 2000.
DOI : 10.1006/jagm.1999.1025

H. Attiya, A. Bar-noy, and D. Dolev, Sharing memory robustly in message passing systems, Journal of the ACM, vol.42, issue.1, pp.121-132, 1995.

H. Attiya and A. Bar-or, Sharing memory with semi-Byzantine clients and faulty storage servers. Parallel Processing Letters, pp.419-428, 2006.

H. Attiya and J. L. Welch, Distributed computing: fundamentals, simulations and advanced topics, Wiley-Interscience, 414 pages, 2004.
DOI : 10.1002/0471478210

G. Bracha, Asynchronous Byzantine agreement protocols, Information and Computation, vol.75, issue.2, pp.130-143, 1987.
DOI : 10.1016/0890-5401(87)90054-X
URL : http://doi.org/10.1016/0890-5401(87)90054-x

S. Chaudhuri, M. J. Kosa, and W. J. , One-write algorithms for multivalued regular and atomic registers, Acta Informatica, vol.37, issue.3, pp.161-192, 2000.
DOI : 10.1007/s002360000040

D. Dobre, R. Guerraoui, M. Majuntke, N. Suri, and M. Vukolic, The complexity of robust atomic storage, Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '11, pp.59-68, 2011.
DOI : 10.1145/1993806.1993816

R. Guerraoui and M. Vukolic, How fast can a very robust read be?, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.248-257, 2006.
DOI : 10.1145/1146381.1146419

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

D. Imbs, S. Rajsbaum, M. Raynal, and J. Stainer, Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems, Proc. 21st Int. Colloquium on Structural Information and Communication Complexity (SIROCCO'14), Springer LNCS 8576, pp.37-53, 2014.
DOI : 10.1007/978-3-319-09620-9_5
URL : https://hal.archives-ouvertes.fr/hal-01097383

A. Ittai, G. Chockler, I. Keidar, and M. D. , Byzantine disk paxos: optimal resilience with byzantine shared memory, Distributed Computing, vol.18, issue.5, pp.387-408, 2006.

L. Lamport, R. Shostack, and M. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176

L. Lamport, On interprocess communication, Distributed Computing, vol.21, issue.2, pp.77-85, 1986.
DOI : 10.1007/BF01786227

L. Lamport, On interprocess communication, Part II: algorithms. Distributed Computing, pp.77-101, 1986.

D. Malkhi and M. Reiter, Secure and scalable replication in Phalanx, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281), pp.51-58, 1998.
DOI : 10.1109/RELDIS.1998.740474

J. Martin, . Ph, and L. Alvisi, A framework for dynamic Byzantine storage, International Conference on Dependable Systems and Networks, 2004, pp.325-334, 2004.
DOI : 10.1109/DSN.2004.1311902

J. Misra, Axioms for memory access in asynchronous hardware systems, ACM Transactions on Programming Languages and Systems, vol.8, issue.1, pp.142-153, 1986.
DOI : 10.1145/5001.5007

A. Mostéfaoui and M. Raynal, Communication and agreement abstractions in the presence of Byzantine processes, IEEE Transactions on Parallel and Distributed Systems, 2016.

M. Pease, R. Shostak, R. Lamport, and L. , Reaching Agreement in the Presence of Faults, Journal of the ACM, vol.27, issue.2, pp.228-234, 1980.
DOI : 10.1145/322186.322188

M. Raynal, Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010.
DOI : 10.2200/S00236ED1V01Y201004DCT002
URL : https://hal.archives-ouvertes.fr/inria-00543036

M. Raynal, Concurrent programming: algorithms, principles and foundations, p.2013
DOI : 10.1007/978-3-642-32027-9
URL : https://hal.archives-ouvertes.fr/hal-00922217

@. Then, when p i has received the same message ECHO(j, v, sn) from " enough " processes (where " enough " means " more than (n + t)/2 different processes " ), and has not yet broadcast a message READY(j, v, sn)