Y. Afek, E. Weisberger, and H. Weisman, A completeness theorem for a class of synchronization objects, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing , PODC '93, pp.159-168, 1993.
DOI : 10.1145/164051.164071

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, 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 and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, p.414, 2004.
DOI : 10.1002/0471478210

B. A. Ph, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems, 1987.

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

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

R. Colvin, L. Groves, V. Luchangco, and M. Moir, Formal Verication of a Lazy Concurrent List-based Set Algorithm, Proc. 18th Int'l Conference on Computer Aided Verication (CAV'06), pp.475-488, 2006.

E. W. Dijkstra, Hierarchical ordering of sequential processes, Acta Informatica, vol.1, issue.2, pp.115-138, 1971.
DOI : 10.1007/BF00289519

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

R. Guerraoui, M. Kapalka, and P. Kuznetsov, The Weakest Failure Detectors to Boost Obstruction-freedom. Distributed Computing, pp.415-433, 2008.

R. Guerraoui and M. Raynal, A Universal Construction for Wait-free Objects, Proc. ARES 2007 Int'l Workshop on Foundations of Fault-tolerant Distributed Computing, pp.959-966, 2007.

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), pp.47-61, 2007.
DOI : 10.1007/978-3-540-73940-1_5

T. L. Harris, K. Fraser, and I. A. Pratt, A Practical Multi-word Compare-and-Swap Operation, Proc. 16th Int'l Symposium on Distributed Computing (DISC'02), pp.265-279, 2002.
DOI : 10.1007/3-540-36108-1_18

S. Heller, M. P. Herlihy, V. Luchangco, M. Moir, W. Scherer et al., A Lazy Concurrent List-Based Set Algorithm, Parallel Processing Letters, vol.17, issue.04, pp.411-424, 2007.
DOI : 10.1142/S0129626407003125
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.8911

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, P. Marin, and M. Moir, Nonblocking memory management support for dynamic-sized data structures, ACM Transactions on Computer Systems, vol.23, issue.2, pp.146-196, 2005.
DOI : 10.1145/1062247.1062249

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

M. P. Herlihy, N. Shavit, M. P. Herlihy, and N. Shavit, The art of multiprocessor programming, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, p.508, 2008.
DOI : 10.1145/1146381.1146382

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

C. E. Hewitt and R. R. Atkinson, Specication and Proof Techniques for Serializers, IEEE Transactions on Software Engineering, vol.5, issue.1, pp.1-21, 1979.

C. A. Hoare, Monitors: an operating system structuring concept, Communications of the ACM, vol.17, issue.10, pp.549-557, 1974.
DOI : 10.1145/355620.361161
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.6394

J. J. Horning, B. Randell, and P. Structuring, Process Structuring, ACM Computing Surveys, vol.5, issue.1, pp.5-30, 1973.
DOI : 10.1145/356612.356614

D. Imbs and M. Raynal, A note on atomicity: Boosting Test&Set to solve consensus, Information Processing Letters, vol.109, issue.12, pp.589-591, 2009.
DOI : 10.1016/j.ipl.2009.02.004
URL : https://hal.archives-ouvertes.fr/inria-00436478

D. Imbs and M. Raynal, The x-Wait-Freedom Progress Condition, Proc. 16th Int'l European Parallel Computing Conference (EUROPAR'10), pp.584-595, 2010.
DOI : 10.1007/978-3-642-15277-1_55
URL : https://hal.archives-ouvertes.fr/inria-00454386

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

D. Imbs and M. Raynal, A Simple Snapshot Algorithm for Multicore Systems, 2011 5th Latin-American Symposium on Dependable Computing, 2011.
DOI : 10.1109/LADC.2011.11
URL : https://hal.archives-ouvertes.fr/inria-00505233

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 1: Models, Part Algorithms. Distributed Computing, vol.2, issue.12, pp.77-101, 1986.

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

E. Ladam-mozes and N. Shavit, An Optimistic Approach to Lock-free FIFO queues, Proc. 18th Int'l Symposium on Distributed Computing, pp.117-131, 2004.

M. Loui and H. Abu-amara, Memory Requirements for for agreement among Unreliable Asynchronous processes, Advances in Computing Research, pp.163-183, 1987.

N. A. Lynch, Distributed Algorithms, 1996.

M. M. Michael and M. L. Scott, Simple, fast, and practical non-blocking and blocking concurrent queue algorithms, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing , PODC '96, pp.267-275, 1996.
DOI : 10.1145/248052.248106
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.3574

M. Moir, Practical implementations of non-blocking synchronization primitives, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing , PODC '97, pp.219-228, 1997.
DOI : 10.1145/259380.259442

M. Moir, D. Nussbaum, and N. Shavit, Using elimination to implement scalable and lock-free FIFO queues, Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures , SPAA'05, pp.253-262, 2005.
DOI : 10.1145/1073970.1074013
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.6422

M. Moir and J. Anderson, Wait-free algorithms for fast, long-lived renaming, Science of Computer Programming, vol.25, issue.1, pp.1-39, 1995.
DOI : 10.1016/0167-6423(95)00009-H

M. Raynal, Algorithms for Mutual Exclusion, 1986.
URL : https://hal.archives-ouvertes.fr/inria-00075198

M. Raynal, Synchronization is Coming Back, But is it the Same? (Keynote Speech) IEEE 22nd, Conference on Advanced Information Networking and Applications (AINA'08), pp.1-10, 2008.

M. Raynal, Locks Considered Harmful: A Look at Non-traditional Synchronization, Proc. 6th Int'l Workshop on Software Technologies for Future Embedded and Ubiquitous Computing Systems (SEUS'08), pp.369-380, 2008.
DOI : 10.1007/11945529_2

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, Shared Memory Synchronization in Presence of Failures: an Exercise-based Introduction, Conference on Complex, Intelligent and Software Intensive Systems (CISIS'09), pp.9-18, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00440367

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

N. Shaei, Non-blocking Array-based Algorithms for Stacks and Queues, Proc. th Int'l Conference on Distributed Computing and Networking (ICDCV'09), pp.55-66, 2009.

G. Taubenfeld, Synchronization Algorithms and Concurrent Programming, 2006.

G. Taubenfeld, Contention-Sensitive Data Structure and Algorithms, Proc. 23th Int'l Symposium on Distributed Computing (DISC'09), Springer Verlag LNCS #5805, pp.157-171, 2009.

G. Taubenfeld, On the Computational Power of Shared Objects, Proc. 13th Int'l Conference On Principle Of Distributed Systems, pp.270-284, 2009.
DOI : 10.1007/978-3-642-10877-8_22

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

T. Ph, Y. Zhang, and . Simple, Fast and Scalable Non-blocking Concurrent FIFO Queue for Shared Memory Multiprocessor Systems, Proc. 13th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'01), pp.134-143, 2001.

J. D. Valois, Implementing Lock-free Queues, Proc. 7th Int'l Conference on Parallel and Distributed Computing Systems (PDCS'94), pp.64-69, 1994.