D. Alistarh, The renaming problem: recent developments and open questions, Bull. EATCS, vol.3, p.117, 2015.

M. B. Andriamiarina, D. Méry, and N. K. Singh, Revisiting snapshot algorithms by refinement-based techniques, Comput. Sci. Inf. Syst, vol.11, issue.1, pp.251-270, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00734131

J. Aspnes and F. Ellen, Tight bounds for adopt-commit objects, Theory Comput. Syst, vol.55, issue.3, pp.451-474, 2014.

H. Attiya, A. Bar-noy, D. Dolev, D. Peleg, and R. Reischuk, Renaming in an asynchronous environment, J. ACM, vol.37, issue.3, pp.524-548, 1990.

E. Borowsky and E. Gafni, Generalized FLP impossibility result for t-resilient asynchronous computations, STOC 1993: Proceedings of the ACM Symposium on Theory of computing, pp.91-100, 1993.

E. Borowsky, E. Gafni, N. A. Lynch, and S. Rajsbaum, The BG distributed simulation algorithm, Distrib. Comput, vol.14, issue.3, pp.127-146, 2001.

A. Castañeda, A. Hurault, P. Quéinnec, and M. Roy, Tasks in modular proofs of concurrent algorithms. CoRR, 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.

A. Castañeda, S. Rajsbaum, and M. Raynal, Unifying concurrent objects and distributed tasks: interval-linearizability, J. ACM, vol.65, issue.6, p.45, 2018.

S. Chaudhuri, More choices allow more faults: set consensus problems in totally asynchronous systems, Inf. Comput, vol.105, issue.1, pp.132-158, 1993.

S. Conchon, A. Goel, S. Krsti?, A. Mebsout, and F. Zaïdi, Cubicle: a parallel SMTbased model checker for parameterized systems, CAV 2012, vol.7358, pp.718-724, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00799272

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.

E. Gafni, Round-by-round fault detectors: unifying synchrony and asynchrony (extended abstract), Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp.143-152, 1998.

S. Ghilardi and S. Ranise, MCMT: a model checker modulo theories, IJCAR 2010. LNCS (LNAI), vol.6173, pp.22-29, 2010.

É. Goubault, J. Ledent, and S. Rajsbaum, A simplicial complex model for dynamic epistemic logic to study distributed task computability, Ninth International Symposium on Games, Automata, Logics, and Formal Verification, pp.73-87, 2018.

N. Hemed, N. Rinetzky, and V. Vafeiadis, Modular verification of concurrency-aware linearizability, DISC 2015, vol.9363, pp.371-387
URL : https://hal.archives-ouvertes.fr/hal-01207126

, , 2015.

D. Hendler, N. Shavit, and L. Yerushalmi, A scalable lock-free stack algorithm, J. Parallel Distrib. Comput, vol.70, issue.1, pp.1-12, 2010.

M. Herlihy, D. N. Kozlov, and S. Rajsbaum, Distributed Computing Through Combinatorial Topology, 2013.

M. Herlihy and N. Shavit, The Art of Multiprocessor Programming, 2008.

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.

G. J. Holzmann, The SPIN Model Checker -Primer and Reference Manual, 2004.

A. Hurault and P. Quéinnec, Proving a non-blocking algorithm for process renaming with TLA +, IEC: IEC-61508: Functional safety, vol.11823, pp.147-166, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02442015

I. Scherer, W. N. Lea, D. Scott, and M. L. , Scalable synchronous queues, Commun. ACM, vol.52, issue.5, pp.100-111, 2009.

W. N. Scherer and M. L. Scott, Nonblocking concurrent data structures with condition synchronization, DISC 2004, vol.3274, pp.174-187

, , 2004.

A. John, I. Konnov, U. Schmid, H. Veith, and J. Widder, Parameterized model checking of fault-tolerant distributed algorithms by abstraction, Formal Methods in Computer-Aided Design, pp.201-209, 2013.

L. Lamport, Specifying Systems, 2002.

L. Lamport, Byzantizing paxos by refinement, DISC 2011, vol.6950, pp.211-224, 2011.

T. Lu, Formal verification of the pastry protocol, 2013.
URL : https://hal.archives-ouvertes.fr/tel-01750356

T. Lu, S. Merz, and C. Weidenbach, Towards verification of the pastry protocol using TLA +, FMOODS/FORTE -2011, vol.6722, pp.244-258, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00593523

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, SPAA 2005, pp.253-262, 2005.

G. Neiger, Set-linearizability, Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, p.396, 1994.

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

M. Raynal, Concurrent Programming -Algorithms, Principles, and Foundations, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00922217

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.

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.

P. Zave, Using lightweight modeling to understand Chord, SIGCOMM Comput. Commun. Rev, vol.42, issue.2, pp.49-57, 2012.