{"id":68,"date":"2017-03-22T15:33:32","date_gmt":"2017-03-22T14:33:32","guid":{"rendered":"https:\/\/project.inria.fr\/iwdcmr2017\/?page_id=68"},"modified":"2017-04-24T11:41:10","modified_gmt":"2017-04-24T09:41:10","slug":"program","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/iwdcmr2017\/program\/","title":{"rendered":"Program & Speakers"},"content":{"rendered":"

Program (updated)
\n<\/strong><\/span><\/p>\n

Morning<\/h4>\n

08:45 – Registration and Welcome Coffee<\/em>
\n09:15 – Welcome & Opening: St\u00e9phane Ubeda <\/strong>(Director of Inria Rennes) and Jean-Marc J\u00e9z\u00e9quel <\/strong>(Director of IRISA)
\n09:30 – Leslie Lamport: <\/strong>The Bakery Algorithm in 2015<\/em><\/span>
\n10:05 – Coffee Break
\n10:55 – Maurice Herlihy: <\/strong>Adding Concurrency to Smart Contracts<\/em>
\n<\/strong><\/span>11:30 – Sergio Rajsbaum: <\/strong>Tasks, algorithms, and models of distributed computing with Michel (together with other colleagues)<\/em>
\n<\/strong><\/span>12:05 – Lunch
\n<\/strong><\/span><\/p>\n

Afternoon<\/h4>\n

13:45 – Yoram Moses: <\/strong>Indistinguishability, Duality and Necessary Conditions<\/em>
\n14:20 – Achour Most\u00e9faoui: <\/strong>Distributed data structures and consistency criteria<\/em>
\n<\/strong><\/span>14:55 – Coffee Break
\n15:45 – Carole Delporte: <\/strong>D\u00e9tecteurs de d\u00e9faillance<\/em><\/span>
\n16:20 – Rachid Guerraoui: <\/strong>A brief history of atomic commitment<\/em>
\n16:55 – Surprise
\n17:30 – Coktail
\n<\/strong><\/span><\/p>\n

Speakers – Short Biographies<\/strong><\/span><\/h4>\n


\nLeslie Lamport<\/strong> is a principal researcher at Microsoft Research. He is known for fundamental contributions to the theory and practice of distributed and concurrent systems, notably the invention of concepts such as causality and logical clocks, safety and liveness, replicated state machines, and sequential consistency. He is a member of the US National Academy of Sciences<\/em> (2011) and an ACM Fellow<\/em> (2014). Leslie Lamport has received a number of prizes and honorary degrees for his work, including the Dijkstra Prize<\/em> (2000 and 2005), and the IEEE John von Neumann Medal<\/em> (2008). Leslie Lamport is the 2013 recipient of the ACM A.M. Turing Award<\/em>, one of the most prestigious award in Computer Science.<\/p>\n

Maurice Herlihy<\/strong> is the An Wang Professor of Computer Science at Brown University, where he has been a member of the faculty since 1994. He has contributed to areas including theoretical foundations of wait-free synchronization, linearizable data structures, applications of combinatorial topology to distributed computing, as well as hardware and software transactional memory. Maurice Herlihy has received a number of national and international accolades for his research, including the Dijkstra Prize<\/em> (in 2003 and 2012), the G\u00f6del prize<\/em> (in 2004) and the W. Wallace McDowell Award<\/em> (2013). He is, among others, a Fellow of the ACM<\/em>, the National Academy of Engineering<\/em>, the National Academy of Arts and Sciences<\/em>, and the National Academy of Inventors<\/em>.<\/p>\n

Sergio Rajsbaum<\/strong> is a Professor at the Institute of Mathematics of Universidad Nacional Autonoma de Mexico (UNAM), which he joined after obtaining a PhD from the Computer Science Department at the\u00a0 Technion – Israeli Institute of Technology in 1991. His main research interests are in the theory of distributed computing, especially issues related to coordination, fault-tolerance, complexity and computability. Sergio Rajsbaum has been Steering Committee member of DISC, LADC, LATIN, and PODC, and Program Chair of LATIN, PODC, SSS and ICDCN.<\/p>\n

Yoram Moses<\/strong> is a Professor in the Electrical Engineering Department at the Technion – Israel Institute of Technology. Yoram Moses received a B.Sc. in mathematics from the Hebrew University of Jerusalem in 1981, and a Ph.D. in Computer Science from Stanford University in 1986. He is a co-author of the book Reasoning About Knowledge, and is a winner of the 1997 G\u00f6del Prize<\/em> in theoretical computer science and the 2009 Dijkstra Prize<\/em> in Distributed Computing. His major research interests are distributed systems and reasoning about knowledge.<\/p>\n

Achour Mostefaoui<\/strong> is Full Professor at the University of Nantes. He is vice-head of the GDD research team (LS2N Lab.). He is a worldwide expert in distributed computing and systems. His research interests include computability, synchronization and fault-tolerance issues in asynchronous fault-prone distributed systems. He has published more than a hundred papers in the major conferences (STOC, PODC, DISC, DSN, ICDCS, IPDPS, SPAA, PPoPP) and journals (JACM, SICOMP, Distributed Computing, IEEE TPDS, IEEE TC, JPDC, JCSS, FGCS) in the distributed computing area. He has been a member of the steering committee and the treasurer of the Distributed Computing Conference (DISC) since 2012.<\/p>\n

Carole Delporte<\/strong> is Professor at the University Paris Diderot. Her main research interest is distributed computing, and specifically fault tolerance. She is in particular well known for her theoretical contributions to the fault-tolerant leader election problem in weakly synchronous systems. Carole regularly serves on the technical program committees of the key conferences in her field (PODC, DISC, ICDCS, OPODIS, ICDCN, SSS …). Over the last decade, she has published over 17 publications in refereed international journals (J. ACM, Distributed Computing, TCS, …), and more than 54 in referred international conferences (PODC, DISC, ICDCS, OPODIS, …).<\/p>\n

Rachid Guerraoui<\/strong> is Full Professor at \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), and currently visiting professor at the University of Rennes 1. In the past, he has been affiliated with Ecole des Mines of Paris, the Commissariat \u00e0 l’Energie Atomique, Hewlett Packard Laboratories and the Massachusetts Institute of Technology. He has worked in a variety of aspects of distributed computing, including distributed algorithms and distributed programming languages. He is most well known for his work on (e-)Transactions, epidemic information dissemination and indulgent algorithms. Rachid Guerraoui is the recipient of a Senior Grant from the European Research Council (ERC), a prestigious European award. He is an ACM Fellow<\/em> and Associate Editor of Journal of the ACM.<\/p>\n","protected":false},"excerpt":{"rendered":"

Program (updated) Morning 08:45 – Registration and Welcome Coffee 09:15 – Welcome & Opening: St\u00e9phane Ubeda (Director of Inria Rennes) and Jean-Marc J\u00e9z\u00e9quel (Director of IRISA) 09:30 – Leslie Lamport: The Bakery Algorithm in 2015 10:05 – Coffee Break 10:55 – Maurice Herlihy: Adding Concurrency to Smart Contracts 11:30 –\u2026<\/p>\n

Continue reading<\/span><\/i><\/a> <\/p>\n","protected":false},"author":313,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-68","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/iwdcmr2017\/wp-json\/wp\/v2\/pages\/68","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/iwdcmr2017\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/iwdcmr2017\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/iwdcmr2017\/wp-json\/wp\/v2\/users\/313"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/iwdcmr2017\/wp-json\/wp\/v2\/comments?post=68"}],"version-history":[{"count":23,"href":"https:\/\/project.inria.fr\/iwdcmr2017\/wp-json\/wp\/v2\/pages\/68\/revisions"}],"predecessor-version":[{"id":153,"href":"https:\/\/project.inria.fr\/iwdcmr2017\/wp-json\/wp\/v2\/pages\/68\/revisions\/153"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/iwdcmr2017\/wp-json\/wp\/v2\/media?parent=68"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}