Y. Afek and M. Merritt, Fast, wait-free (2k)-renaming, 18th Annual ACM Symposium on Principles of Distributed Computing, pp.105-112, 1999.

K. Chaudhuri, D. Doligez, L. Lamport, and S. Merz, Verifying safety properties with the TLA + proof system, IJCAR 2010, vol.6173, pp.142-148, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00534821

P. Chuong, F. Ellen, and V. Ramachandran, A universal construction for wait-free transaction friendly data structures, 22nd ACM Symposium on Parallelism in Algorithms and Architectures, pp.335-344, 2010.

A. Castaneda, A. Hurault, P. Queinnec, and M. Roy, Modular machinechecked proofs of concurrent algorithms built from tasks, 2019.

A. Castañeda, S. Rajsbaum, and M. Raynal, The renaming problem in shared memory systems: an introduction, Comput. Sci. Rev, vol.5, issue.3, pp.229-251, 2011.

C. Dr?goi, A. Gupta, and T. A. Henzinger, Automatic linearizability proofs of concurrent objects with cooperating updates, CAV 2013, vol.8044, pp.174-190, 2013.

H. Gao, J. F. Groote, and W. H. Hesselink, Lock-free dynamic hash tables with open addressing, Distrib. Comput, vol.18, issue.1, pp.21-42, 2005.

H. Gao and W. H. Hesselink, A formal reduction for lock-free parallel algorithms, CAV 2004, vol.3114, pp.44-56, 2004.

R. Gu, Deep specifications and certified abstraction layers, 42nd ACM Symposium on Principles of Programming Languages, pp.595-608, 2015.

E. Gafni, S. Rajsbaum, S. Dolev, J. Cobb, and M. Fischer, Recursion in distributed computing, SSS 2010, vol.6366, pp.362-376, 2010.

M. Herlihy, Wait-free synchronization, ACM Trans. Program. Lang. Syst, vol.13, issue.1, pp.124-149, 1991.

M. Herlihy, A methodology for implementing highly concurrent objects, ACM Trans. Program. Lang. Syst, vol.15, issue.5, pp.745-770, 1993.

A. Hurault and P. Quéinnec, TLA + proof of Moir-Anderson renaming algorithm, 2019.

M. Herlihy and J. M. Wing, Linearizability: a correctness condition for concurrent objects, ACM Trans. Program. Lang. Syst, vol.12, issue.3, pp.463-492, 1990.

, Bug JDK-6785442: ConcurrentLinkedQueue.remove() and poll() can both remove the same element, 2008.

A. D. Kshemkalyani and M. Singhal, Distributed Computing: Principles, Algorithms, and Systems, 2011.

L. Lamport, On interprocess communication, Distrib. Comput, vol.1, issue.2, pp.77-101, 1986.

L. Lamport, The temporal logic of actions, ACM Trans. Program. Lang. Syst, vol.16, issue.3, pp.872-923, 1994.

L. Lamport, Specifying Systems, 2002.

L. Lamport, The PlusCal algorithm language, ICTAC 2009, vol.5684, pp.36-60, 2009.

L. Lamport, How to write a 21st century proof, J. Fixed Point Theory Appl, vol.11, issue.1, pp.43-63, 2012.

M. Moir and J. H. Anderson, Wait-free algorithms for fast, long-lived renaming, Sci. Comput. Program, vol.25, issue.1, pp.1-39, 1995.

M. Moir, D. Nussbaum, O. Shalev, and N. Shavit, Using elimination to implement scalable and lock-free FIFO queues, 17th ACM Symposium on Parallelism in Algorithms and Architectures, pp.253-262, 2005.

M. M. Michael and M. L. Scott, Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors, J. Parallel Distrib. Comput, vol.51, issue.1, pp.1-26, 1998.

P. W. O'hearn, N. Rinetzky, M. T. Vechev, E. Yahav, and G. Yorsh, Verifying linearizability with hindsight, 29th ACM Symposium on Principles of Distributed Computing, pp.85-94, 2010.

S. Rajsbaum and M. Raynal, A theory-oriented introduction to wait-free synchronization based on the adaptive renaming problem, 25th IEEE International Conference on Advanced Information Networking and Applications, pp.356-363, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00649266

N. Shavit and D. Touitou, Elimination trees and the construction of pools and stacks, Theory Comput. Syst, vol.30, issue.6, pp.645-670, 1997.

S. Timnat and E. Petrank, A practical wait-free simulation for lock-free data structures, ACM Symposium on Principles and Practice of Parallel Programming, pp.357-368, 2014.

B. Tofan, G. Schellhorn, and W. Reif, A compositional proof method for linearizability applied to a wait-free multiset, IFM 2014, vol.8739, pp.357-372, 2014.

,