Invited Talk: Session Types for Fault-Tolerant Distributed Algorithms
Session types are designed to abstractly capture the structure of (even multi-party) communication protocols. The goal of session types is the analysis and verification of the protocols’ behavioural properties. One important such property is progress, i.e., the absence of (unintended) deadlock. Distributed algorithms often resemble (compositions of) multi-party communication protocols. In contrast to protocols that are typically studied with session types, they are often designed to cope with faults, like system failures. An essential behavioural property is (successful) fault-tolerant termination, but it is often elaborate to prove for distributed algorithms.
The talk is about an extension of multi-party session types to capture faults due to message loss and process crashes. It combines reliable and unreliable communication mechanisms in types and augment the semantics of processes by failure patterns that can be used to represent system requirements (as, e.g., failure detectors).
Sun 13 Jan Times are displayed in time zone: (GMT+01:00) Greenwich Mean Time : Belfast change
|16:00 - 16:50|
Kirstin PetersTU Berlin
|16:50 - 17:10|
|17:10 - 17:30|
|17:30 - 17:40|
|17:40 - 18:00|
Søren DeboisIT University of Copenhagen, Thomas H. Hildebrandt, Hugo LópezIT University of Copenhagen, Denmark & DCR Solutions A/SMedia Attached
|18:00 - 18:20|
Carlos Mão de FerroLASIGE, Faculty of Sciences, University of Lisbon, Francisco MartinsLaSIGE, University of Lisbon, Tiago CogumbreiroUniversity of Massachusetts BostonFile Attached
|18:20 - 18:25|