DISC 2011
the 25th International Symposium on DIStributed Computing - September 20-22


Tutorial: "Knowledge Strikes Again" by Yoram Moses

Yoram Moses

After over a quarter century of research, knowledge theory offers a reasonably stable and well-defined framework. The main goal of the tutorial is familiarize the audience with knowledge as an effective tool in distributed computing. This tutorial will show how to define knowledge and related states such as common knowledge for an arbitrarily chosen protocol. The connection between distributed coordination and states of knowledge will be shown. Moreover, the applicability of knowledge theory as a fine tool for analyzing problems and protocols in distributed computing will be illustrated, yielding both lower bounds and upper bounds. Finally, we review a number of classical and newer results providing insight into problems involving coordination in distributed systems using the knowledge terminology.
The presentation is aimed at a general DISC audience, and will not assume familiarity with logics or logical notation.
This tutorial will be based on work of the author and many colleagues over many years. The main approach will be based on the book Reasoning About Knowledge by Fagin et al., while some of the most advanced results will be based on joint work with Ido Ben Zvi.

Tutorial: "From Reliable to Secure Distributed Programming" by Christian Cachin

Christian Cachin

Over the course of the last decade, the field of reliable distributed systems has been extended to include security against malicious actions by non-cooperating processes. This important topic is nowadays known as "Byzantine fault-tolerance."
The tutorial addresses fundamental programming abstractions in distributed environments, including the notions of broadcast, shared storage, and consensus. It is well-known how to implement them in systems subject to uncertainty and (benign) failures. The main part of the tutorial shows how to realize these concepts in environments subject to Byzantine faults, based on recent research results. The presentation will demonstrate how several algorithms for tolerating Byzantine faults arise naturally from the evolution of algorithms that tolerate benign faults.
This tutorial is based on the forthcoming book "Introduction to Reliable and Secure Distributed Programming", by Cachin, Guerraoui, and Rodrigues. It represents the second edition of the successful book "Introduction to Reliable Distributed Programming" by Guerraoui and Rodrigues.

60th birthday celebration of Nicola Santoro

Nicola Santoro

Program of the celebration will be announced soon!

sponsored by:
logo sapienza         logo microsoft research        logo cini consorzio interuniversitario per l'informatica