Pr. Michel Raynal | Membre de l'Institut Universitaire de France |
My View |
Professional Activities |
Scientific Achievements |
Publications |
PUBLICATIONS 1. Thesis 2. Conception et réalisation d’une machine-langage de haut niveau adaptée à l'éecriture de systèmes.
2. Publications: Guest Editor of Int’l Journals
3. Publications: BOOKS (author) 1. Algorithmique du parallélisme : le problème de l’exclusion mutuelle. Dunod Ed., 160 pages, 1984. 2. Algorithmes distribués et protocoles. Eyrolles Ed., 142 pages, 1985. 3. Systèmes répartis et réseaux: concepts, outils et algorithmes. Eyrolles Ed., 200 pages, 1987. 4. Synchronisation et contrôle des systèmes et programmes répartis (with J.-M. Helary), Eyrolles Ed., 200 pages, 1988. 5. La communication et le temps dans les réseaux et les systèmes répartis. (Tome 1 d’une introduction aux principes des systèmes répartis). Eyrolles Ed., collection EDF, 232 pages, 1991. 6. Synchronisation et état global dans les systèmes répartis. (Tome 2 d’une introduction aux principes des systèmes répartis). Eyrolles Ed., collection EDF, 228 pages, 1992. 7. Gestion des données réparties : problèmes et protocoles. (Tome 3 d’une introduction aux principes des systèmes répartis). Eyrolles Ed., collection EDF, 200 pages, 1992. 8. Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems. Morgan & Claypool Publishers, 251 pages, 2010 (ISBN 978-1-60845-293-4).
9. Fault-Tolerant Agreement in Synchronous Message-Passing Systems. Morgan & Claypool Publishers, 165 pages, 2010 (ISBN 978-1-60845-525-6).
10. Concurrent Programming: Algorithms, Principles and Foundations. Springer, 515 pages, 2012 (ISBN 978-3-642-32026-2). 11.Distributed Algorithms for Message-passing Systems. Springer, 510 p., 2013 (ISBN: 978-3-642-38122-5).
From the reviews:
4. Publications: CHAPTERS in books and encyclopedia 1. Chapter “Consensus in Asynchronous Distributed Systems: A Concise Guided tour”, in Advances Distributed Systems, Springer, LNCS 1752, pp. 33-47, 2000 (with R. Guerraoui, M. Hurfin, A. Mostefaoui, R. Oliveira and A. Schiper). 2. Chapter “Time in Distributed Systems: Models and Algorithms” in Advances Distributed Systems, Springer, LNCS 1752, pp. 33-47, 2000 (with Paulo Verissimo -Lisbon University-). 3. Chapter “Reliable Logical Clocks for Unreliable Process Groups” in “Dependable Network Computing” pp. 93-108, Kluwer Academic Press, 2001 (with A. Mostefaoui, M. Takizawa -Tokyo Denki University-). 4. Chapitre “Une introduction à l’algorithmique distribuée des systèmes asynchrones”, Encyclopédie Vuibert de l’informatique et des systèmes d’information, pp. 179-194, 2006 (ISBN 978-2-7117-4846-4). 5. Article “Set agreement”, Encyclopedia of Algorithms, Springer, pp. 829-831, 2008 (ISBN 978-0-387-30770-1). 6. Article “Failure Detectors for Asynchronous Distributed Systems: an Introduction”. Wiley Encyclopdia of Computer Science and Engineering, Vol. 2, pp. 1181-1191, 2009 (ISBN 978-0-471-38393-2). 7. Article “Distributed Snapshots”, Second Edition of Encyclopedia of Algorithms, Springer, to appear, 2015. 8. Article “Time is not a healer”, Second Edition of Encyclopedia of Algorithms, Springer, to appear, 2014. (Article on the notion of message adversary.)
5. Publications: articles in PEER-REVIEWED JOURNALS [R1] Une expression de la synchronisation pour les types abstraits. RAIRORevue Bleue/Computer Science, 12(4):307- 316, 1978. [R2] An experience in implementing abstract data types. Software Practice and Experience, 11:315-320, 1980 (with M. Banatre, A. Couvert, D. Herman). [R3] Types in a mixed language system. BIT, (now Nordic Journal of Computing) 23(2):246-256, 1981 (with Ph. Darondeau, P. Le Guernic). [R4] Une analyse de la spécification de la coopération entre processus par variables partagées. Techniques et Science Informatiques (TSI), 1(3):201-210, 1982. [R5] Structured specification of communicating systems.IEEE Transactions on Computers, C32(2):120-133, 1983 (with G. von Bochmann). R6] Un algorithme d’exclusion mutuelle pour une structure logique en anneau. Techniques et Science Informatiques (TSI), 4(5):471-474, 1985. [R7] A distributed algorithm to prevent mutual drift between n logical clocks. Information Processing Letters, 24:199-202, 1987. [R8] Parcours et apprentissage dans un réseau de processus communicants. Techniques et Science Informatiques (TSI), 5(2):127-140, 1987 (with J.-M. Hélary, A. Maddi, N. Plouzeau). [R9 Producteur-consommateur : quelques solutions réparties. Techniques et Science Informatiques (TSI), 6(3):231- 241, 1987 (with N. Plouzeau, J.-P. Verjus). [R10] Calcul distribué d’un extremum et du routage associé dans un réseau quelconque. Rairo Informatique Théoorique et Applications, 21(3):1-22, 1987 (with J.-M. Hélary, A. Maddi). [R12] Un schéma abstrait d’itération répartie, application au calcul des chemins de valeurs minimales. Techniques et Science Informatiques (TSI), 8(3):259-268, 1989 (with J.-M. Hélary). [R13] Prime numbers as a tool to design distributed algorithms. Information Processing Letters, 33(1):53-58, 1989. [R14] Simulation répartie : schémas d’exécution pour un modèle à processus. Techniques et Science Informatiques (TSI), 9(5):383-398, 1990 (with Ph. Ingels). [R15] Vers la construction raisonnée d’algorithmes répartis, le cas de la terminaison. Techniques et Science Informatiques (TSI), 10(3):203-209, 1991 (with J.-M. Hélary). [R16] La communication causale dans les systèmes répartis, protocoles fondés sur le comptage. Revue Réseaux et Informatique Répartie, 1(1):87-99, 1991. [R17] The causal ordering abstraction and a simple way to implement it. Information Processing Letters, 39:343- 351, 1991 (with A. Schiper, S. Toueg). [R18] A debugging tool for distributed Estelle programs. Journal of Computer Communications, 16(5):328-333, 1993 (with M. Hurfin, N. Plouzeau). [R19] Protocoles simples pour l’implémentation répartie des sémaphores. Annales des Télécommunications, 48(5- 6):260-273, 1993. [R20] Un noyau réparti pour les applications fondées sur la progression d’un temps virtuel. Revue Réseaux et Informatique Répartie, 3(2):145-168, 1993 (with Ph. Ingels, C. Maziero). [R21] Towards the Construction of Distributed Detection Programs with an Application to Distributed Termination. Distributed Computing, 7(3):137-147, 1994 (with J.-M. Hélary). [R22] A General Scheme for Token and Tree Based Distributed Mutual Exclusion Algorithms. IEEE Transactions on Parallel and Distributed Systems, 5(11):1185-1196, 1994 (with J.-M. Hélary, A. Mostéfaoui). [R23] Déterminer un état global dans un système réparti. Annales des télécommunications, 49(7-8):460-469, (with J.-M. Hélary, A. Mostefaoui). [R24] An implementation of global flush primitives using counters. Parallel Processing Letters, 5(2):171-178, 1995 (with M. Ahuja). [R25] A Graph-based Characterization of communication modes in distributed executions. Journal of Foundations of Computing and Decision Sciences, 20(1):3-20, 1995 (with R. Baldoni -Univ. Roma-). [R26] Specification and Verification of Dynamic Properties in Distributed Computations. Journal of Parallel and Distributed Computing, 28(2): 173-185, 1995 (with O. Babaoglu -University of Bologna-). [R27] Distributed algorithms for static and dynamic termination detection. Bulletin of the Polish Academy of Sciences, 43(3):363-380, 1995 (with J. Brzezinsky -University of Poznan-, J.-M. Hélary). [R28] On-the-fly Analysis of Distributed Computations. Information Processing Letters, 54:267-274, 1995 (with E. Fromentin, C. Jard, G.-V., Jourdan). [R29] Semantics of recovery lines for backward recovery in distributed systems. Annales des Télécommunications, 50(10-11):874-887, 1995 (with J. Brzezinsky -University of Poznan-, J.-M. Hélary). [R30] Deadlock models and a general algorithm for distributed deadlock detection. Journal of Parallel and Distributed Computing, 31(2):112-125, 1995. (with J. Brzezinsky -University of Poznan-, J.-M. Helary, M. Singhal -Ohio University-). [R31] An introduction to Snapshot Algorithms in Distributed Computing, Journal of Distributed Systems Engineering, 2(4):224-233, 1995 (with A. Kshemkalyani, M. Singhal -Ohio state university-). [R32] Causal Delivery of messages with Real-Time Data in unreliable networks, Real-Time Systems Journal 10(3): 245-262, 1996 (with R. Baldoni, A. Mostefaoui). [R33] Logical time: capturing causality in distributed systems. IEEE Computer, 29(2):49-57, 1996 (with M. Singhal). [R34] An Optimistic Protocol for a Linearizable Distributed Shared Memory System. Parallel Processing Letters, 6(2):65-278, 1996 (with M. Mizuno, M. Neilsen -Kansas State University-). [R35] A Unified Framework for Expressing and Detecting Run-Time Properties of Distributed Computations. Journal of Systems Software, 33(3):287-298, 1996 (with O. Babaoglu, E. Fromentin). [R36] From group communication to transactions in distributed systems. Communications of the ACM, 39(4):84- 90, 1996 (with A. Schiper). [R37] On-the-fly detection of a class of words-based patterns in labeled Dags. Applied Mathematics and Computer Science, 7(1):205-216, 1997 (with M. Hurfin). [R38] Adaptive checkpointing in message-passing distributed systems. Int’l Journal of Systems Science, 28(11):1145- 1161, 1997. (with R. Baldoni, J.-M. Hélary, A. Mostéfaoui). [R39] K-arbiter: a safe and general scheme for h out of k mutual exclusion. Theoretical Computer Science, 193(1- 2):97-112, 1998. (with R. Baldoni, Y. Manabe -NTT, Japan-). [R40] An adaptive causal ordering algorithm suited to mobile computing environments. Journal of Parallel and Distributed Computing, 41(1):190-204, 1997 (with M. Singhal, R. Prakash). [R41] Shared Global States in Distributed Computations. Journal of Computer and System Sciences, 55(3):522- 528, 1997 (with E. Fromentin). [R42] Revisiting the non-blocking atomic commitment problem in distributed data management systems. Ingénierie des Systèmes d’Information, 5(6):639-659, 1997. [R43] A suite of definition for consistency criteria in distributed shared memories. Annales des Télécommunications, 52(11-12):652-661, 1997 (with A. Schiper). [R44] Efficient delta-causal broadcasting. Journal of Computer Systems Science and Engineering, 13(5):263-270, 1998 (with R. Baldoni, R. Prakash, M. Singhal). [R46] De la validation atomique au consensus: une approche synthétique. Techniques et Science Informatiques (TSI), 17(3):279-298, 1998 (with R Guerraoui, A. Schiper). [R47] Points de contrôle dans les systèmes répartis : concepts et protocoles. Techniques et Science Informatiques (TSI), 17(10):1223-1246, 1998 (with A. Mostéfaoui, J.-M. Hélary). [R48] Efficient distributed detection of conjunction of local predicates. IEEE Transactions on Software Engineering, 24(8):664-677, 1998. (with M. Hurfin, M. Mizuno, M. Singhal). [R49] Consistency issues in distributed checkpoints. IEEE Transactions on Software Engineering, 25(4):274-281, 1999 (with R. Netzer, J.-M. Helary). [R50] Non-Blocking Atomic Commitment in Distributed Systems: A tutorial based on a generic protocol. Journal of Computer Systems Science and Engineering, 15(2):77-86, 2000. [R51] Normality: a Consistency criterion for concurrent objects. Parallel Processing Letters, 9(1):123-134, 1999 (with V. Garg, Austin). [R52] An adaptive architecture for causally consistent distributed services. Distributed Systems Engineering Journal, 6(2):63-70, 1999 (with M. Ahamad, G. Thia-Kime). [R53] Communication-induced determination of consistent snapshots. IEEE Transactions on Parallel and Distributed Systems, 10(9):865-877, 1999 (with J.-M. Helary, A. Mostefaoui). [R54] A simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector. Distributed Computing, 12(4):209-223, 1999 (with M. Hurfin). [R55] Group membership failure detection: a simple protocol and its probabilistic analysis. Distributed Systems Engineering Journal, 6(3):95-102, 1999 (with F. Tronel). [R56] Restricted Failure Detectors: Definition and Reduction Protocols. Information Processing Letters, 72:91-97, 1999 (with F. Tronel). [R57] Communication-based prevention of useless checkpoints in distributed computations. Distributed Computing, 13(1):29-43, 2000. (with R. Netzer, A. Mostefaoui, J.-M. Helary). [R58] From Binary Consensus to Multivalued Consensus in Asynchronous Message-Passing Systems. Information Processing Letters, 73:207-213, 2000. (with A. Mostefaoui, F. Tronel). [R59] Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors. EEE Transactions on Parallel and Distributed Systems, 11(9):897-909, 2000 (with J.-M. Helary, M. Hurfin, A. Mostefaoui, F. Tronel). [R60] Fault-Tolerant Consensus-Based Total Order Multicast. IEEE Transactions on Parallel and Distributed Systems. 13(2):147-157, 2001 (with U. Fridzke, Ph. Ingels, A. Mostefaoui). [R61] Impossibility of Scalar Clock-Based Communication-Induced Checkpointing Protocols Ensuring the RDT Property. Information Processing Letters, 80:105-111, 2001 (with R. Baldoni, A. Mostefaoui, J.- M. Helary). [R62] Rollback-dependency trackability: a minimal characterization and its protocol. Information and Computation, 165(2):144-173, 2001 (with R. Baldoni, J.-M. Hélary). [R63] Direct Dependency-Based Determination of Consistent Global Checkpoints. Journal of Computer Systems Science and Engineering, 16(1):43-50, 2001 (with R. Baldoni, G. Cioffi, J.M. Helary). [R64] The Logically Instantaneous Communication Mode: a Communication Abstraction. Future Generation of Computer Systems, 17(6):669-678, March 2001. (with A. Mostefaoui, P. Verissimo). [R65] Mastering Agreement Problems in Distributed Systems. IEEE Software, 18(4):40-47, 2001 (with M. Singhal). [R66] Consistent Checkpointing for Transaction Systems. The Computer Journal, 44(2):92-100, 2001 (with R. Baldoni, F. Quaglia, Univ. Roma). [R67] Leader-Based Consensus. Parallel Processing Letters, 11(1):95-107, 2001 (with A. Mostefaoui). [R68] Fundamentals of Distributed Computing: A Practical Tour of Vector-Clock Systems. IEEE Distributed Systems Online (http://www.computer.org/dsonline), 3(2):1-18, 2002 (with R. Baldoni). [R69] A versatile family of consensus protocols based on Chandra-Toueg’s unreliable failure detectors. IEEE Transactions on Computers, 51(4):395-408, 2002. (with M. Hurfin, A. Mostefaoui). [R70] Interval Consistency of Asynchronous Distributed Computations. Journal of Computer and System Sciences, 64(2):329-349, 2002 (with A. Mostefaoui, J.-M. Hélary). [R71] Real-Time Based Consistency Models for Distributed Objects. Journal of Computer Systems Science and Engineering, 17(2):133-142, 2002 (with M. Ahamad, F. Torres, Georgia Tech). [R72] An Introduction to Oracles for Asynchronous Distributed Systems. Future Generation Computer Systems, 18(6):757-767, 2002 (with E. Mourgaya, A. Mostefaoui). [R73] A Note on the Determination of the Immediate Predecessors in a Distributed Computation. Int’l Journal of Foundations of Computer Science (IJFCS), 13(6):865-972, 2002 (with E. Anceaume, J.M. Helary). [R74] Token-Based Sequential Consistency. Journal of Computer Systems Science and Engineering, 17(6):359-365, 2002. [R75] Efficient Causality-Tracking Timestamping. IEEE Transactions on Knowledge and Data Engineering, 15(5): 1239-1250, 2003 (with R. Baldoni, J.-M. Hélary, G. Melideo). [R76] Early Stopping in Global Data Computation. IEEE Transactions on Parallel and Distributed Systems, 14(9):909- 921, 2003 (with C. Delporte-Gallet, H. Fauconnier, J.-M. Hélary). [R77] Atomic Broadcast in Asynchronous Crash-Recovery Distributed Systems and its use in Quorum-Based Replication. IEEE Transactions on Knowledge and Data Engineering, 15(5):1206-1217, 2003 (with L. Rodrigues, Lisboa, Portugal). [R78] Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. Journal of the ACM, 50(6):922-954, November 2003. (with A. Mostefaoui, S. Rajsbaum). [R79] Consensus in Byzantine Asynchronous Systems. Journal of Discrete Algorithms, 1(2):185-210, 2003 (with R. Baldoni, J.-M. Hélary, L. Tanguy). [R80] Condition-Based Consensus Solvability: a Hierarchy of Conditions and Efficient Protocols. Distributed Computing, 17(1):1-20, 2004 (with A. Mostefaoui, S. Rajsbaum, M. Roy). [R81] Necessary and Sufficient Condition for Transforming Limited Accuracy Failure Detectors. Journal of Computer and System Sciences, 68:123-133, 2004 (with E. Anceaume, A. Fernandez, A. Mostefaoui, G.. Neiger). [R82] The Information Structure of Indulgent Consensus. IEEE Transactions on Computers, 53(4):453-466, 2004 (with R. Guerraoui). [R83] A Weakest Failure Detector-Based Asynchronous Consensus Protocol for f < n. Information Processing Letters, 90(1):39-46, 2004 (with R. Friedman, A. Mostefaoui). [R84] Quorum-Based Multi-Invocation Model for Replicated Objects. Concurrent Engineering: Research and Application Journal, June 2004. (with T. Enokido, K. Hori, M. Takizawa -Tokyo-). [R85] Wait-Free Computing: an Introductory Lecture. Future Generation Computer Systems, 21(5):655-663, 2005. [R86] Asynchronous Bounded Lifetime Failure Detectors. Information Processing Letters, 94(2):85-91, 2005 (with R. Friedman, A. Mostefaoui). [R87] A Short Introduction to Failure Detectors for Asynchronous Distributed Systems. ACM Sigact News, Distributed Computing Column, 36(1):53-70, 2005. [R88] Stabilizing Mobile Philosophers. Information Processing Letters, 95(1):299-306, 2005 (with A. Datta, M. Gradinariu). [R89] <>P mute-Based Consensus for Asynchronous Byzantine Systems. Parallel Processing Letters, 15(12):162- 182, 2005 (with R. Friedman, A. Mostefaoui). [R91] Synchronous Condition-Based Consensus. Distributed Computing, 18(5):325-343, 2006 (with A. Mostéfaoui, S. Rajsbaum). [R92] Time-free and timer-based assumptions can be combined to get eventual leadership. IEEE Transactions on Parallel and Distributed Systems, 17(7):656-666, 2006 (with A. Mostefaoui, C. Travers). [R93] A Time-free Assumption to Implement Eventual Leadership. Parallel Processing letters, 16(2):189-208, 2006 (with A. Mostefaoui, E. Mourgaya, C. Travers). [R94] From<>W to Ω: a simple bounded quiescent reliable broadcast-based transformation. Journal of Parallel and Distributed Computing, 67(1):125-129, 2007 (with A. Mostefaoui, S. Rajsbaum, C. Travers). [R95] The Alpha of indulgent consensus. The Computer Journal, 50(1):53-67, 2007 (with R. Guerraoui). [R96] An adaptive programming model for fault-tolerant distributed computing. IEEE Transactions on Dependable and Secure Computing, 4(1):18-31, 2007 (with S. Gorender, R. Macedo, Salvador de Bahia, Brazil). [R97] On the Respective Power of <>P and <>S to Solve One-Shot Agreement Problems. IEEE Transactions on Parallel and Distributed Systems, 18(5):589-597, 2007 (with R. Friedman, A. Mostefaoui). [R98] Distributed agreement problems and their connection with error-correcting codes. IEEE Transactions on Computers, 56(7):865-875, 2007 (with Friedman R., A. Mostefaoui, S. Rajsbaum). [R99] Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks, IEEE Transactions on Computers, 56(8):1055-1070, 2007 (with Jiannong Cao, J. Yang, W. Wu, Hong-Kong-). [R100] An Impossibility about Failure Detectors in the Iterated Immediate Snapshot Model. Information Processing Letters, 108(3):160-164, 2008 (with S. Rajsbaum, C. Travers). [R101] Modularity: a first class concept to address distributed systems. ACM Sigact News, 39(2):91-110, 2008. (with A.-M. Kermarrec, R. Friedman). [R102] Using asynchrony and zero-degradation to speed up indulgent consensus protocols. Journal of Parallel and Distributed Computing. 68(7):984-996, 2008 (with J. Cao, W. Wu, J. Lin, Hong-Kong Polytechnic University). [R103] On the Computability Power and the Robustness of Set Agreement-oriented Failure Detector Classes. Distributed Computing, 21(3):201-222, 2008 (with A. Mostefaoui, S. Rajsbaum, C. Travers). [R104] Anonymous graph exploration without collision by mobile robots. Information Processing Letters. 109:98-103, 2008 (with R. Baldoni, F. Bonnet, A. Milani). [R105] The combined power of conditions and information on failures to solve asynchronous set agreement. SIAM Journal of Computing, 38(4):1574-1601, 2008 (with A. Mostefaoui, S. Rajsbaum, C. Travers). [R106] From adaptive renaming to set agreement. Theoretical Computer Science, 410(14-15): 1328-1335, 2009 (with E. Gafni, A. Mostefaoui, C. Travers). [R107] On the fly estimation of the processes that are alive in an asynchronous message-passing system. IEEE Transactions on Parallel and Distributed Systems, 20(6):778-787, 2009 (with A. Mostefaoui, G. Trédan). [R108] Revisiting Simultaneous Consensus with Crash Failures. Journal of Parallel and Distributed Computing, 69:400-409, 2009 (with Y. Moses, the Technion, Israel). [R109] A note on atomicity: boosting Test&Set to solve Consensus. Information Processing Letters, 109(12):589-591, 2009 (with D. Imbs). [R110] Conditions for set agreement with an application to synchronous systems. Springer Journal Computer Science and Technology, 24(3):418-433, 2009 (with F. Bonnet). [R111] Eventual Clusterer: a Modular Approach to Designing Hierarchical Consensus Protocols in MANETs. IEEE Transactions on Parallel and Distributed Systems, 20(6):753-765, 2009 (with J. Cao, W. Wu, Hong-Kong Polytechnic University). [R112] Strongly Terminating Early-Stopping k-set Agreement in Synchronous Systems with General Omission Failures. Theory of Computing Systems, 17(1):259-287, 2010 (with Ph. Raipin Parvedy, C. Travers). [R113] A timing assumption and two t-resilient protocols for implementing an eventual leader service in asynchronous shared-memory systems, Algorithmica, 56(4):550-576, 2010 (with A. Fernandez, E. Jimenez, G. Trédan). [R114] Narrowing Power vs Efficiency in Synchronous Set Agreement: Relationship, Algorithms and Lower Bound.Theoretical Computer Science, 411(1):58-69, 2010. (with Mostefaoui, C. Travers). [R115] A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory. The Computer Journal, 53(9):1523-1534, 2010. (with V. Cholvi, A. Fernandez, E. Jimenez, and P. Manzano, Madrid). [R116] From an Asynchronous Intermittent Rotating Star to an Eventual Leader. IEEE Transactions on Parallel and Distributed Systems, 21(9):1290-1303, 2010. (with A. Fernandez, Madrid). [R117] The k-simultaneous consensus problem. Distributed Computing, 22(3):185-196, 2010. (with Y. Afek, E. Gafni, S. Rajsbaum, C. Travers). [R118] A simple proof of the necessity of the failure detector Σ to implement an atomic register in asynchronous message-passing systems. Information Processing Letters, 110(4):153-157, 2010, (with F. Bonnet). [R119] Eventual Leader election with weak assumptions on initial knowledge, communication reliability and synchrony. Springer Journal of Computer Science and Technology (JCST), 25(6):1267-1281, 2010, (With A. Fernandez and E. Jimenez, Madrid). [R120] Software Transactional Memories: an Approach for Multicore Programming. Springer Journal of Supercomputing, 57(2):203-215, 2011. (With D. Imbs). [R121] The Price of Anonymity: Optimal Consensus despite Asynchrony, Crash and Anonymity. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 6(4): Article 23 (28 pages), October 2011. (With F. Bonnet). [R122] On the road to the Weakest Failure Detector for k-Set Agreement in Message-passing Systems. Theoretical Computer Science, 412(33):4272-4284, 2011. (With F. Bonnet). [R123] Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results. Electronic Bulletin of EATCS, 103(1):75-95, 2011. [R124] A Liveness Condition for Concurrent Objects: x-Wait-freedom. Concurrency and Computation: Practice and experience, 23:2154-2166, 2011. (With D. Imbs). [R125] The renaming problem in shared memory systems: an introduction. Elsevier Computer Science Review, 5:229- 251, 2011. (With A. Castaneda and S. Rajsbaum, UNAM Mexico). [R126] Implementing a Regular Register in an Eventually Synchronous Distributed System prone to Continuous Churn. IEEE Transactions on Parallel and Distributed Systems, 23(1):102-109, 2012. (With S. Bonomi, R.Baldoni, Roma). [R127] Help when needed, but no more: an efficient partial snapshot algorithm. Journal of Parallel and Distributed Computing, 72(1):1-12, 2012. (With D. Imbs.) [R128] Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations). Theoretical Computer Science, 444:113-127, 2012. (with D. Imbs.) [R129] Specifying and Implementing an Eventual Leader Service for Dynamic Systems. International Journal of Web and Grid Services, 8(3):204-224, 2012. (With Larrea M., Soraluze I. and Roberto Cortias R., San Sebastian, Spain.) [R130] No double discount: condition-based simultaneity yields limited gain. Information and Computation, 214:45-56, May 2012. (With Y. Moses, Israel). [R131] From the Happend-Before Relation to the Causal Ordered Set Abstraction. Journal of Parallel and Distributed Computing, 72:791-795, 2012. (With S. Pomarez and J.R. Perez Cruz, Puebla University, Mexico). [R132] Computability in distributed computing: a tutorial. ACM Sigact News, Distributed Computing Column, 43(3), pp. 80-102, 2012. (With M. Herlihy, S. Rajsbaum.) [R133] Anonymous Asynchronous Systems: the Case of Failure Detectors, Distributed Computing, 26(3):141-158, 2013. (With F. Bonnet). [R134] The Weakest Failure Detector to Implement a Register in Asynchronous Systems with Hybrid Communication. Theoretical Computer Science, 512:130-142, 2013. (With D. Imbs). [R135] Towards a universal construction for transaction-based multiprocess programs. Theoretical Computer Science, 496:154-169, 2013. (With T. Crain, D. Imbs). [R136] Trust-Aware Peer Sampling: Performance and Privacy Tradeoffs. Theoretical Computer Science, 512:67-83, 2013. (With Frey D., Jegou A., Kermarrec A.-M., and Stainer J.) [R137] Power and limits of distributed computing shared memory models. Theoretical Computer Science, 509:3- 24, 2013. (With M. Herlihy, S. Rajsbaum). [R138] Computabilidad distribuida. (In Spanish.) Miscelanea Mathematica, 56:113-144, 2013 (ISSN-1665-5478). (With M. Herlihy, S. Rajsbaum). [R139] An introductory tutorial to concurrency-related distributed recursion. Bulletin of the European Association of TCS, 111:57-75, October 2013. (With S. Rajsbaum.) [R140] Generalized Symmetry Breaking Tasks. To appear in SIAM Journal of Computing. (With A. Castaneda, D. Imbs, and S. Rajsbaum).
6. Publications: articles in PEER-REVIEWED CONFRENCES and WORKSHOPS [C1] Minimizing command language in a system based on a high level language. IFIP Conference on Command Languages, North-Holland 1975, pp. 117-135, Lund (Sweden), 1974 (with D. Herman, L. Trilling, J.-P. Verjus). [C2] A standard prelude for a multi-user operating system based on Algol 68. Int’l Conference on Algol 68, pp. 190-202, Stillwater (Oklahoma) 1975 (with Y. Bekkers, D. Herman, J.-P. Verjus). [C3] Communication between processes and the process management in SAR. Conference on Experience with Algol 68, Liverpool (U.K.) 1975 (with Y. Bekkers, D. Herman, J.-P. Verjus). [C4] Faults and remedies of compile-time protection methods. 5th Annual IFIP W.G.2.1 Conference on the Implementation and the Design of Algorithmic Languages, pp. 102-110, Guidel (France), 1977 (with Y. Bekkers, Ph. Darondeau). [C5] A model of inter-context control transfer. 7th Congress of the Gesellschatft fûr Informatik, Springer1977 (with Ph. Darondeau, T. Muntean). [C6] Types abstraits et pluralité de leurs représentations à l’exécution. 3ème Colloque International sur la programmation, Paris, Dunod, pp. 263-278, 1978 (with M. Banatre, A. Couvert, D. Herman). [C7] Présentation et évaluation du projet SOC : Un système d’objets conservés typés. Actes du Congrès AFCET, Gif-sur-Yvette, Ed. Hommes et Techniques, pp. 446-456, 1978 (with M. Banatre, A. Couvert, D. Herman). [C8] Abstract specification of communication systems. Proc. First IEEE Int’l Coference on Distributed Computing Systems (ICDCS 79), Huntsville, (Alabama), EEEE Computer Press, pp. 339-346, 1979 (with Ph. Darondeau, P. Le Guernic). [C9] Synchronisation and protection features for data abstraction. Proc. 10th Congress Gesellschatft fûr Informatik, Springer, pp. 277-291, Saarbrucken (RFA), 1980 (with D. Herman). [C10] Eléments d’un langage adapt é à la communication entre processus. Actes du congrès AFCET Informatique, Nancy, Ed. Hommes et Techniques), pp.667-676, 1980 (with P. Le Guernic). [C11] Un exercice dans la conception d’un programme en termes de processus coopérants. Actes du congrès AFCET- Informatique, pp. 117-126, Gif sur Yvette, 1981. [C12] Detection of stable properties in distributed applications. (25/128). Proc. 6th ACM Symposium on Principles of Distributed Computing (PODC 87), ACM Press, pp.125-136, Vancouver, (Canada), 1987(with J.-M. Hélary, C. Jard, N. Plouzeau). [C13] An algorithm to detect token loss on a logicial ring and to regenerate lost tokens. Int’l Conference on Parallel Processing and Applications, l’Aquila (Italy), North-Holland, Parallel Processing and Applications, pp. 457- 467, 1987 (with G. Rubino). [C14] The rudiments of object distribution in a distributed system. Invited Talk. 2nd Int’l Conference on Computer and Information Sciences, Istanbul, Nova Science Pub., New York, 1988 (with C. Jard). [C15] General and efficient decentralized consensus protocols. 2nd Int’l Workshop on Distributed Algorithms (WDAG 87), Springer LNCS 312, pp. 41-57, 1987 (with J.-C. Bermond, J.-C. Konig). [C16] Controlling information transfers in distributed applications, application to deadlock detection. Int’l Conference on Parallel Processing and Applications, l’Aquila (Italy), North-Holland pp. 85-92, 1987 (with J.-M. Hélary A. Maddi). [C17] Depth-first traversal and virtual ring construction in distributed parallel systems. Proc. IFIP WG 10.3 Conference on Parallel Processing, North-Holland, Parallel Processing, pp. 333-346, Pisa (Italy), 1988 (with J.-M. Hélary). [C18] Les parcours répartis de réseaux : un outil pour la conception de protocoles. CFIP 88, (Conference Francophone sur l’Ingénierie des protocoles), Bordeaux, Eyrolles, pp. 159-170, 1988 (with J.-M. Hélary). [C19] Assigning distinct identities to sites of an anonymous distributed system. Proc. IEEE Conference on Future of Distributed Computing Systems (FTDCS), IEEE Computer Press, pp. 82-86, Hong-Kong, 1988 (with J.-M. Hélary). [C20] The meaning of synchronous distributed algorithms run on asynchronous distributed systems. Proc. 3rd Int’l Symposium on Computers and Information Sciences, (1988), Izmir (Turkey) Nova Science Pub. Ed., pp. 307-316, 1989 (with M. Adam, Ph. Ingels). [C21] Experimentation on a parallel machine is helpful to analyse distributed algorithms. Proc. Int’l Workshop on Parallel and Distributed Algorithms, Bonas (France), North-Holland, pp. 243-250, 1989 (with M. Adam, Ph. Ingels, Cl. Jard, J.-M. Jézéquel). [C22] Distributed algorithms: their nature and the problems encountered. Proc. Int’l Workshop on Parallel and Distributed Algorithms, Bonas (France), North-Holland, pp. 179-185, 1989. [C23] Characterization of a particular class of distributed snapshots. Proc. Int’l Conference on Computing and Information, North-Holland Computing and Information, Toronto (Canada), 1989 (with J.-M. ́Hélary, N. Plouzeau). [C25] Distribution of a global invariant in a parallel distributed system.Parallel Computing 89, Leiden (Holland), North-Holland, pp. 597-602, 1989. C26] Distributed computers in the design and analysis of distributed algorithms. First European Workshop on Hypercube and Distributed Computers, Rennes, (France), North-Holland, 1989. [C27] Computing particular snapshots in distributed systems. (110/354). Proc. 9th Int’l IEEE Phœnix Conference on Computers and Communications, IEEE Computer press, pp. 116-123, Scottsdale (AZ) 1990 (with J.-M. Hélary, N. Plouzeau). [C28] Order notions and atomic multicast in distributed systems. Proc. 2d IEEE Int’l Conference on future trends of Distributed Computing Systems (FTDCS), IEEE Computer Press pp. 420-427, Cairo (Egypt), 1990. [C29] Implementation & evaluation of distributed synchronization on distributed memory paarallel machines. (48/102). 2nd European Conference on Distributed Memory Computing EDMCC2, Springer LNCS 487, pp. 304-314, Munich (Germany), 1991 (with A. Couvert, R. Pédrono). [C30] A distributed solution to the k out of m resources allocation problem. (60/166). Proc. Int’l Conference on Computing and Information (ICCI’91), Springer LNCS 497, pp. 509-522, Ottawa, 1991. [C31] Implementing semaphores on a distributed memory parallel machine. Proc. Parallel Computing 91, North- Holland, pp. 407-412, London (UK), 1991. [C32] Implementation of a distributed debugger for Estelle programs. Proc. of the ERCIM Workshop on Distributed Systems, pp. 47-51, Lisboa (Portugal), 1991 (with M. Hurfin, N. Plouzeau). [C33] A general method to define quorums. (85/301).12th IEEE Int’l Conference on Distributed Computing Systems (ICDCS’92), IEEE Computer Press, pp. 657-664, Yokohama(Japan),1992 (with M. Mizuno, M. Neilsen). [C34] Synchronization and concurrency measures for distributed computations. (85/301). Proc. 12th IEEE Int’l Conference on Distributed Computing Systems (ICDCS’92), IEEE Computer Press, pp. 700-709, Yokohama (Japan), 1992 (with M. Mizuno, M. Neilsen). [C35] EREBUS: a debugger for asynchronous distributed computations. 3rd IEEE Conference on future trends in Distributed Computing Systems (FTDCS’92), IEEE Computer Press, pp. 93-98, Taipei (Taiwan), 1992 (with M. Hurfin, N. Plouzeau). [C36] FLORIA: a distributed kernel for virtual time driven applications. 4th Int’l Conference on Computing and Information (ICCI’92), IEEE Computer Press, pp. 457-460, Toronto, 1992 (with Ph. Ingels,, C. Mazeiro). [C37] Distributed evaluation: a tool for constructing distributed programs. Int’l Symposium on Theory of Computing and Systems, Springer LNCS 601, pp. 184-194, (Rodeh, Galil, Dolev Eds), Haifa (Israel), 1992 (with J.-M. Hélary). [C38] Discrete event simulation on distributed memory parallel machines. Workshop on Advances in Parallel Algorithms, IOS Press, Sofia, pp. 176-183, 1992 (with C. Maziero). [C39] From distributed mutual exclusion to readers and writers algorithms. Proc. 7th Int’l Conference ISCIS, Antalya (Turkey), pp. 129-136, 1992. [C40] Que peut apporter l’algorithmique répartie lorsque l’on est confronté aux défaillances. Invited Talk Congrès AFCET 93, Tome Sécurité et Sûreté Informatiques, pp.69-78, Versailles (France), 1993. [C41] Concepts et problèmes de l’algorithmique répartie. Invited Talk. Congrès AFCET 93, Fondements du parallélisme, pp.1-15, Versailles (France), 1993. [C42] Termination detection in a very general distributed computing model. (63/299). 13th IEEE Int’l Conference on Distributed Computing Systems (ICDCS 93), IEEE Press, pp. 374-382, 1993 (with J. Brzezinsky -Poznan University-, J.-M. Hélary). [C43] Detecting atomic sequences of predicates in distributed computations. (16/57). Proc 3rd ACM Conference on Parallel and Distributed. Debugging, ACM SIGPLAN Notices 28(12):33-42, San Diego (CA), 1993 (with M. Hurfin, N. Plouzeau). [C44] How to find his way in the jungle of consistency criteria for distributed object memories (or how to escape from Minos’ labyrinth). 4th IEEE Conf. on Future Trends of Distributed Computing Systems (FTDCS), IEEE Computer Press, pp. 340-346, Lisboa (Portugal),1993 (with M. Mizuno). [C45] Causal multicast in overlapping groups: towards a low cost approach. Proc. 4th IEEE Conference on Future Trends of Distributed Computing Systems (FTDCS), IEEE Computer Press, pp. 136-142, Lisboa (Portugal), 1993. (with A. Mostefaoui). [C47] Definition and Implementation of a Flexible Communication Primitives for Distributed Programming. (32/79). Int’l IFIP WG 10.3 Conference on Application in Parallel and Distributed Computing,North-Holland, pp. 115-124, Caracas (Venezuela), 1994 (with A. Mostefaoui). [C48] An Efficient Implementation of Sequentially Consistent Distributed Shared Memories. (32/79). Int’l IFIP WG 10.3 Conf. on Applications in Parallel and Distributed Computing,North-Holland, pp. 145-154, Caracas (Venezuela), 1994 (with M. Mizuno, G. Singh, M. Neilsen -University of Kansas-). [C49] On granularity of events in distributed computations. Invited Talk. Proc. Workshop on Specification of Parallel programs, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (K.M. Chandy and G. Blelloch Eds), 18:115-124, Princeton, 1994 (with M. Hurfin, N. Plouzeau). [C50] La mise au point des programmes répartis: un problème, quelques solutions. Invited Talk. 7èmes Journées Inter. Des Sciences Informatiques, pp. 283-302, Tunis, 1994. [C51] On-the-fly replay: a practical paradigm and its implementation for distributed debugging.(59/197) 6th IEEE Int’l Symposium on Parallel and Distributed Processing (SPDP), IEEE Computer Press, System Track, pp. 266-272, Dallas (TX), 1994 (with M. Hurfin, N. Plouzeau, O. Gerstel, S. Zaks -Technion-). [C52] Inevitable global states: a concept to detect unstable properties of distributed computations. (59/197). 6Th IEEE Int’l Symposium on Parallel and Distributed Processing (SPDP), IEEE Computer Press, Theory Track, pp. 242-248, Dallas (TX), 1994 (with E. Fromentin). [C53] On the fly testing of regular patterns in distributed computations. (28/118). Proc. 23th Int’l Conference on Parallel Processing (ICPP), Vol.II, pp. 73-78, Pennsylvania State University, Illinois, 1994 (with E. Fromentin, V. Garg, A. Tomlinson -Austin-). [C54] Sequential Consistency in Distributed Systems. Invited Talk. Int’l Workshop on Theory and Practice in Distributed Systems, Springer LNCS 938, pp. 224-243, Dagstuhl (Germany), 1994 (with M.Mizuno, J. Zhou). [C55] Analyzing and Debugging Distributed Executions. Invited Talk. Proc. Int’l Conference Parallel and Distributed Computing, KU Press, pp. 13-25, Koweit City, 1995. [C56] Characterizing and Detecting the set of Global States seen by all the Observers of a Distributed Computation. (60/170). Proc. 15th Int’l IEEE Conference on Distributed Computing. Systems, IEEE Computer Press, pp. 431-438, Vancouver (Canada), 1995 (with E. Fromentin). [C57] A look at replaying techniques for distributed executions. Invited Talk. Proc. 2d Int’l Workshop on Automated and Algorithmic Debugging, Saint-Malo (France), 1995 (with N. Plouzeau). [C58] Properties of communication modes in distributed systems. (74/165). Proc. IEEE Conference on Algorithms and Architectures for Parallel Processing (ICA3P2), IEEE Compute Press, pp. 501-505, Brisbane (Australia), 1995 (with R.Baldoni). [C59] An Introduction to the Analysis and Debug of Distributed Computations. (74/165). Proc. IEEE Conference on Algorithms and Architectures for Parallel Processing (ICA3P2), IEEE Compute Press, pp. 545-554, Brisbane (Australia), 1995 (with E. Fromentin, N. Plouzeau). [C60] A general definition of deadlocks for distributed systems. (74/165). Proc. ACM-IEEE Conference on Algorithms and Architectures for Parallel Processing (ICA3P2), IEEE Compute Press, pp. 324-332, Brisbane (Australia), 1995 (with J. Brzezinski -Poznan university-, J.-M. Hélary). [C61] Recognition of Patterns on Control Flows for Debugging Distributed Executions. Proc. 2d Int’l Workshop on Automated and Algorithmic Debugging (AADEBUG), Saint-Malo (France) 1995 (with E. Fromentin, C. Jard, G.V. Jourdan). [C62] Debugging distributed executions using language recognition. (20/90). Proc. 24th Int’l Conference on Parallel Processing (ICPP), Pennsylvania State University, Vol. II pp.55-62 (Software Track), Oconomowoc (WI), 1995 (with O. Babaoglu -University of Bologna-, E. Fromentin). [C63] Efficient Causally Ordered Communications for Multimedia Real-Time Applications. (20/68). Proc. 4th IEEE Int’l Symposium on High Performance Distributed Computing (HPDC), IEEE Computer Press, pp.140-147, Washington DC, 1995 (with R. Baldoni, A. Mostefaoui). [C64] Deadlocks in distributed systems: request Models and Definitions. Invited Talk. Proc. 5th IEEE Int’l Conference on Future Trends of Distributed Computing Systems (FTDCS), IEEE Computer Press, pp. 186-193, Cheju (South Korea), 1995 (with J. Brzezinski -Poznan university-, J.-M. Hélary). [C65] Modeling consistent checkpoints and the domino effect in large scale distributed systems. Proc. 5th IEEE Int’l Conference on Future Trends of Distributed Computing Systems (FTDCS), IEEE Computer Press, pp. 314-323, Cheju (South Korea), 1995 (with R. Baldoni, J. Brzezinski -Poznan university-, J.- M. Héllary, A. Mostefaoui). [C66] Expressing and Detecting Control Flows Properties of Distributed Computations. (99/249). Proc. 7Th Int’l IEEE Symposium on Parallel and Distributed Processing (SPDP), IEEE Computer Press, pp. 432-438, San Antonio, (TX), 1995 (with E. Fromentin, V. Garg). [C67] From causal consistency to sequential consistency in shared memory systems. Proc. 15th Int’l Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), Springer LNCS 1026, pp. 180-194, Bangalore (India), 1995 (with A. Schiper). [C68] A synchronization measure for communication modes in distributed systems. Proc. 14th Int’l Conference on Applied Informatics, pp. 204-207, Innsbruck (Austria), 1996 (with R. Baldoni, G. Cioffi -University of Roma-). [C69] Causal multicast in unreliable networks for multimedia applications. 15th IEEE Int’l Phoenix Conference on Computers and Communications, IEEE Computer Press, pp. 51-57, Phoenix (AZ) 1996 (with R. Baldoni, A. Mostefaoui). [C70] An informal introduction to distributed algorithms. Invited Talk. Int’l Conference on Distributed systems, Salvador de Bahia (Brazil), 1996. [C71] An efficient causal ordering algorithm for mobile computing environment. (86/295). Proc. 15th IEEE Int’l Conference on Distributed Computing Systems (ICDCS), IEEE Computer Press, pp. 744-751, Hong-Kong, 1996 (with M. Singhal, R. Prakash -Ohio state university-). [C72] Quorum-based solutions to the h out of k mutual exclusion problem. 4th Int’l Workshop on Parallel Systems and Algorithms (PASA4), World Scientific Pub., Lubeck (Germany) 1996 (with R. Baldoni, Y. Manabe -ntt, Japan-). [C73] Broadcast with time and causality constraints for multimedia applications. 22d EUROMICRO Conference, IEEE Computer Press, pp.617-624, Pragua (Czech Republic), 1996 (with R. Baldoni, M. Singhal, R. Prakash -Ohio state university-). [C74] Weakening transactions to fit the need of cooperative applications. Int’l Conference on Information, Systems, Analysis and Synthesis (ISAS), pp.531-538, Orlando (FL), 1996 (with G. Thia-kime). [C75] Detecting diamonds necklaces in labeled directed acyclic graphs (a problem from distributed debugging. 22Th Int’l Workshop on Graph Theoretic Concepts in Computer Science. Springer LNCS 1197, pp. 211-223, Lago di Como (Italy), 1996 (with M. Hurfin). [C76] Reducing the number of messages logged in uncoordinated checkpointing algorithms. (26/76). 2d European Dependable Computing Conference (EDCC2), Springer LNCS 1150, pp.353-364, Taormina (Italy), 1996 (with A. Mostefaoui). [C77] Efficient distributed detection of conjunction of local predicates in asynchronous computations. (81/217). Proc. 8th Int’l IEEE Symposium on Parallel and Distributed Processing (SPDP), IEEE Computer Press, pp. 588-594, New-Orleans, October 1996 (with M. Hurfin, M. Mizuno, M. Singhal). [C78] A suite of formal definitions for consistency criteria in distributed shared memories. Proc. 9-th Int’l IEEE Conference on Parallel and Distributed Computing Systems (PDCS), IEEE Computer Press, pp. 125-131, Dijon (France), 1996 (with A. Schiper). [C79] Static and dynamic adaptation of transactional consistency. (70/180). Proc. 30th International Conference on Systems Sciences (HICSS), Vol I, pp. 533-542, Maui (Hawai), 1997 (with O. Theel). [C80] Consistent State Restoration in Shared Memory Systems. (59/167). Proc. Int’l IEEE Conference on Advances in Parallel and Distributed Computing (APDC), IEEE Computer Press, pp. 330-337, Shanghai (China), 1997 (with R. Baldoni, A. Mostefaoui). [C81] Real-time dependable decisions in timed asynchronous distributed systems. Proc. 3rd Int’l IEEE Workshop on Object-Oriented Real-time Distributed Systems (WORDS), IEEE Computer Press, pp. 283- 290, Newport Beach (CA) 1997. [C82] Revisiting the non-blocking atomic commitment problem in distributed systems. Invited Talk. Proc. 2d IPPS IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems, IEEE Computer Press, pp. 116-133, Genève (Switzerland), 1997. [C83] A communication-induced checkpointing protocol that ensures the rollback-dependency trackability property. (42/122). 27th IEEE Symposium on Fault-Tolerant Computing Systems (FTCS), IEEE Computer Press, pp. 68-77, Seattle (WA), 1997 (with R. Baldoni, J.-M. Hélary, A. Mostefaoui). [C84] From serializable to causal transactions for collaborative applications. 23th EUROMICRO Conference, IEEE Press, pp. 314-321, Budapest (Hungary), 1997 (with G. Thiakime, M. Ahamad Georgia Tech-). [C85] Preventing useless checkpoints in distributed computations. (20/72). 16th IEEE Symposium on Reliable Distributed Systems (SRDS), IEEE Computer Press, pp. 183-190, Durham (VG), 1997 (with J.- M. Hélary, A. Mostefaoui, R. Netzer). [C86] A case study of Agreement Problems in Distributed Systems. Proc. 2d Int’l IEEE Workshop on High Assurance Systems Engineering (HASE), IEEE Computer Press, pp. 156-164, Washington DC, 1997. [C87] Virtual precedence in asynchronous systems: concept and applications. (20/59). 11th Int’l Workshop on Distributed Algorithms (WDAG), Springer LNCS 1320, pp. 170-184, Saarbrucken (Germany), 1997 (with J.-M. Helary, A. Mostefaoui). [C88] Implementing train applications based on the distributed shared memory paradigm. Proc. 14Th IFIP/IFAC Int’l Conference on Distributed Computer Control Systems (DCCS), pp. 191-196, Seoul (South Korea), 1997 (with G. Bae, G. Thiakime). [C89] Cycle prevention in distributed checkpointing. Invited Talk. Proc. Int’l symposium On Principles Of Distributed Systems (OPODIS), Hermès pp. 309-318, Chantilly (France), 1997, (with J.-M. Helary, A. Mostefaoui). [C90] Exploiting write semantics in implementing partially replicated causal objects. (28/89). Proc. 6th EUROMICRO Conference on Parallel and Distributed Processing (PDP’98), IEEE Computer Press, pp. 157-163, Madrid (Spain), 1998. [C91] A practical building block for solving agreement problems in asynchronous distributed systems. Proc. 17Th IEEE Int’l Performance, Computing and Communications Conference, IEEE Computer Press, pp. 25-31, Phoenix (AZ), 1998 (with M. Hurfin, F. Tronel). [C92] Asynchronous protocols to meet real-time constraints: is it really sensible? How to proceed ? Invited talk. Proc. First Int’l IEEE Symposium on Object-Oriented Real-Time Distributed Computing (ISORC), IEEE Computer Press, pp. 290-297, Kyoto (Japan), 1998 (with M. Hurfin). [C93] An adaptive protocol for implementing causally consistent distributed services. (68/305). 18th IEEE Int’l Conference on DIStributed Computing Systems (ICDCS), IEEE Computer Press, pp. 86-93, Amsterdam (Netherlands), 1998 (with M. Ahamad, G. Thiakime). [C94] Communication-induced determination of consistent snapshots. (47/199). 28th IEEE Int’l Symposium on Fault-Tolerant Computing (FTCS), IEEE Computer Press, pp. 208-217, Munich (Germany), 1998 (with J.-M. Hélary, A. Mostefaoui). [C95] Fault-tolerant total order multicast for asynchronous groups. 17th IEEE Symposium on Reliable Distributed Systems, (SRDS), IEEE Computer Press, pp. 228-234, Purdue, 1998 (with U. Fridzke, Ph. Ingels, A. Mostefaoui). [C96] Consensus in asynchronous systems where processes can crash and recover. 17th IEEE Symposium on Reliable Distributed Systems, (SRDS), IEEE Computer Press, pp. 280-286, Purdue, 1998 (with M. Hurfin, A. Mostefaoui). [C97] Lifetime-based consistency for distributed objects. (28/87). 12th Int’l Symposium on DIStributed Computing (DISC), (Previously WDAG), Springer LNCS 1499, pp. 378-392, Andros (Greece), 1998 (with M. Ahamad, F. Torres -Georgia Tech-). [C98] Probabilistic Analysis of a Group Failure Detection Protocol. Proc. 4th Int’l IEEE Workshop on Object- Oriented Real-time Distributed Systems (WORDS 99), IEEE Computer Press, pp. 156-162, Santa Barbara (CA), 1999 (with R. Bollo, J.-P. Le Narzul, F. Tronel). [C99] Rollback Dependency Trackability: Visible Characterizations. (27/95). 18th ACM SIGACT-SIGOPS Int’l Symposium on Principles of Distributed Computing (PODC’99), ACM Press, pp. 33-42, Atlanta, 1999 (with R. Baldoni, J.-M. Hélary). [C100] Timed Consistency for Shared Distributed Objects. (27/95). 18th ACM Int’l Symposium on Principles of Distributed Computing (PODC’99), ACM Press, pp. 163-172, Atlanta, 1999 (with M. Ahamad, F. Torres -Georgia Tech-). C101] On Classes of Problems in Asynchronous Distributed Systems with Process Crashes. Best Paper Award (57/173). 19th IEEE Int’l Conference on Distributed Computing Systems (ICDCS), IEEE Computer 470-477, Austin (TX), 1999 (with E. Fromentin, F. Tronel). [C102] Logical clocks for unreliable process groups. Int’l Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’99), pp. 2272-2278, Las Vegas (NV), 1999 (with A. Mostefaoui). [C103] Efficient Logically Instantaneous Communications in Asynchronous Distributed Systems. (47/103). 5th Int’l Conference on Parallel Computing Technologies (PaCT’99), Springer LNCS 1662, pp. 258-270, St-Petersburg (Russia), 1999 (with A. Mostefaoui, P. Verissimo). [C104] Consistent Lamport’s clocks for asynchronous groups with process crashes. (47/103). 5th Int’l Conference on Parallel Computing Technologies (PaCT’99), Springer LNCS 1662, pp. 98-107, St-Petersburg (Russia), 1999 (with A. Mostefaoui, M. Takizawa -Tokyo-). [C105] Illustrating the Use of Vector Clocks in Property Detection: an Example and a Counter-Example. (115)341). Proc. 5th Int’l European Parallel Computing Conference (EUROPAR’99), Springer LNCS 1685, pp. 806-814, Toulouse (France), 1999. [C106] Consistent checkpointing for distributed databases. (115 (regular papers)/341). Proc. 5th Int’l European Parallel Computing Conference (EUROPAR’99), Springer LNCS 1685, pp. 450-458, Toulouse (France), 1999 (with R. Baldoni, F. Quaglia -University of Roma-). [C107] A general framework to solve agreement problems. (26/61). 18th IEEE Symposium on Reliable Distributed Systems, (SRDS’99), IEEE Computer Press, pp. 56-67, Lausanne (Switzerland), 1999 (with M. Hurfin, R. Macedo, F. Tronel). [C108] Simple Vector Clocks are Limited to Solve some Causality-Related Problems. Invited talk. Proc. Int’l Symposium On Principles Of DIstributed Systems (OPODIS’99), pp. 199-208, Hanoi (Vietnam) 1999. [C109] Direct dependency-Based Determination of Consistent Global Checkpoints. Proc. Int’l Symposium On Principles Of DIstributed Systems (OPODIS’99), pp. 11-28, Hanoi, Vietnam, 1999 (with R. Baldoni, G. Cioffi, J.-M. Hélary). [C110] Solving Consensus Using Chandra-Toueg’s Unreliable Failure Detectors: a General Quorum-Based Approach. (23/60). Proc. 13th Int’l Symposium on Distributed Computing (DISC’99), Springer LNCS 1693, pp. 49-63, (P. Jayanti Ed.), Bratislava (Slovaquia), 1999 (with A. Mostefaoui). [C111] Unreliable failure Detector with Limited Scope Accuracy and an Application to Consensus. (30/84). Proc. 19th Int’l Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), Springer LNCS 1738, pp. 329-340, Chennai (India), 1999 (with A. Mostefaoui). [C112] Computing Global Functions in Asynchronous Distributed Systems with Process Crashes. (76/187). Best Paper Award.20th IEEE Int’l Conference on Distributed Computing Systems (ICDCS), IEEE Computer Press, pp. 584-591, Taipei (Taiwan), 2000 (with J.-M. Hélary, M. Hurfin, A. Mostefaoui, F. Tronel). [C113] Atomic Broadcast in Asynchronous Crash-Recovery Distributed Systems. (76/187). 20th IEEE Int’l Conference on Distributed Computing Systems (ICDCS), IEEE Computer Press, pp. 288-295, Taipei (Taiwan), 2000 (with L. Rodrigues -Lisbon-). [C114] Deadline-Constrained Causal Order. Proc. Third Int’l IEEE Symposium on Object-Oriented Real-Time Distributed Computing (ISORC), IEEE Computer Press, pp. 234-241, Newport Beach (CA), 2000 (with E. Anceaume, R. Baldoni, L. Rodrigues). [C115] Consensus Based on Failure Detectors with a Perpetual Weak Accuracy Property. (107/303). Proc. IEEE Int’l Parallel and Distributed Processing Symposium (IPDPS), IEEE Computer Press, pp..514-519, Cancun (Mexico), 2000 (with A. Mostefaoui). [C116] Consensus Based on Strong Failure detectors: Time and Message Efficient Protocol. Proc. Int’l Workshop on Fault-Tolerant Parallel and Distributed Systems, (in conjunction with the Int’l IEEE Conference on Parallel and Distributed Processing Symposium -IPDPS-), Springer, LNCS 1800, pp. 1258-1267, Cancun (Mexico), 2000 (with F. Greve, A. Mostefaoui, R. Macedo). [C117] The best of both worlds: a hybrid approach to solve consensus. Int’l IEEE/IFIP Conference on Dependable Systems and Networks (previously IEEE Symposium on Fault-Tolerant Systems), IEEE Computer Press, pp. 513-522, New York, 2000 (with A. Mostefaoui, F. Tronel). [C118] From crash fault-tolerance to Byzantine fault-tolerance: towards a modular approach. Int’l IEEE/IFIP Conference on Dependable Systems and Networks (previously IEEE Symposium on Fault-Tolerant Systems),IEEE Computer Press, pp. 273-282, New York, June 2000 (with R. Baldoni, J.-M. Hélary). [C119] Consensus in Byzantine Asynchronous Distributed Systems. 7th Int’l Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton University Press, pp. 1-15, L’Aquila (Italy) 2000 (with R. Baldoni, J.-M. Hélary, L. Tanguy). [C120] Tracking Causality in Distributed Systems: a Suite of Efficient Protocols. 7th Int’l Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton University Press, pp. 181-195, L’Aquila (Italy), 2000 (with J.-M. Hélary, G. Melideo). [C121] k-Set Agreement and Limited Accuracy Failure Detectors. 19th ACM Int’l Symposium on Principles of Distributed Computing (PODC’00), ACM Press, pp. 143-152, Portland (OR), 2000 (with A. Mostefaoui). [C122] Quorum-Based Replication in Asynchronous Crash-Recovery Distributed Systems. (167/326). Proc. 6th Int’l European Parallel Computing Conference (EUROPAR’00), Springer LNCS 1900, pp. 554-558, Munich (Germany), 2000 (with L. Rodrigues). [C123] Logical Instantaneity and Causal Order: Two First Class Communication Modes for Parallel Computing. Invited Talk. Proc. 6th Int’l European Parallel Computing Conference (EUROPAR), Springer LNCS 1900, pp. 13-20, Munich (Germany), 2000. [C124] Low-Cost Consensus-Based Atomic Broadcast. (21/44). 7th IEEE Pacific Rim Int’l Symposium on Dependable Computing (PRDC’2000), IEEE Computer Press, pp. 45-52, UCLA, Los Angeles (CA), 2000. (with A. Mostefaoui). [C125] Realtime Based Strong Consistency for Distributed Objects. Proc. 5th Int’l IEEE Workshop on Object-Oriented Real-time Distributed Systems (WORDS’01), IEEE Computer Press, pp. 161-168, Roma (Italy), 2001 (with M. Ahamad, F. Torres -Georgia Tech-). [C126] Primary component asynchronous group membership as an instance of a generic agreement framework. (48/102). Proc. 5th IEEE Int’l Symposium on Autonomous Decentralized Systems (ISADS), IEEE Computer Press, pp. 93-100, Dallas (TX), 2001 (with F. Greve, M. Hurfin , F. Tronel). [C127] Shared State Consistency for Time-Sensitive Distributed Applications. (72/210). Best paper award. 21th IEEE Int’l Conference on Distributed Computing Systems (ICDCS), IEEE Computer Press, pp. 606-614, Phoenix (AZ), 2001 (with V. Krishnaswamy, M. Ahamad, D. Bakken -Georgia Tech-). [C128] A Condition for k-Set Agreement in Asynchronous Distributed Systems. (48/276). Proc. IEEE Int’l Parallel and Distributed Processing Symposium (IPDPS’01), (15th IPPS/12th SPDP), IEEE Computer Press, San Francisco (CA), 2001 (with A. Mostefaoui). [C129] Randomized Multivalued Consensus. Proc. Fourth Int’l IEEE Symposium on Object-Oriented Real-Time Distributed Computing (ISORC’01), IEEE Computer Press, pp. 195-200, Magdeburg (Germany), 2001 (with P. Ezhilchelvan, A. Mostefaoui). [C130] Conditions on Input Patterns for Consensus Solvability in Asynchronous Distributed Systems. (83/230). 33rd ACM Symposium on Theory of Computing (STOC’01), ACM Press, pp. 153-162, 2 Crete (Greece), 2001 (En collaboration avec A. Mostefaoui, S. Rajsbaum). [C131] Randomized k-Set Agreement. (34/93). 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA’01), ACM Press, pp. 291-297, Crete (Greece), 2001 (with A. Mostefaoui). [C132] A Hierarchy of Conditions for Consensus Solvability. (29/102). 20th ACM SIGACT-SIGOPS Int’l Symposium on Principles of Distributed Computing (PODC’01), ACM Press, pp. 151-160, Newport (RI), 2001 (with A. Mostefaoui, S. Rajsbaum, M. Roy). [C133] Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles. (36/81). 6th Int’l Conference on Parallel Computing Technologies (PaCT’01), Novosibirsk, Springer LNCS 2127, pp. 98-111, 2001. [C134] Consensus in One Communication Step. (36/81). 6th Int’l Conference on Parallel Computing Technologies (PaCT’01), Novosibirsk, Springer LNCS 2127, pp. 42-50, 2001 (with F. Brasileiro, F. Greve, A. Mostefaoui). [C135] Efficient Condition-Based Consensus. 8th Int’l Colloquium on Structural Information and Communication Complexity (SIROCCO’01), Carleton University Press, pp. 275-291, Val de Nuria (Catalonia, Spain), 2001(with A. Mostefaoui, S. Rajsbaum, M. Roy). [C136] Building TMR-Based Reliable Servers Despite Bounded Input Lifetime. Proc. 7th Int’l European Parallel Computing Conference (EUROPAR’01), Springer LNCS 2150, pp. 482-485, Manchester (UK), 2001 (with P. Ezhilchelvan, J.M. Helary). [C137] A Consensus Protocol Based on a Weak Failure Detector and a Sliding Round Window. (21/65). 20th IEEE Symposium on Reliable Distributed Systems, (SRDS’01), IEEE Computer Press, pp. 120-129, New-Orleans, 2001 (with M. Hurfin, R. Macedo, A. Mostefaoui). [C138] An Adaptive Failure Detection Protocol. (33/80). 8th IEEE Pacific Rim Int’l Symposium on Dependable Computing (PRDC’2001), IEEE Computer Press, pp. 146-153, Seoul (South Korea), 2001 (with C. Fetzer, F. Tronel). [C139] Approximate Real-Time Clocks for Scheduled Events. Proc. 5th Int’l IEEE Symposium on Object-Oriented Real-Time Distributed Computing (ISORC’02), IEEE Computer Press, pp. 53-61, Washington DC, 2002 (with C. Fetzer). [C140] Wait-Free Objects for Real-Time Systems (Position paper). Proc. 5th Int’l IEEE Symposium on Object-Oriented Real-Time Distributed Computing (ISORC’02), IEEE Computer Press, pp. 413-420, Washington DC, 2002. [C141] A Versatile and Modular Consensus Protocol. (48/156). Int’l IEEE/IFIP Conference on Dependable Systems and Networks (DSN’02), (previously, FTCS), IEEE Computer Press, pp. 364-373, Washington DC, 2002 (with A. Mostefaoui, S. Rajsbaum). [C142] Ordering vs Timeliness: two Facets of Consistency? Invited Talk. In Future Directions in Distributed Computing (FuDiCo), Springer LNCS 2584, pp. 73-77, Bertinoro (Italy), 2002 (with M. Ahamad). [C143] Using Error-Correcting Codes to Solve Distributed Agreement Problems: a Future Direction in Distributed Computing ? Invited talk. In Future Directions in Distributed Computing (FuDiCo), Springer LNCS 2584, pp. 17-21, Bertinoro (Italy), 2002 (with R. Friedman, A. Mostefaoui, S. Rasjbaum). [C144] Tracking Immediate Predecessors in Distributed Computations. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA’02), ACM Press, pp. 210-219, Winnipeg (Canada), 2002 (with E. Anceaume, J.M. Helary). [C145] Asynchronous Distributed Agreement and its Relation with Error Correcting Codes. (23/75). Proc. 16Th Int’l Symposium on DIStributed Computing (DISC’02), Springer LNCS 2508, pp. 63-87, Toulouse (France), 2002 (with R. Friedman, A. Mostefaoui, S. Rajsbaum). [C146] The Lords of the Rings: Efficient Maintenance of Views at Data Warehouses. (23/75). Proc. 16th Int’l Symposium on DIStributed Computing (DISC’02), Springer LNCS 2508, pp. 33-47, Toulouse ((France), 2002 (with A. Mostefaoui, M. Roy, A. El Abbadi, D. Agrawal). [C147] Condition-Based Protocols for Set Agreement Problems. (23/75) Proc. 16th Int’l Symposium on DIStributed Computing (DISC’02), Springer LNCS 2508, pp. 48-62, Toulouse (France), 2002 (with A. Mostefaoui, S. Rajsbaum, M. Roy). [C148] Sequential Consistency as Lazy Linearizability. (119/300). Proc. First Eurasia ICT-2002: Information and Communication Technology, Springer LNCS 2510, pp. 866-873, Shiraz (Iran), 2002. [C149] An Introduction to the Renaming Problem. (29/63). 9th IEEE Pacific Rim Int’l Symposium on Dependable Computing (PRDC’2002), IEEE Computer Press, pp. 121-124, Tsukuba (Japan), 2002. [C150] Consensus in Synchronous Systems: a Concise Guided Tour. (29/63). 9th IEEE Pacific Rim Int’l Symposium on Dependable Computing (PRDC’2002), IEEE Computer Press, pp. 221-228, Tsukuba (Japan), 2002. [C151] An Optimal Atomic Broadcast Protocol and Implementation Framework. 8th Int’l IEEE Workshop on Object-Oriented Real-Time Dependable Systems (WORDS’2003), IEEE Computer Press, pp. 32-39, Guadalajara (Mexico), 2003 (with P. Ezhilchelvan). [C152] Reliable Compare&Swap for Fault-Tolerant Synchronization. Invited Talk. 8th Int’l IEEE Workshop on Object-Oriented Real-Time Dependable Systems (WORDS’2003), IEEE Computer Press, pp. 50-55, Guadalaraja (Mexico), 2003. [C153] Token-Based Sequential Consistency in Asynchronous Distributed Systems. (68/219). 17th Int’l IEEE Conference on Advanced Information Networking and Applications (AINA’03), IEEE Computer Press, pp. 421-427, Xian (China), 2003. [C154] Uniform Agreement despite Process Omission failures. Invited Talk. Proc. Int’l Workshop on Fault-Tolerant Parallel and Distributed Systems, (in conjunction with the Int’l IEEE Conference on Parallel and Distributed Processing Symposium (IPDPS’03), IEEE Computer Press, Nice (France), 2003 (En collaboration avec Ph. Raipin-Parvedy.) [C155] A Generic Framework for Indulgent Consensus. (72/406) 23th IEEE Int’l Conference on Distributed Computing Systems (ICDCS’03), IEEE Computer Society Press, pp. 88-97, Providence (RI), 2003 (with R. Guerraoui). [C156] Elastic Vector Time. (72/406). 23th IEEE Int’l Conference on Distributed Computing Systems (ICDCS’03), IEEE Computer Press, pp. 284-291, Providence (RI), 2003 (with C. Fetzer). [C157] Looking for a common view for mobile worlds. 9th IEEE Conference on Future Trends of Distributed Computing Systems (FT DCS’03). IEEE Computer Press, pp. 159-165, Porto Rico, 2003 (with M. Gradinariu, G. Simon). [C158] Nested Invocation Protocol on Object-based Systems. Proc. 6th Int’l IEEE Symposium on Object-Oriented Real-Time Distributed Computing (ISORC’03), IEEE Computer Society Press, Hakodate (Hokkaido, Japan), 2003 (with K. Hori, T. Enokido and M. Takizawa -Tokyo-). [C159] Anonymous Publish/Subscribe in Peer-to-Peer Network Systems. Proc. IEEE Int’l Parallel and Distributed Processing Symposium (IPDPS’03), IEEE Computer Press, Nice (France), 2003 (with A. Datta, M. Gradinariu, G. Simon). [C160] Asynchronous Implementation of Failure Detectors. (45/146). Int’l IEEE Conference on Dependable Systems and Networks (DSN’03), (Track: Dependable Computing and Communications Symposium), IEEE Computer Press, pp. 351-360, San Francisco (CA), 2003 (with A. Mostefaoui, E. Mourgaya). [C161] Evaluating the Condition-Based Approach to solve Consensus. (28/79). Int’l IEEE Conference on Dependable Systems and Networks (DSN’03), (Track: Performance and Dependability Symposium (IPDS)), IEEE Computer Press, pp. 541-550, San Francisco (CA), 2003 (with A. Mostefaoui, E. Mourgaya, Ph. Raipin Parvedy). [C162] The Condition-based Approach in Distributed Computing. Invited talk. 10th Int’l Workshop on Expressiveness in Concurrency (Express’03), (Satellite Workshop of CONCUR’03), Electronic Notes in Theoretical Computer Science, Vol. 3, p. 79, Marseille (France), 2003. [C163] A Hierarchy of Conditions for Asynchronous Interactive Consistency. 7th Int’l Conference on Parallel Computing Technologies (PaCT’03), Springer LNCS 2763, pp. 130-140, Nizhni Novgorod (Russia), 2003 (with A. Mostefaoui, S. Rajsbaum, M. Roy). [C164] The Renaming Problem as an Introduction to Structures for Wait-free Computing. 7th Int’l Conference on Parallel Computing Technologies (PaCT’03), Springer LNCS 2763, pp. 151-164, Nizhni Novgorod (Russia), 2003. [C165] Using Conditions to Expedite Consensus in Synchronous Distributed Systems. (25/91). Proc. 17th Int’l Symposium on DIStributed Computing (DISC’03), Springer LNCS 2848, pp. 249-263, Sorrento (Italy), 2003 (with A. Mostefaoui, S. Rajsbaum). C166] A Distributed Implementation of Sequential Consistency with Multi-Object Operations. (84/475). 24th IEEE Int’l Conference on Distributed Computing Systems (ICDCS’04), IEEE Computer Society Press, pp. 544-551, Tokyo, 2004 (with K. Vidyasankar -Newfoundland University, Canada-). [C167] A Hybrid Approach for Building Eventually Accurate Failure Detectors. (32/104). 10th IEEE Pacific Rim Int’l Symposium on Dependable Computing (PRDC’2004), IEEE Computer Society Press, pp. 57-65, Papeete (Tahiti, France), 2004 (with A. Mostefaoui, D. Powell). [C168] Optimal Early-Stopping Uniform Consensus in Synchronous Systems with Process Omission failures. 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA’04), ACM Press, pp. 302-310, Barcelona (Spain), 2004 (with Ph. Raipin Parvedy) [C169] The Synchronous Condition-Based Consensus Hierarchy. (31/142). Proc. 18th Int’l Symposium on DIStributed Computing (DISC’02), Springer LNCS 3274, pp. 1-15, Amsterdam, 2004 (with A. Mostefaoui, S.Rajsbaum). [C170] On the Respective Power of <>P and <>S to Solve One-Shot Agreement Problems. (31/142). Proc. 18th Int’l Symposium on DIStributed Computing (DISC’02), Springer LNCS 3274, pp. 41-55, Amsterdam, 2004 (with R. Friedman, A. Mostefaoui). [C171] A Methodological Construction of an Efficient Sequential Consistency Protocol. (26/85). Proc. 3rd IEEE Int’l Symposium on Network Computing and Applications (NCA’04), IEEE Computer Press, pp. 141-148, Kendall Square, Cambridge (MA), 2004 (with V. Cholvi, A. Fernandez, E. Jimenez -Madrid-). [C172] Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems. (27/117). 23th IEEE Symposium on Reliable Distributed Systems (SRDS’04), IEEE Computer Press, pp. 228-237, Florianopolis (Brazil), 2004 (with R. Friedman, A. Mostefaoui). [C173] Crash-Resilient Time-free Eventual Leadership. (27/117). 23th IEEE Symposium on Reliable Distributed Systems (SRDS’04), IEEE Computer Society Press, pp. 208-217, Florianopolis (Brazil), O 2004 (with A. Mostéfaoui, C. Travers). [C174] Oracles pour la tolérance aux fautes dans les systèmes répartis. Invited talk. 7ème Colloque Africain sur la Recherche Informatique (CARI’04), Hammamet (Tunisie), 2004. [C175] On the Benefits of the Functional Modular Approach in Distributed Data Management Systems. Invited talk. Proc. First IEEE Workshop on Dependable Distributed Data Management (WDDDM’04, SRDS’04 satellite workshop), IEEE Computer Society Press, pp. 1-6, Florianopolis (Brazil), 2004 (with R. Friedman). [C177] A simple protocol offering both atomic consistent read operations and sequentially consistent read operations. 18th Int’l IEEE Conference on Advanced Information Networking and Applications (AINA’05), IEEE Computer Press, pp. 961-966, Taipei (Taiwan), March 2005 (with M. Roy, C. Tutu). [C178] Building and Using Quorums Despite any Number of Process Crashes. 5th European Dependable Computing Conference (EDCC’05), Budapest (Hungary), Springer LNCS 3463, pp. 2-19, 2005 (with R. Friedman, A. Mostefaoui). [C179] Mixed Consistency Model: Meeting Data Sharing Needs of Heterogeneous Users. (75/543). 25th IEEE Int’l Conference on Distributed Computing System (ICDCS’05), IEEE Computer Press, pp. 209-218, Columbus (Ohio), 2005 (with M. Ahamad, Z. Zhan -Georgia Tech-). [C180] Building Responsive TMR-Based Servers in presence of Timing Constraints. Proc. 8th Int’l IEEE Symposium on Object-Oriented Real-Time Distributed Computing (ISORC’05), IEEE Computer Press, pp. 267-274, Seattle (WA), 2005 (with P. Ezhilchelvan, J.-M. Hélary). [C181] A Hybrid and Adaptive Model for Fault-Tolerant Distributed Computing. Int’l IEEE Conference on Dependable Systems and Networks (DSN’05), IEEE Computer Society Press, pp. 412-421, Yokohama (Japan), 2005 (with S. Gorender, R. Macedo -Salvador de Bahia-). [C182] Early-stopping k-set agreement in synchronous systems prone to any number of process crashes. 8th Int’l Conference on Parallel Computing Technologies (PaCT’05), Krasnoyarsk (Russia), Springer LNCS 3606, pp. 49-58, 2005 (with P. Raipin Parvedy, C. Travers). [C183] Allowing atomic objects to coexist with sequentially consistent objects. 8th Int’l Conference on Parallel Computing Technologies (PaCT’05), Krasnoyarsk (Russia), Springer LNCS 3606, pp. 59-73, Sept. 2005. (En collaboration avec M. Roy.) [C184] The Combined Power of Conditions and Failure Detectors to Solve Asynchronous Set Agreement. (36/160). 24th ACM Int’l Symposium on Principles of Distributed Computing (PODC’05), ACM Press, pp. 179-188, Las Vegas (NV), 2005 (with A. Mostefaoui, S. Rajsbaum). [C185] From Static Distributed Systems to Dynamic Systems. (20/67). 24th IEEE Symposium on Reliable Distributed Systems (SRDS’05), IEEE Computer Society Press, pp. 109-119, Orlando (FL), 2005 (with A. Mostefaoui, C. Travers, S. Peterson, A. El Abbadi, D. Agrawal (-UCSB-). [C186] Intersecting Sets: a Basic Abstraction for Asynchronous Agreement Problems. (38/105). 11th IEEE Pacific Rim Int’l Symposium on Dependable Computing (PRDC’2005), IEEE Computer Press, pp. 15-22, Changsha (Hunan), (China), 2005 (with R. Friedman, A. Mostefaoui). [C187] Decision Optimal Early-stopping k-set agreement in synchronous systems prone to send omission failures. (38/105). 11th IEEE Pacific Rim Int’l Symposium on Dependable Computing (PRDC’2005), IEEE Computer Society Press, pp. 23-30, Changsha (Hunan), (China), 2005 (with P. Raipin Parvedy, C. Travers). [C188] A Note on a simple equivalence between round-based synchronous and asynchronous models. (38/105). 1th IEEE Pacific Rim Int’l Symposium on Dependable Computing (PRDC’2005), IEEE Computer Society Press, pp. 387-390, Changsha (Hunan), (China), 2005 (with M. Roy). [C189] Fault-tolerant Techniques for Concurrent Objects. 2nd Latin-American Symposium on Dependable Computing, pringer LNCS 3747, pp. 265, 2005 (with R. Guerraoui). [C190] Astractions for Implementing Atomic Objects in Distributed Systems. (30/109). 9th Int’l Conference on Principles of Distributed Systems (OPODIS’05), Springer LNCS 3974, pp. 73-87, Pisa (Italy), D2005 (with R. Friedman, C. Travers). [C191] A hierarchical consensus protocol for mobile adhoc networks. 14th Euromicro Int’l Conference on Parallel, Distributed and Network-based Processing (PDP’06), IEEE Computer Society Press, pp. 64-71, Montbéliard- Sochaux (France), 2006 (with W. Wu, J. Cao, J. Yang -Hong-Kong-). [C192] The committee decision problem. (66/224). Proc. Latin American Theoretical Informatics Symposium LATIN’06). Springer LNCS 3887, pp. 502-514, 2006 (with E. Gafni, S. Rajsbaum, C. Travers). [C193] From failure detectors with limited scope accuracy to to system wide leadership. (153/521). 19th Int’l EEE Conference on Advanced Information Networking and Applications (AINA’06), IEEE Computer Society Press, p. 81-86, Vienna (Austria) 2006 (with A. Mostefaoui, S. Rajsbaum, C. Travers). [C194] A leader Election Protocol for Eventually Synchronous Shared Memory Systems. 4th Int’l IEEE workshop on Software Technologies for Future Embedded and Ubiquitous Systems (SEUS’06), IEEE Computer Press, pp. 5-80, Gyeongju (South Korea), 2006 (with R. Guerraoui). [C195] Leader election with weak assumptions on initial knowledge, communication reliability and synchrony. 34/187) 36th Int’l IEEE Conference on Dependable Systems and Networks (DSN’06), IEEE Computer Society Press, pp. 166-175, Philadelphia (Pennsylvania), June 2006 (with A. Fernandez, E. Jimenez -Madrid-). [C196] Strongly-terminating early-stopping k-set agreement in synchronous systems with general omission failures. 3th Colloquium on Structural Information and Communication Complexity (SIROCCO’06), Springer LNCS 056, pp. 182-196, Chester (UK), 2006 (with P. Raipin Parvedy, C. Travers). [C197] From static distributed systems to dynamic systems: an approach for a first step. Invited Talk. Proc. International workshop on Dynamic Distributed Systems (IWDDS’06), in conjunction with 25th IEEE Int’l Conference in Distributed Computing Systems (ICDCS’06), IEEE Computer Society Press, Lisbon (Portugal), 2006. [C198] Irreducibility and additivity of set agreement-oriented failure detectors. 25th ACM Int’l Symposium on Principles of Distributed Computing (PODC’06), ACM Press, pp. 153-162, Denver (Colorado), 2006 (with A. Mostefaoui, S. Rajsbaum, C. Travers). [C199] The Power and Limit of adding synchronization messages for Synchronous Agreement. (64/201) Proc. 35th Int’l Conference on Parallel Processing (ICPP’06), IEEE Computer Society Press, pp. 399-406, Colombus (Ohio), 2006 (with J. Cao, W. Wu, X. Wang -Hong-Kong-). [C200] Exploring Gafni’s reduction land: from Ω k to wait-free adaptive (2p−k/p)-renaming via k-set agreement. (35/145) Proc. 20th Int’l Symposium on DIStributed Computing (DISC’06), Springer LNCS 4167, pp. 1-16, Stockholm (Sweden), 2006 (with A. Mostefaoui, C. Travers). [C201] Synchronous set agreement: a concise guided tour (including a new algorithm and a list of open problems). (41/117), 12th Int’l IEEE Pacific Rim Dependable Computing Symposium (PRDC’2006), IEEE Society Press, pp. 267-274, Riverside (CA), 2006 (with C. Travers). [C202] Core Persistence in Peer-to-peer Systems: Relating Size to Lifetime. Proc. Workshop on Reliability in Decentralized Distributed Systems (RDDS’06), Springer LNCS 4278, pp. 1470-1479, Montpellier (France), 2006 (with V. Gramoli, Anne-Marie Kermarrec, A. Mostefaoui, B. Sericola). [C203] On the fly estimation of the processes that are alive/crashed in an asynchronous message-passing system. (41/117). Proc. 12th Int’l IEEE Pacific Rim Dependable Computing Symposium (PRDC’2006), IEEE Society Computer Press, pp. 257-266, Riverside (CA), 2006 (with A. Mostefaoui, G. Tredan). [C204] Simultaneous consensus tasks: a tighter characterization of set consensus. (31 regular/245). Proc. 8Th Int’l Conference on Distributed Computing and Networking (ICDCN’06), Springer LNCS 4308, pp. 331-341, Guwahati (India), 2006 (with Y. Afek, E. Gafni, S. Rajsbaum, C. Travers). [C205] In search of the holy grail: looking for the weakest failure detector for wait-free set agreement. Invited Talk. Proc. 10th Int’l Conference On Principles Of Distributed Systems (OPODIS’06), Springer LNCS 4305, pp. 1-17, 2006 (with C. Travers). [C206] A universal construction for wait-free objects. Proc. ARES 2007 Workshop on Foundations of Fault tolerant Distributed Computing (FOFDC 2007), IEEE Society Computer Press, pp. 959-966, 2007 (with R. Guerraoui). [C207] A Timing Assumption and a t-Resilient Protocol for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems. Proc. 10th Int’l IEEE Symposium on Objects and Component-oriented Real-time Computing (ISORC 2007), IEEE Society Computer Press, pp. 71-78, Santorini (Greece), 2007(with A. Fernandez, E. Jimenez, G. Tredan). [C208] The notion of a timed register and its application to indulgent synchronization. (37/130) 19th ACM Symposium on Parallel Algorithms and Architectures (SPAA’07), San Diego (CA), ACM Press, pp. 200-209, 2007 (with G. Taubenfeld). [C209] From renaming to k-set agreement. 14th Colloquium on Structural Information and Communication Complexity (SIROCCO’07), Springer LNCS 4474, pp. 62-76, Castiglioncello (Italy), 2007 (with A. Mostefaoui, C. Travers). [C210] Electing an eventual leader in an asynchronous shared memory system. 37th Int’l IEEE Conference on Dependable Systems and Networks (DSN’07), IEEE Computer Society Press, pp. 399-408, Edinburgh (UK), 2007 (with A. Fernandez, E. Jimenez -Madrid-). [C211] Distributed slicing in dynamic systems. (71/528) 27th IEEE Int’l Conference on Distributed Computing Systems (ICDCS’07), IEEE Computer Society Press, pp. 209-218, Toronto (Canada), 2007 (with A. Fernandez, V. Gramoli, E. Jimenez and Anne-Marie Kermarrec). [C212] Eventual leader service in unreliable asynchronous systems: why? How? Invited Talk. 6th IEEE Int'l Symposium on Network Computing and Applications (NCA’07), IEEE Computer Society Press, pp. 11-21, Cambridge (MA), 2007. [C213] From unreliable objects to reliable objects: the case of atomic registers and consensus. 9th Int’l Conference on Parallel Computing Technologies (PaCT’07), Peereslavl-Zalessky (Russia), Springer LNCS LNCS 4671, pp. 47-61, 2007 (with R. Guerraoui). [C214] Towards a definition of dynamic distributed systems. 9th Int’l Conference on Parallel Computing Technologies (PaCT’07), Peereslavl-Zalessky (Russia), Springer LNCS 4671, pp. 1-14, 2007 (with R. Baldoni, M. Bertier, S. Tucci). [C215] A subjective visit to selected topics in distributed computing. Invited Talk. Proc. 21th Int’l Symposium on Distributed Computing (DISC’07), Springer LNCS 4731, pp. 5-6, 2007. [C216] Test&set, adaptive renaming and set agreement: a guided visit to asynchronous computability. (25/185). 26th IEEE Symposium on Reliable Distributed Systems (SRDS’07), IEEE Computer Society Press, pp. 93-102, Beijing (China), 2007 (with E. Gafni, C. Travers). [C217] The eventual clustered oracle and its application to consensus in MANETs. (25/185). 26th IEEE Symposium on Reliable Distributed Systems (SRDS’07), IEEE Computer Society Press, pp. 23-32, Beijing (China), 2007 (with Jiannong Cao, Weigang Wu -Hong-kong Polytechnic University-). [C218] The Eventual Leadership in Dynamic Mobile Networking Environments. Proc. 13th IEEE Pacific Rim Int'l Symposium on Dependable Computing (PRDC’07), IEEE Computer Society Press, pp. 123-130, Melbourne (Australia), 17-19, 2007 (with Jiannong Cao, Weigang Wu -Hong-kong Polytechnic University-, C. Travers). [C219] A Dual-Token-based Fault-Tolerant Mutual Exclusion Algorithm for MANETs. Proc. 3rd Int’l Conference on Mobile Ad-hoc and Sensor Networks (MSN 2007), Springer LNCS LNCS 4864, pp. 572-583, Beijing (China), 2007 (with Jiannong Cao, Weigang Wu -Hong-kong Polytechnic University-). [C220] Small-world networks: is there a mismatch between theory and practice? Proc. 11th Int’l Conference On Principles Of Distributed Systems (OPODIS’07), Springer LNCS 4878, pp. 372-385, 2007 (with F. Bonnet, A.-M. Kermarrec). [C221] From an intermittent rotating star to a leader. Proc. 11th Int’l Conference On Principles Of Distributed Systems (OPODIS’07), Springer LNCS 4878, pp. 189-203, 2007 (with A. Fernandez). [C222] Timed quorum systems for large scale and dynamic environments. Proc. 11th Int’l Conference On Principles Of Distributed Systems (OPODIS’07), Springer LNCS 4878, pp. 429-442, 2007 (with V. Gramoli). [C223] Narrowing power vs efficiency in synchronous set agreement. (30/185). Proc. 9th Int’l Conference on Distributed Computing and Networking (ICDCN’08), Springer LNCS 4904, pp. 99-111, Kolkata (India), 2008 (with A. Mostefaoui, C. Travers). [C224] Synchronization is coming back, but is it the same? Invited Talk. IEEE 22nd Int’l Conference on Advanced Information Networking and Applications (AINA’08), pp. 1-10, Okinawa (Japan), 2008. [C225] Conditions for set agreement with an application to synchronous systems. (102/638). 28th IEEE Int’l Conference on Distributed Computing Systems (ICDCS’08), IEEE Computer Society Press, pp. 663-672, Beijing (China), 2008 (with F. Bonnet). [C226] The Iterated Restricted Immediate Snapshot (IRIS) Model. (66/172). 14th Int’l Computing and Combinatorics Conference (COCOON’08), Dalian (China), Springer LNCS 5092, pp.487-496, 2008. (with S. Rajsbaum, C. Travers). [C227] On modeling fault-tolerance of gossip-based reliable multicast protocols. 37th Int’l Conference on Parallel Processing (ICPP’08), IEEE Computer Society Press, pp. 149-156, Portland (OR), 2008 (with Xiaopeng Fan, Jiannong Cao, Weigang Wu -Hong-kong Polytechnic University-). [C228] No double discount: condition-based simultaneity yields limited gain. Proc. 22th Int’l Symposium on Distributed Computing (DISC’08), Springer LNCS 5218, pp. 423-437, 2008 (with Y. Moses -The Technion-). [C229] Locks Considered Harmful: a Look at Non-traditional Synchronization. Proc. 6th Int’l Workshop on Embedded and Ubiquitous computing Systems (SEUS’08), Springer, LNCS 5287, pp. 369-380, 2008. [C230] On the solvability of anonymous partial grid exploration by mobile robots. (30 regular/102). Proc. 12th Int’l Conference On Principles Of Distributed Systems (OPODIS’08), Springer LNCS 5401, pp. 428-445, 2008. (with R. Baldoni, F. Bonnet, A. Milani). [C231] A Lock-based STM Protocol that Satisfies Opacity and Progressiveness. (30 regular/102). Proc. 12th Int’l Conference On Principles Of Distributed Systems (OPODIS’08), Springer LNCS 5401, pp. 226-245, 2008 (with D. Imbs). [C232] Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort. (24 regular/176). Proc. 10th Int’l Conference on Distributed Computing and Networking (ICDCN’09), Springer LNCS 5408, pp. 67-78, Hyderabad (India), 2009 (with D. Imbs). [C233] Large scale networked systems: from anarchy to geometric self-structuring. (24 regular/176). Proc. 10th Int’l Conference on Distributed Computing and Networking (ICDCN’09), Springer LNCS 5408, pp. 25-36, Hyderabad (India), 2009. (with A.-M. Kermarrec, A. Mostefaoui, A. Viana, G. Trédan). [C234] Shared Memory Synchronization in Presence of Failures: an Exercise-based Introduction for the Sophomore. IEEE Int’l Conference on Complex, Intelligent and Software Intensive Systems (CISIS’09), IEEE Computer Society Press, pp. 9-18, Fukuoka (Japan), 2009. [C235] Implementing a Register in a Dynamic Distributed System. (74/455). 29th IEEE Int’l Conference on Distributed Computing Systems (ICDCS’09), IEEE Computer Society Press, pp. 639-647, Montreal (Canada), June 2009. (With R. Baldoni, S., Bonomi, A.-M. Kermarrec). [C236] A versatile STM protocol with invisible read operations that satisfies the virtual world consistency condition. 16th Colloquium on Structural Information and Communication Complexity (SIROCCO’09), Springer LNCS, 5869, pp. 266-280, May 2009. (With D. Imbs). [C237] Regular Register: an Implementation in a Churn Prone Environment. 16th Colloquium on Structural Information and Communication Complexity (SIROCCO’09), Springer LNCS, 5869, pp. 15-29, May 2009. (With R. Baldoni, S., Bonomi). [C238] Software Transactional Memories: an Approach for Multicore Programming. 10th Int’l Conference on Parallel Computing Technologies (PaCT’09), Novosibirsk (Russia), Springer LNCS 5698, pp. 26-40, 2009. (With D. Imbs). [C239] Adding Dynamicity to the Uncertainty that Characterizes Distributed Systems: Challenges Ahead. Proc. Franco-Brazilian Colloquium on Advances and Challenges in Computer Science (COLIBRI’09), pp. 141-147, Bento Gonc ̧alves (Brazil), july 2009. (With R. Macedo, Salvador de Bahia, Brazil). [C240] Software Transactional Memory: What? Why? How? A New Challenge? Invited Talk. Proc. Franco-Brazilian Colloquium on Advances and Challenges in Computer Science (COLIBRI’09), pp. 5-7, Bento Gonc ̧alves (Brazil), july 2009. [C241] How to implement a shared memory in a dynamic system? Which are the constraints? Invited Talk. Int’l Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS’09), in conjunction with DISC 2009, Elche (Spain), 2009. [C242] Help when needed, but no more: Efficient Read/Write Partial Snapshot. (33/117). 23th Int’l Symposium on Distributed Computing (DISC’09), Springer LNCS 5805, pp. 142-156, 2009 (With D. Imbs). [C243] The Price of Anonymity: Optimal Consensus despite Asynchrony, Crash and Anonymity. (33/117). Proc. 3th Int’l Symposium on Distributed Computing (DISC’09), Springer LNCS 5805, pp. 341-355, 2009 (With F. Bonnet). [C244] Looking for the Weakest Failure Detector for k-Set Agreement in Message-passing Systems: Is Πk the End of the Road? Best paper award. (49/126). Proc. 11th Int’l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS’09), Springer LNCS 5873, pp. 149-164, 2009 (With F. Bonnet). [C245] Visiting Gafni’s Reduction Land: from the BG Simulation to the Extended BG Simulation. (49/126). Proc. 11Th Int’l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS’09), Springer LNCS 5873, pp. 369-383, 2009 (With D. Imbs). [C246] Joining a Distributed Shared Memory Computation in a Dynamic Distributed System. Proc. 7th Workshop on Software Technologies for Future Embedded and Ubiquitous Computing Systems (SEUS’09), Springer LNCS 5860, pp. 91-102, 2009 (With R. Baldoni, S. Bonomi). [C247] D2HT: the best of both worlds, Integrating RPS (Random Peer Sampling) and DHT. 8th European Dependable Computing Conference (EDCC’10). IEEE Computer Society Press, Valencia (Spain), April 2010 (With M. Bertier, F. Bonnet, A.-M. Kermarrec, V. Leroy, S. Peri). [C248] Early Consensus in Message-passing Systems Enriched with a Perfect Failure Detector and its Application in the Theta Model. 8th European Dependable Computing Conference (EDCC’10). IEEE Computer Society Press, Valencia (Spain), April 2010 (With F. Bonnet). [C249] Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector? 24th IEEE Int'L Conference on Advanced Information Networking and Applications (AINA’10), IEEE Computer Society Press, Perth (Australia), April 2010 (With F. Bonnet). [C250] The Multiplicative Power of Consensus Numbers. (39/179). 29th ACM Symposium on Principles of Distributed Computing (PODC’10), ACM Press, pp. 26-35,July 2010, Zurich. (With D. Imbs.) [C251] On Asymmetric Progress Conditions. (39/179). 29th ACM Symposium on Principles of Distributed Computing (PODC’10), ACM Press, pp. 55-64, July 2010, Zurich. (With D. Imbs, G. Taubenfeld.) [C252] Value-based Sequential Consistency for Set Objects in Dynamic Distributed Systems. Proc. 16th Int’l European Parallel Computing Conference (EUROPAR’10), Springer LNCS 6271, pp. 523-534, 2010. (With R. Baldoni, S., Bonomi). [C253] The x-Wait-freedom Progress Condition. Proc. 16th Int’l European Parallel Computing Conference (EUROPAR’10), Distinguished paper award. Springer LNCS 6271, pp. 584-595, 2010. (With D. Imbs.) [C254] Anonymous Asynchronous Systems: the Case of Failure Detectors. Best paper award.Proc. 24th Int’l Symposium on Distributed Computing (DISC’10), Springer LNCS 6343, pp. 206-220, 2010. (With F. Bonnet.) [C255] On Adaptive Renaming under Eventually Limited Contention. Proc. 12th Int’l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS’10), Springer LNCS 6366, pp. 377-387, 2010. (With D. Imbs.) [C256] Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value. Proc. 14th Int’l Conference On Principles Of Distributed Systems (OPODIS’010), Springer LNCS 6490, pp. 144-159, 2010. (With A. Mostéfaoui.) [C257] A Necessary and Sufficient Condition for Solving Byzantine Consensus in Symmetric Networks. (31regular/140). Proc. 12th Int’l Conference on Distributed Computing and Networking (ICDCN’11), Springer LNCS 6522, pp. 215-226, Bangalore (India), 2011. (With O. Baldellon, A. Mostéfaoui.) [C258] A Theory-Oriented Introduction to Wait-free Synchronization Based on the Adaptive Renaming Problem. IEEE 25nd Int’l Conference on Advanced Information Networking and Applications (AINA’11), IEEE Computer Press, pp. 356-363, Singapore, March 2011. (With S. Rajsbaum.) [C259] A Simple Snapshot Algorithm for Multicore Systems. Proc. 5th IEEE Latin-American Symposium on Dependable Computing (LADC’11), IEEE Computer Press, pp. 17-23, Sao José dos Campos (Brazil) March 2011. (With D. Imbs.) [C260] k-Bounded Set Objects in Eventually Synchronous Distributed Systems with Churn and Continuous Accesses. Proc. 13th European Workshop on Dependable Computing (EDCC’11); ACM Digital Library, ISBN 978-1- 4503-0284-5, 2011. (With R. Baldoni, S. Bonomi.) [C261] Looking for Efficient Implementations of Concurrent Objects. 11th Int’l Conference on Parallel Computing Technologies (PaCT’11), Kazan, (Russia), Springer LNCS 6873, pp. 74-87, 2011. (With A. Mostefaoui). [C262] Power and limits of distributed computing shared memory models. Invited talk. Proc. 2nd Int’l Workshop on Logical Aspects of Fault-Tolerance (LAFT’11), in conjunction with the Int’l conference Logic In Computer Science (LICS’11), Toronto, 2011. (With S. Rajsbaum.) [C263] Specifying and Implementing an Eventual Leader Service for Dynamic Systems. (56/168). Proc. 14th Int’l Conference on Network-Based Information Systems (NBiS’11), pp. 243-249, IEEE Press, September 2011. (With M. Larrea.) [C264] Distributed Computing with Mobile Robots: an Introductory Survey. (56/168). Proc. 14th Int’l Conference on Network-Based Information Systems (NBiS’11), pp. 318-324, IEEE Press, September 2011. (With M. Gradinariu, S. Tixeuil.) [C265] The Universe of Symmetry Breaking Tasks. Proc. 18th Int’l Colloquium on Structural Information and Communication Complexity (SIROCCO’11), Springer LNCS 6796, pp. 66-77, 2011. (With D. Imbs, S. Rajsbaum.) [C267] Ressources informatiques : encore une histoire de temps ! Colloque du 20`eme Anniversaire de l’Institut Universitaire de France, Les colloques de l’IUF, Presses de l’université de St-Etienne, pp. 225-243, Lyon, Mai 2011. (With Benoit A., Paschos V., Robert Y., and Trystram D.) [C268] On the Implementation of Concurrent Objects. Dependable and Historic Computing (Randell’s Tales: a Festschrift recognising the contributions of Brian Randell), Springer LNCS 6875, pp. 453-478, 2011. [C269] The weakest failure detector to implement a register in asynchronous systems with hybrid communication. (29/79). Best paper award. Proc. 13th Int’l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS’11), Springer LNCS 6976, pp. 268-282, 2011. (With D. Imbs.) [C270] Relations linking failure detectors associated with k-set agreement in message-passing systems. (29/79). Proc. 13th Int’l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS’11), Springer LNCS 6976, pp. 341-355, 2011. (With A. Mostefaoui, J. Stainer.) [C271] Read invisibility, virtual world consistency and permissiveness are compatible. (24/88). Proc. 11th Int’l Conference on Algorithms and Architectures for Parallel Processing (ICA3PP), Springer LNCS 7016, pp. 245- 258, 2011. (With T. Crain, D. Imbs.) [C272] Towards a Universal Construction for Transaction-based Multiprocess Programs. Proc. 13th Int’l Conference on Distributed Computing and Networking (ICDCN’12), Springer LNCS 7129, pp. 61-75, Hong-Kong, 2012. (With T. Crain, D. Imbs.) [C273] A Transaction-Friendly Binary Search Tree. (26/175). Proc. 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP’12), ACM Press, pp. 161-170, 2012. (With T. Crain, V. Gramoli.) [C274] A look at distributed recursion. Invited talk. LADA (Languages for Distributed Algorithms), Satellite Workshop of the 33rd ACM POPL (Principles of Programming Languages) conference, ACM Press, January 2012. [C275] Renaming is Weaker than Set Agreement but for Perfect Renaming: A Map of Sub-Consensus Tasks. Proc. 10th Latin American Theoretical INformatics Symposium (LATIN’12), Springer LNCS 7256, pp. 145- 156, 2012. (With A. Castaneda, D. Imbs, S. Rajsbaum.) [C276] Trying to Unify the LL/SC Synchronization Primitive and the Notion of a Timed Register. (126/445). IEEE 26nd Int’l Conference on Advanced Information Networking and Applications (AINA’12), IEEE Computer Press, pp. 326-330, Fukuoka, March 2012. (With D. Imbs.) [C277] Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus). (71/515). Proc. 32nd Int’l Conference on Distributed Computing Systems (ICDCS’12), IEEE Computer Press, pp. 275- 284, 2012. (With S. Arevalo, A. Fernandez, D. Imbs, E. Jimenez.) [C278] A simple asynchronous shared memory consensus algorithm based on Ω and closing sets. (54/215). Proc.6Th Int’l Conference on Complex, Intelligent, and Software Intensive Systems (CISIS’12), IEEE Computer Press, pp. 357-364, 2012. (With J. Stainer.) C279] Leader Election: From Higham-Przytycka’s Algorithm to a Gracefully Degrading Algorithm. (54/215). Proc. 6th Int’l Conference on Complex, Intelligent, and Software Intensive Systems (CISIS’12), IEEE Computer Press, pp. 225-232, 2012. (With José-Ramon Mendivil and Itziar Arrieta.) [C280] Increasing the Power of the Iterated Immediate Snapshot Model with Failures Detectors. Proc. 19Th Int’l Colloquium on Structural Information and Communication Complexity (SIROCCO’12), Springer LNCS 7355, pp. 231-242, 2012. (With J. Stainer.) [C281] From a store-collect object and Ω to efficient asynchronous consensus.Proc. 18th Int’l European Parallel Computing Conference (EUROPAR’12), Springer LNCS 7484, pp. 427-438, 2012. (With J. Stainer.) [C282] Chasing the Weakest Failure Detector for k-Set Agreement in Message-passing Systems. Proc. 11th IEEE Int’l Symposium on Network Computing and Applications (NCA’12), IEEE Press, pp. 44-51, Boston (USA), 2012. (With A. Mostéfaoui, J. Stainer.) [C283] STM systems: Enforcing strong isolation between transactions and non-transactional code. Proc. Int’l Conference on Algorithms and Architectures for Parallel Processing (ICA3PP’12), Springer LNCS 7439, pp. 317-331, 2012. (With T. Crain, E. Kanellou.) [C284] When and How Process Groups can be Used to Reduce the Renaming Space. Proc. 16th Int’l Conference On Principles Of Distributed Systems (OPODIS’12), Springer LNCS 7702, pp. 91–105, 2012. (With A. Castaneda, J. Stainer.) [C285] Coordination and Computation in Distributed Intelligent MEMS.(159/567). IEEE 27nd Int’l Conference on Advanced Information Networking and Applications (AINA’13). IEEE Computer Press, pp.129–136, Barcelona, March 2013. (With J. Bourgeois J., Cao J., Raynal M., Dhoutaut D., Piranda, E. Dedu E., Mostefaoui M., and Mabed H.) [C286] A short introduction to synchronous communication. (159/567). IEEE 27nd Int’l Conference on Advanced Information Networking and Applications (AINA’13), IEEE Computer Press, pp. 1136-1143, Barcelona, March 2013. [C287] Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks. (106/494). Proc. 27th IEEE Int’l Parallel & Distributed Processing Symposium (IPDPS’13), IEEE Press, pp. 1147-1158, 2013. (With A. Castaneda, S. Rajsbaum.) [C288] No hot spot non-blocking skip list. (61/464). Proc. 33nd Int’l Conference on Distributed Computing Systems (ICDCS’13), IEEE Computer Press, pp. 196-205, 2013. (With T. Crain, V. Gramoli.) [C289] On the Consensus Number of Non-Adaptive Perfect Renaming. Proc. First Int’l Conference on Networked Systems (NETYS’13), Springer LNCS 7853, pp. 1-12, 2013. (With A. Castaneda.) [C290] Round-based Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors. 32th ACM Symposium on Principles of Distributed Computing (PODC’13), ACM Press, pp. 166-175, 2013. (With J. Stainer.) [C291] The Contention-Friendly Tree. (70/261). Proc. 19th Int’l European Parallel Computing Conference (EUROPAR’13), Springer LNCS 8097, pp. 229-240, 2013. (With T. Crain, V. Gramoli.) [C292] Cliff-edge consensus: agreeing on the precipice. 12th Int’l Conference on Parallel Computing Technologies (PaCT’13), St-Petersbourg (Russia), Springer LNCS 7979, pp. 51-64, 2013. (With Taïınai F., Porter B., Coulson G.) [C293] Simultaneous Consensus vs Set Agreement a Message-Passing Sensitive Hierarchy of Agreement Problems. Proc. 20th Int’l Colloquium on Structural Information and Communication Complexity (SIROCCO’13), Springer LNCS 8179, pp. 298-309, 2013. (With J. Stainer.) [C294] A generalized mutual exclusion problem and its algorithm. 42nd Int’l Conference on Parallel Processing (ICPP’13), IEEE Press pp. 300-309, Lyon (France), 2013. (With A. Luo and W. Wu –Sun Yat-Sen University, Guangzhou, China–, and J. Cao –Poly U, Hong-Kong–.) [C295] Fault-tolerant leader election in mobile dynamic distributed systems. 19th IEEE Int’l Pacific Rim Symposium on Dependable Computing. IEEE Press, pp. 78-87, 2013. (With Gomez-Calzado, Lafuente A.,Larrea M., Spain.) [C297] Computing in the Presence of Concurrent Solo Executions. Proc. 11th Latin American Symposium on Theoretical INformatics (LATIN’14), Springer LNCS 8392, pp. 214-225, 2014. (With M. Herlihy, S. Rajsbaum, J. Stainer). [C298] What can be computed in a distributed system? Invited talk. Workshop “From Programs to Systems: The Systems Perspective in Computing” workshop in honor of Professor Joseph Sifakis, Springer LNCS 8415, pp. 209-224, 2014. [C299] A simple broadcast algorithm for recurrent dynamic systems. IEEE 28nd Int’l Conference on Advanced Information Networking and Applications (AINA’14). IEEE Computer Press, pp. 933-939, Vancouver, May 2014. (With Cao J. –Hong Kong Polytechnic University–, J. Stainer –IRISA–, W. Wu –Sun Yat-Sen Univerity, Guangzhou, China–.) [C300] Simple deadlock detection for the And-communication model. (50/167.) 8th IEEE Int’l Conference on Complex, Intelligent and Software Intensive Systems (CISIS’14), IEEE Computer Society Press, pp. 273-278, Birmingham (UK), 2014. [C301] Signature-free asynchronous Byzantine consensus with t < n/3 and O(n²) messages. Best paper award. Proc. 33th ACM Symposium on Principles of Distributed Computing (PODC’14), ACM Press, pp.2-9, 2014. (With A. Mostéfaoui and Hamouma Moumen.) [C302] From Turing to the clouds (on the computability power of distributed systems). Invited talk. Proc. 21th Int’l Colloquium on Structural Information and Communication Complexity (SIROCCO’14), Springer LNCS 8576, pp. Xiii-xiv, 2014. [C303] Reliable shared memory abstractions on top of asynchronous Byzantine message-passing systems. Proc. 21th Int’l Colloquium on Structural Information and Communication Complexity (SIROCCO’14), Springer LNCS 8576, pp. 37, 2014. (With D. Imbs, S. Rajsbaum, J. Stainer.) [C304] An Exercise in concurrency: from non-blocking objects to fair objects. (52/181). 17th IEEE Intl Conference on Network-based Information Systems (NBIS14), IEEE Computer Society Press, pp. 1-7, 2014. (With C. Delporte and H. Fauconnier.) [C305] Fair synchronization in the presence of process crashes, and its weakest failure detector. Proc. 33th Intl Symposium on Reliable Distributed Systems (SRDS 14), IEEE Press, pp. 161-170, 2014. (With C. Delporte, H. Fauconnier.) [C306] Distributed universality. (32/98). Proc. 18th Int’l Conference On Principles Of Distributed Systems (OPODIS’14), Springer LNCS, pp. 2014. (With J. Stainer and G. Taubenfeld.) 7. Other publications 1. Architecture, matériel et réseaux. In L’état des sciences et des techniques, Collection L’Etat du Monde, Ed. La |