1 research outputs found
Session Types for Link Failures (Technical Report)
We strive to use session type technology to prove behavioural properties of
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
system failures. An essential behavioural property is (successful) termination,
despite failures, but it is often elaborate to prove for distributed
algorithms.
We extend multi-party session types (and multi-party session types with
nested sessions) by optional blocks that cover a limited class of link and
crash failures. This allows us to automatically derive termination of
distributed algorithms that come within these limits. To illustrate our
approach, we prove termination for an implementation of the *rotating
coordinator* Consensus algorithm.Comment: This paper is an extended version of Adameit et al. 201