Session Types for Link Failures - Formal Techniques for Distributed Objects, Components, and Systems Access content directly
Conference Papers Year : 2017

Session Types for Link Failures


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 with optional blocks that cover a limited class of link failures. This allows us to automatically derive termination of distributed algorithms that come within these limits.
Fichier principal
Vignette du fichier
446833_1_En_1_Chapter.pdf (382.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01658430 , version 1 (07-12-2017)





Manuel Adameit, Kirstin Peters, Uwe Nestmann. Session Types for Link Failures. 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2017, Neuchâtel, Switzerland. pp.1-16, ⟨10.1007/978-3-319-60225-7_1⟩. ⟨hal-01658430⟩
247 View
118 Download



Gmail Facebook X LinkedIn More