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

Y. Afek, D. Dauber, and D. Touitou, Wait-free made fast, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.538-547, 1995.
DOI : 10.1145/225058.225271

Y. Afek, E. Gafni, S. Rajsbaum, M. Raynal, and T. C. , 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-00354248

M. K. Aguilera, S. Frolund, V. Hadzilacos, S. L. Horn, and T. S. , Abortable and query-abortable objects and their efficient implementation, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.23-32, 2007.
DOI : 10.1145/1281100.1281107

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. H. Anderson, Multi-writer composite registers, Distributed Computing, pp.175-195, 1994.
DOI : 10.1007/BF02280833

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Anderson and M. Moir, Universal constructions for large objects, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.12, pp.1317-1332, 1999.
DOI : 10.1109/71.819952

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

H. Attiya, A. Bar-noy, D. Dolev, D. Peleg, and R. R. , Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990.
DOI : 10.1145/79147.79158

N. Ben-david, C. Chan, D. Y. Hadzilacos, V. Toueg, and S. , k-Abortable Objects: Progress Under High Contention, Proc. 30th Int'l Symposium on Distributed Computing (DISC'16), Springer LNCS 9888, pp.298-312, 2016.
DOI : 10.1007/978-3-662-53426-7_22

K. A. Bartlett, S. A. Scantlebury, and P. T. Wilkinson, A note on reliable full-duplex transmission over half-duplex links, Communications of the ACM, vol.12, issue.5, pp.260-261, 1969.
DOI : 10.1145/362946.362970

E. Borowsky and E. Gafni, -resilient asynchronous computations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.91-100, 1993.
DOI : 10.1145/167088.167119

URL : https://hal.archives-ouvertes.fr/hal-00896459

Z. Bouzid, M. Raynal, and P. Sutra, Anonymous obstruction-free (n, k)-set agreement with (n ? k + 1) atomic read/write registers, Proc. 19th Int'l Conference On Principles Of Distributed Systems (OPODIS'15), Leibniz Int'l Proceedings in Informatics, LIPICS 46, pp.1-17, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01332935

Z. Bouzid and C. Travers, Simultaneous consensus is harder than set agreement in message-passing, Proc. 33rd Int'l IEEE Conference on Distributed Computing Systems (ICDCS'13), pp.611-620, 2013.
DOI : 10.1109/icdcs.2013.72

URL : https://hal.archives-ouvertes.fr/hal-00752610

B. Hansen and P. , The origin of concurrent programming, 2002.
DOI : 10.1007/978-1-4757-3472-0

V. Bushkov and G. Guerraoui, Safety-Liveness Exclusion in Distributed Computing, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pp.227-236, 2015.
DOI : 10.1145/2767386.2767401

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

C. Cl, C. Johnen, and A. Milani, Solo-fast universal constructions for deterministic abortable objects, Proc. 28th Int'l Symposium on Distributed Computing (DISC'14), Springer LNCS 8784, pp.288-302, 2014.

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

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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

URL : http://doi.org/10.1006/inco.1993.1043

S. Doherty, L. Groves, V. Luchangco, and M. Moir, Towards formally specifying and verifying transactional memory, Formal Aspects of Computing, vol.26, issue.4, pp.769-799, 2013.
DOI : 10.1007/s00165-012-0225-8

URL : http://doi.org/10.1016/j.entcs.2010.01.001

F. Ellen, P. Fatourou, E. Kosmas, A. Milani, and T. C. , Universal constructions that ensure disjoint-access parallelism and wait-freedom, Distributed Computing, vol.26, issue.4, pp.251-277, 2016.
DOI : 10.1007/s00446-015-0261-8

URL : https://hal.archives-ouvertes.fr/hal-00992681

