%0 Conference Proceedings
%T Session Types for Link Failures
%+ Technical University of Berlin / Technische Universität Berlin (TU)
%A Adameit, Manuel
%A Peters, Kirstin
%A Nestmann, Uwe
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Neuchâtel, Switzerland
%Y Ahmed Bouajjani
%Y Alexandra Silva
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-10321
%P 1-16
%8 2017-06-19
%D 2017
%R 10.1007/978-3-319-60225-7_1
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01658430/document
%2 https://inria.hal.science/hal-01658430/file/446833_1_En_1_Chapter.pdf
%L hal-01658430
%U https://inria.hal.science/hal-01658430
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-10321