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

S. G. Akl, The design and analysis of parallel algorithms. Prentice-Hall Int'l Series, 401 pages, 1989.

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, A. Fouren, and E. Gafni, An adaptive collect algorithm with applications, Distributed Computing, vol.15, issue.2, pp.87-96, 2002.
DOI : 10.1007/s004460100067
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8262

H. Attiya, M. Herlihy, and O. Rachman, Atomic snapshots using lattice agreement, Distributed Computing, vol.6, issue.4, pp.121-132, 1995.
DOI : 10.1007/BF02242714

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

A. Bar-noy, D. Dolev, C. Dwork, and R. Strong, Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement, Information and Computation, vol.97, issue.2, pp.205-233, 1992.
DOI : 10.1016/0890-5401(92)90035-E

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

R. S. Castañeda 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

O. J. Dahl, E. W. Dijkstra, and C. A. Hoare, Structured programming, 1972.

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

N. Francez, B. Hailpern, and G. Taubendfeld, Script: A communication abstraction mechanism and its verification, Science of Computer Programming, vol.6, pp.35-88, 1986.
DOI : 10.1016/0167-6423(86)90018-3

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

D. Harel and Y. Feldman, Algorithmics: the spirit of computing, p.2012
DOI : 10.1007/978-3-642-27266-0

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, S. Rajsbaum, and M. , Power and limits of distributed computing shared memory models, Theoretical Computer Science, vol.509, p.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

E. Horowitz and S. Shani, Fundamentals of computer algorithms. Pitman, 626 pages, 1978.

. 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

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

L. Lamport, E. Shostak, and M. C. 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.

N. A. Lynch, Distributed Algorithms, 1996.

K. Mehlhorn and P. Sanders, Algorithms and data structures, 2008.

J. Onofre, S. Rajsbaum, and M. , A topological perspective of recursion in distributed computing, p.12, 2013.

S. Rajsbaum and M. Raynal, A Theory-Oriented Introduction to Wait-Free Synchronization Based on the Adaptive Renaming Problem, 2011 IEEE International Conference on Advanced Information Networking and Applications, pp.356-363, 2011.
DOI : 10.1109/AINA.2011.9
URL : https://hal.archives-ouvertes.fr/hal-00649266

B. Randell, Recursively structured distributed computing systems, Proc. 3rd Symposium on Reliability in Distributed Software and Database Systems, pp.3-11, 1983.
DOI : 10.1007/978-3-642-82846-1_2

M. Raynal, Fault-tolerant agreement in synchronous distributed systems, Morgan & Claypool, vol.167, p.2010

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