M. Aguilera, S. Frolund, V. Hadzilacos, S. L. Horn, and S. Toueg, 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=10.1.1.101.5394

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

T. Chandra, V. Hadzilacos, and S. Toueg, The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996.
DOI : 10.1145/234533.234549

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

E. F. Fich, V. Luchangco, M. Moir, and N. Shavit, Obstruction-Free Algorithms Can Be Practically Wait-Free, Proc. 19th Int'l Symp. on Distr. Computing (DISC'05), pp.78-92, 2005.
DOI : 10.1007/11561927_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.7669

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. Kouznetsov, The weakest failure detector to boost obstruction freedom, 20th Int'l Symposium on Distributed Computing (DISC'06 Springer-Verlag LNCS #4167, pp.376-390, 2006.

R. Guerraoui and M. Raynal, The Alpha of Indulgent Consensus, The Computer Journal, vol.50, issue.1, pp.53-67, 2007.
DOI : 10.1093/comjnl/bxl046

R. Guerraoui and M. Raynal, A Universal construction for wait-free objects, Proc. ARES 2007 Int'l Workshop on Foundations of Fault-tolerant Distr. Comp, pp.959-966, 2007.

R. Guerraoui and M. Raynal, From Unreliable Objects to Reliable Objects: The Case of Atomic Registers and Consensus, Proc. 9th Int'l Conf. on Par. Comp. Tech. (PaCT'07), Springer Verlag LNCS LNCS #4671, pp.47-61, 2007.
DOI : 10.1007/978-3-540-73940-1_5

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, and M. Moir, Obstruction-free synchonization: double-ended queues as an example, Proc. 23th Int'l IEEE Conference on Distributed Computing Systems (ICDCS'03), pp.522-529, 2003.

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

P. Jayanti, T. D. Chandra, and S. Toueg, Fault-tolerant wait-free shared objects, Journal of the ACM, vol.45, issue.3, pp.451-500, 1998.
DOI : 10.1145/278298.278305
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.8705

L. Lamport, On interprocess communication, Part 1: Models, Part 2: Algorirhms. Distributed Computing, pp.77-101, 1986.

L. Lamport, The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998.
DOI : 10.1145/279227.279229

M. C. Loui and H. H. Abu-amara, Memory Requirements for Agreement Among Unreliable Asynchronous Processes, of Advances in Comp. Research, pp.163-183, 1987.

M. Raynal and G. Taubenfeld, The notion of a timed register and its application to indulgent synchronization, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '07, pp.200-209, 2007.
DOI : 10.1145/1248377.1248413

M. Raynal and C. Travers, In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement, Proc. 10th Int'l Conference On Principles Of Distributed Systems (OPODIS'06 Springer-Verlag LNCS #4305, pp.1-17, 2006.
DOI : 10.1007/11945529_2
URL : https://hal.archives-ouvertes.fr/inria-00089977

G. Taubenfeld, Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms, Proc. 21th Int'l Symposium on Distributed Computing Springer-Verlag LNCS #4731, pp.450-464, 2007.
DOI : 10.1007/978-3-540-75142-7_34