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.
DOI : 10.1145/153724.153741

H. Attiya and O. Rachman, ) Operations, SIAM Journal on Computing, vol.27, issue.2, pp.319-340, 1998.
DOI : 10.1137/S0097539795279463

Y. Afek, E. Gafni, S. Rajsbaum, M. Raynal, and C. Travers, The k-simultaneous consensus problem, Distributed Computing, vol.29, issue.5, pp.185-195, 2010.
DOI : 10.1007/s00446-009-0090-8
URL : https://hal.archives-ouvertes.fr/inria-00543100

J. Anderson, Multi-writer composite registers, Distributed Computing, pp.175-195, 1994.
DOI : 10.1007/BF02280833
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.3621

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, A. Bar-noy, D. Dolev, D. Peleg, and R. Reischuk, Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990.
DOI : 10.1145/79147.79158

H. Attiya, R. Guerraoui, and E. Ruppert, Partial snapshot objects, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, SPAA '08, pp.336-343, 2008.
DOI : 10.1145/1378533.1378591

E. Borowsky and E. Gafni, Immediate atomic snapshots and fast renaming, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing , PODC '93, pp.41-51, 1993.
DOI : 10.1145/164051.164056

E. Borowsky and E. Gafni, A Simple Algorithmically Reasoned Characterization of Wait-free Computations, Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC'97, pp.189-198, 1997.

E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum, The BG distributed simulation algorithm, Distributed Computing, vol.14, issue.3, pp.127-146, 2001.
DOI : 10.1007/PL00008933

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

A. Castañeda, S. Rajsbaum, and M. Raynal, The renaming problem in shared memory systems: An introduction, Computer Science Review, vol.5, issue.3, 2011.
DOI : 10.1016/j.cosrev.2011.04.001

T. Chandra, V. Hadzilacos, and S. Toueg, The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996.
DOI : 10.1145/234533.234549

T. 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

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

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, and A. Tielmann, The Disagreement Power of an Adversary, Proc. 23th Int'l Symposium on Distributed Computing (DISC'09 Springer-Verlag LNCS #5805, pp.8-21, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00376981

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

E. Gafni, The 01-Exclusion Families of Tasks, Proc. 12th In'l Conference on Principles of Distributed Systems (OPODIS'08, pp.246-258, 2008.

E. Gafni, The extended BG-simulation and the characterization of t-resiliency, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.85-92, 2009.
DOI : 10.1145/1536414.1536428

E. Gafni and P. Kuznetsov, Turning Adversaries into Friends: Simplified, Made Constructive, and Extended, Proc. 14th Int'l Conference on Principles of Distributed Systems (OPODIS'10), pp.380-394, 2010.
DOI : 10.1007/11864219_23

E. Gafni and P. Kuznetsov, Relating L-Resilience and and Wait-freedom with Hitting Sets, Proc. 12th Int'l Conference on Distributed Computing and Networking (ICDCN'11), pp.191-202, 2011.

E. Gafni and S. Rajsbaum, Recursion in Distributed Computing, Proc. 12th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10), pp.362-376, 2010.
DOI : 10.1007/978-3-642-16023-3_30

E. Gafni and S. Rajsbaum, Distributed Programming with Tasks, Proc. 14th Int'l Conference on Principles of Distributed Systems (OPODIS'10), pp.205-218, 2010.
DOI : 10.1137/S0097539796307698

R. Guerraoui and M. Raynal, From Unreliable Objects to Reliable Objects: The Case of Atomic Registers and Consensus, 9th Int'l Conference on Parallel Computing Technologies (PaCT'07), Springer Verlag LNCS LNCS #4671, pp.47-61, 2007.
DOI : 10.1007/978-3-540-73940-1_5

M. P. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991.
DOI : 10.1145/114005.102808

M. P. Herlihy, V. Luchangco, and M. Moir, Obstruction-free Synchonization: Double-ended Queues as an Example, Proc. 23th Int'l IEEE Conference on Distributed Computing Systems (ICDCS'03), pp.522-529, 2003.

