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

M. Ahamad, G. Neiger, J. E. Burns, and P. W. Hutto, Causal memory: definitions, implementation and programming. Distributed Computing, vol.9, pp.37-49, 1995.

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

J. Aspnes and M. Herlihy, Wait-free data structures in the asynchronous PRAM model, Proc. 2nd ACM Symposium on Parallel algorithms and architectures (SPAA'00), pp.340-349, 1990.

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

H. Attiya, M. Herlihy, and R. O. , Atomic snapshots using lattice agreement, Distr. Comp, vol.8, pp.121-132, 1995.

H. Attiya and O. Rachman, Atomic snapshots in O (n log n) operations. SIAM JC, vol.27, pp.319-340, 1998.

H. Attiya and J. L. Welch, Sequential consistency versus linearizability, ACM TOCS, vol.12, issue.2, pp.91-103, 1994.

H. Attiya and J. L. Welch, Distributed computing: fundamentals, simulations and advanced topics, 2004.

O. Biran, S. Moran, and Z. S. , A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor, Proc. 7th ACM Symposium on Principles of Distributed Computing (PODC'88), pp.263-275, 1988.

K. Birman and T. Joseph, Reliable communication in the presence of failures, ACM TOCS, vol.5, issue.1, pp.47-76, 1987.

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

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.

C. Delporte-gallet, H. Fauconnier, S. Rajsbaum, and M. , Implementing snapshot objects on top of crash-prone asynchronous messagepassing systems, Proc. 16th Int'l Conf. on Alg. and Arch. for Par. Proc. (ICA3PP'16), pp.341-355, 2016.
DOI : 10.1007/978-3-319-49583-5_26
URL : https://hal.archives-ouvertes.fr/hal-01416498

F. Ellen, How hard is it to take a snapshot?, Proc. 31th Conf. on Current Trends in Theory & Prac. of Comp. S. (SOFSEM'05), vol.3381, pp.27-35, 2005.

J. M. Faleiro, S. Rajamani, K. Rajan, G. Ramalingam, and K. Vaswani, Generalized lattice agreement, Proc. 31th ACM Symposium on Principles of Distributed Computing (PODC'12), pp.125-134, 2012.

M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of distributed consensus with one faulty process, JACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/588058.588060

M. J. Fischer and M. Merritt, Appraising two decades of distributed computing theory research, Distributed Computing, vol.16, issue.2-3, pp.239-247, 2003.
DOI : 10.1007/s00446-003-0096-6

M. P. Herlihy and N. Shavit, The Art of Multiprocessor Programming, vol.508, p.pages, 2008.
DOI : 10.1145/1146381.1146382

M. P. Herlihy and J. M. Wing, Linearizability: a correctness condition for concurrent objects, ACM TOPLAS, vol.12, issue.3, pp.463-492, 1990.
DOI : 10.1145/78969.78972
URL : http://www.cs.uoregon.edu/classes/06W/cis607atom/readings/herlihy-linearizability.pdf

D. Imbs, A. Mostéfaoui, M. Perrin, and M. , Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits
DOI : 10.1145/3154273.3154296
URL : https://hal.archives-ouvertes.fr/hal-01540010

D. Imbs, A. Mostéfaoui, M. Perrin, and M. , Which broadcast abstraction captures k-set agreement?, Proc. 31th Int'l Symposium on Distributed Computing (DISC'17), 2017.
URL : https://hal.archives-ouvertes.fr/hal-01787801

D. Imbs and M. Raynal, Help when needed, but no more: efficient read/write partial snapshot, Journal of Parallel and Distributed Computing, vol.72, issue.1, pp.1-12, 2012.
DOI : 10.1007/978-3-642-04355-0_16
URL : https://hal.archives-ouvertes.fr/inria-00440392

I. Inoue, W. Chen, T. Masuzawa, and N. Tokura, Linear time snapshots using multi-writer multi-reader registers, Proc. 8th Int'l Workshop on Distributed Algorithms (WDAG'94), vol.857, pp.130-140, 1994.
DOI : 10.1007/bfb0020429

P. Jayanti, An optimal multiwriter snapshot algorithm, Proc. 37th ACM Symposium on Theory of Computing (STOC'05), pp.723-732, 2005.
DOI : 10.1145/1060590.1060697

L. Lamport, How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Transactions on Computers, vol.28, issue.9, pp.690-691, 1979.
DOI : 10.1109/tc.1979.1675439

L. Lamport, On interprocess communication, Part I: basic formalism, Distributed Computing, vol.1, issue.2, pp.77-85, 1986.
DOI : 10.1007/bf01786227

S. Moran and Y. Wolfstahl, Extended impossibility results for asynchronous complete networks, Information Processing Letters, vol.26, issue.3, pp.145-151, 1987.
DOI : 10.1016/0020-0190(87)90052-4

M. Raynal, Communication and agreement abstractions for fault-tolerant asynchronous distributed systems, p.251, 2010.
DOI : 10.2200/s00236ed1v01y201004dct002
URL : https://hal.archives-ouvertes.fr/inria-00543036

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

M. Raynal, Set agreement. Encyclopedia of Algorithms, pp.1956-1959, 2016.
DOI : 10.1007/978-1-4939-2864-4_367
URL : https://hal.archives-ouvertes.fr/inria-00338090

M. Raynal, A. Schiper, and T. S. , The causal ordering abstraction and a simple way to implement it, Information Processing Letters, vol.39, pp.343-351, 1991.
DOI : 10.1016/0020-0190(91)90008-6
URL : https://hal.archives-ouvertes.fr/inria-00075427

M. Shapiro, N. Preguiça, C. Baquero, and Z. M. , Conflict-free replicated data types, Proc. 13th Int'l Symp. on Stabilization, Safety, and Security of Distr. Systems (SSS'11), vol.6976, pp.386-400, 2011.
DOI : 10.1007/978-3-642-24550-3_29
URL : https://hal.archives-ouvertes.fr/inria-00609399

N. Shavit and D. Touitou, Software transactional memory. Distributed Computing, vol.10, pp.99-116, 1997.