F. Ellen, G. Gelashvili, N. Shavit, and L. Zhu, A complexity-based hierarchy for multiprocessor synchronization (Extended abstract), Proc. 35th ACM Symposium on Principles of Distributed Computing (PODC'16), pp.289-298, 2016.
DOI : 10.1145/2933057.2933113

URL : http://arxiv.org/abs/1607.06139

P. Fatourou and N. D. Kallimanis, The RedBlue Adaptive Universal Constructions, Proc. 23rd Symposium on Distributed Computing (DISC'09), Springer LNCS 5805, pp.127-141, 2009.
DOI : 10.1007/978-3-642-04355-0_15

P. Fatourou and N. D. Kallimanis, Highly-efficient wait-free synchronization. Theory of Computing Systems, pp.475-520, 2014.
DOI : 10.1007/s00224-013-9491-y

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, Round-by-round fault detectors: unifying synchrony and asynchrony, Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC), pp.143-152, 1998.
DOI : 10.1145/277697.277724

J. Gray, Notes on database operating systems Advanced course on Operating Systems, pp.393-481, 1978.

R. Guerraoui and M. Kapalka, On the correctness of transactional memory, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.175-184, 2008.
DOI : 10.1145/1345206.1345233

R. Guerraoui and M. Raynal, A universal construction for wait-free objects, Proc. Workshop on Foundations of Fault-Tolerant Distributed Computing, pp.959-966, 2007.

V. Hadzilacos and S. Toueg, On deterministic abortable objects, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.4-12, 2013.
DOI : 10.1145/2484239.2484241

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, A methodology for implementing highly concurrent data objects, ACM Transactions on Programming Languages and Systems, vol.15, issue.5, pp.745-770, 1993.
DOI : 10.1145/161468.161469

M. P. Herlihy, V. Luchangco, and M. Moir, Obstruction-free synchronization: double-ended queues as an example, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., pp.522-529, 2003.
DOI : 10.1109/ICDCS.2003.1203503

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Herlihy and J. E. Moss, Transactional memory: architectural support for lock-free data structures, Proc. 20th Annual International Symposium on Computer Architecture (ISCA'93), pp.289-300, 1993.
DOI : 10.1109/isca.1993.698569

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Herlihy, S. Rajsbaum, and M. , Power and limits of distributed computing shared memory models, Theoretical Computer Science, vol.509, pp.3-24, 2013.
DOI : 10.1016/j.tcs.2013.03.002

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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-13, 2012.
DOI : 10.1016/j.jpdc.2011.08.005

URL : https://hal.archives-ouvertes.fr/inria-00440392

D. Imbs and M. Raynal, Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations), Theoretical Computer Science, vol.444, pp.113-127, 2012.
DOI : 10.1016/j.tcs.2012.04.037

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

S. N. Kramer, History begins at Sumer: thirty-nine firsts in man's recorded history. University of Pennsylvania Press, 416 pages, 1956.

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. Lamport, A fast mutual exclusion algorithm, ACM Transactions on Computer Systems, vol.5, issue.1, pp.1-11, 1987.
DOI : 10.1145/7351.7352

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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

M. Loui and H. Abu-amara, Memory requirements for agreement among unreliable asynchronous processes, Advances in Computing Research, pp.163-183, 1987.

W. C. Lynch, Computer Systems: Reliable full-duplex file transmission over half-duplex telephone line, Communications of the ACM, vol.11, issue.6, pp.407-410, 1968.
DOI : 10.1145/363347.363366

A. Mostéfaoui, M. Perrin, and M. , A simple object that spans the whole consensus hierarchy, 2016.

O. E. Neugebauer, The exact sciences in Antiquity, 1952.

E. L. Post, Formal Reductions of the General Combinatorial Decision Problem, American Journal of Mathematics, vol.65, issue.2, pp.197-215, 1943.
DOI : 10.2307/2371809

M. Raynal, Concurrent programming: algorithms, principles and foundations, 2013.
DOI : 10.1007/978-3-642-32027-9

URL : https://hal.archives-ouvertes.fr/hal-00922217

M. Raynal, Concurrent Systems: Hybrid Object Implementations and Abortable Objects, Proc. 21th Int'l European Parallel Computing Conference (EUROPAR'15), Springer LNCS 9233, pp.3-15, 2015.
DOI : 10.1007/978-3-662-48096-0_1

URL : http://hdl.handle.net/10397/55343

M. Raynal and J. Stainer, Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems, Proc. 20th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO 2013), Springer LNCS 8179, pp.298-309, 2013.
DOI : 10.1137/S0097539796307698

URL : https://hal.archives-ouvertes.fr/hal-00787992

M. Saks and F. Zaharoglou, -set agreement is impossible, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.1449-1483, 2000.
DOI : 10.1145/167088.167122

URL : https://hal.archives-ouvertes.fr/hal-00192526

N. Shavit and D. Touitou, Software transactional memory, Distributed Computing, vol.10, issue.2, pp.99-116, 1997.
DOI : 10.1007/s004460050028

G. Taubenfeld, Synchronization algorithms and concurrent programming. 423 pages, Pearson Education, 2006.

G. Taubenfeld, Contention-sensitive data structure and algorithms, Proc. 23rd Int'l Symposium on Distributed Computing (DISC'09), Springer LNCS 5805, pp.157-171, 2009.
DOI : 10.1007/978-3-642-04355-0_17

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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

A. M. Turing, On computable numbers with an application to the Entscheidungsproblem, Proc. of the, pp.230-265, 1936.

P. L. Wantzel, Recherches sur les moyens de reconnaître si un problème de géométrie peut se résoudre avec la règle et le compas, Journal de mathématiques pures et appliquées, vol.1, issue.2, pp.366-372, 1837.

L. Zhu, A tight space bound for consensus, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, pp.345-350, 2016.
DOI : 10.1145/2897518.2897565