M. P. Herlihy and S. Rajsbaum, The topology of shared-memory adversaries, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.105-113, 2010.
DOI : 10.1145/1835698.1835724

M. P. Herlihy, S. Rajsbaum, and M. Tuttle, Unifying synchronous and asynchronous message-passing models, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.133-142, 1998.
DOI : 10.1145/277697.277722

M. P. Herlihy and N. Shavit, The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999.
DOI : 10.1145/331524.331529

M. P. Herlihy and J. L. 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 and M. Raynal, Help when Needed, but no More: Efficient Read/Write Partial Snapshot, Proc. 23th Int'l Symposium on Distributed Computing (DISC'09 Springer-Verlag LNCS #5805, pp.142-156, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00440392

D. Imbs and M. Raynal, Visiting Gafni???s Reduction Land: From the BG Simulation to the Extended BG Simulation, Proc. 11th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'09), pp.369-383, 2009.
DOI : 10.1007/978-3-642-05118-0_26

D. Imbs and M. Raynal, The multiplicative power of consensus numbers, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.26-35, 2010.
DOI : 10.1145/1835698.1835705
URL : https://hal.archives-ouvertes.fr/inria-00543130

D. Imbs and M. Raynal, A Liveness Condition for Concurrent Objects: x-Wait-freedom. To appear in Concurrency and Computation: Practice and experience, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00646908

D. Imbs, M. Raynal, and G. Taubenfeld, On asymmetric progress conditions, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.55-64, 2010.
DOI : 10.1145/1835698.1835709
URL : https://hal.archives-ouvertes.fr/inria-00486977

F. Junqueira and K. Marzullo, Designing Algorithms for Dependent Process Failures, Future Directions in Distributed Computing #LNCS, vol.47, issue.3, pp.24-28, 2003.
DOI : 10.1109/24.740491
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.1330

. L. Lamport, On interprocess communication, Distributed Computing, vol.21, issue.2, pp.77-101, 1986.
DOI : 10.1007/BF01786227
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1038

M. C. Loui and H. H. Abu-amara, Memory Requirements for Agreement Among Unreliable Asynchronous Processes, of Advances in Comp. Research, pp.163-183, 1987.

Y. Moses and S. Rajsbaum, A Layered Analysis of Consensus, SIAM Journal on Computing, vol.31, issue.4, pp.989-1021, 2002.
DOI : 10.1137/S0097539799364006

A. Mostéfaoui, S. Rajsbaum, and M. Raynal, Conditions on input vectors for consensus solvability in asynchronous distributed systems, Journal of the ACM, vol.50, issue.6, pp.922-954, 2003.
DOI : 10.1145/950620.950624

G. Neiger and S. Linearizability, Brief Announcement, Proc. 13th ACM Symposium on Principles of Distributed Computing (PODC'94, p.396, 1994.

S. Rajsbaum, Iterated Shared Memory Models, Proc. 9th Latin American Symposium Theoretical Informatics (LATIN'10), pp.407-416, 2010.
DOI : 10.1007/978-3-642-12200-2_36

S. Rajsbaum, M. Raynal, and C. Travers, An impossibility about failure detectors in the iterated immediate snapshot model, Information Processing Letters, vol.108, issue.3, pp.160-164, 2008.
DOI : 10.1016/j.ipl.2008.05.001

S. Rajsbaum, M. Raynal, and C. Travers, The Iterated Restricted Immediate Snapshot (IRIS) Model, 14th Int'l Computing and Combinatorics Conferernce (COCOON'08 Springer-Verlag LNCS 5092, pp.487-496, 2008.

M. Raynal, A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, vol.36, issue.1, pp.1181-1191, 2009.
DOI : 10.1145/1052796.1052806

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

G. Taubenfeld, The Computational Structure of Progress Conditions, Proc. 24th Int'l Symposium on Distributed Computing (DISC'10), pp.221-235, 2010.
DOI : 10.1007/978-3-642-15763-9_23