Proving program termination, Communications of the ACM, vol.54, issue.5, pp.88-98, 2011. ,
The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996. ,
DOI : 10.1145/234533.234549
Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996. ,
DOI : 10.1145/226643.226647
The minimum information about failures for solving non-local tasks in message-passing systems, Distributed Computing, vol.22, issue.5???6, pp.255-269, 2011. ,
DOI : 10.1007/s00446-011-0146-4
The weakest failure detector for eventual consistency, ACM Symposium on Principles of Distributed Computing (PODC), pp.375-384, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01213330
Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings, 12th Latin American Theoretical Informatics Symposium (LATIN), LNCS #9644 pp, pp.497-508, 2016. ,
DOI : 10.1007/978-3-662-49529-2_37
URL : https://hal.archives-ouvertes.fr/hal-01423679
Perfect Failure Detection with Very Few Bits ,
DOI : 10.1007/978-3-642-22012-8_35
URL : https://hal.archives-ouvertes.fr/hal-01365304
The failure detector abstraction, ACM Computing Surveys, vol.43, issue.2, p.9, 2011. ,
DOI : 10.1145/1883612.1883616
Non-blocking atomic commit in asynchronous distributed systems with failure detectors, Distributed Computing, pp.17-25, 2002. ,
DOI : 10.1007/s446-002-8027-4
The power of priority channel systems, Logical Methods in Computer Science, vol.10, issue.4, p.2014 ,
URL : https://hal.archives-ouvertes.fr/hal-00793809
Ordering by Divisibility in Abstract Algebras, Proceedings of the London Mathematical Society, vol.3, issue.1, pp.326-336, 1952. ,
DOI : 10.1112/plms/s3-2.1.326
Every problem has a weakest failure detector, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.75-84, 2008. ,
DOI : 10.1145/1400751.1400763
Hierarchies of number theoretic functions. I. Arch. MAth. Logic, pp.39-51, 1970. ,
In Graphs and Order, The Role of Graphs in the Theory of Ordered Sets and Its Applications, NATO ASI Series, pp.487-502, 1985. ,
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement, SIAM Journal on Computing, vol.38, issue.4, pp.1574-1601, 2008. ,
DOI : 10.1137/050645580
On the computability power and the robustness of set agreement-oriented failure detector classes, Distributed Computing, pp.201-222, 2008. ,
DOI : 10.1007/s00446-008-0064-2
Leader-based consensus. Parallel Processing Letters, pp.95-107, 2001. ,
Algorithmic aspects of WQO theory ,
URL : https://hal.archives-ouvertes.fr/cel-00727025
Multiply-Recursive Upper Bounds with Higman's Lemma In 38th International Colloquium in Automata, Languages and Programming, pp.441-452, 2011. ,
Checking a large routine, Conference on High Speed Automatic Calculating Machines, pp.67-69, 1949. ,