Le Brun, M. A. and Dardha, O. (2023) MAGπ: Types for Failure-Prone Communication. In: 32nd European Symposium on Programming (ESOP23), Paris, France, 22-27 April 2023, pp. 363-391. (doi: 10.1007/978-3-031-30044-8_14)
Text
288992.pdf - Published Version Available under License Creative Commons Attribution. 676kB |
Abstract
Multiparty Session Types (MPST) are a typing discipline for communication-centric systems, guaranteeing communication safety, deadlock freedom and protocol compliance. Several works have emerged which model failures and introduce fault-tolerance techniques. However, such works often make assumptions on the underlying network, e.g., assuming TCP-based communication where messages are guaranteed to be delivered; or adopting centralised reliable nodes and ad-hoc notions of reliability; or only addressing a single kind of failure, such as node crashes. In this work, we develop MAGπ —a Multiparty, Asynchronous and Generalised π -calculus, which is the first language and type system to accommodate in unison: (i) the widest range of non-Byzantine faults, including message loss, delays and reordering; crash and link failures; and network partitioning; (ii) a novel and most general notion of reliability, taking into account the viewpoint of each participant in the protocol; (iii) a spectrum of network assumptions from the lowest UDP-based network programming to the TCP-based application level. We prove subject reduction and session fidelity; process properties (deadlock freedom, termination, etc.); failure-handling safety and reliability adherence.
Item Type: | Conference Proceedings |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Dardha, Dr Ornela and Le Brun, Mr Matthew Alan |
Authors: | Le Brun, M. A., and Dardha, O. |
College/School: | College of Science and Engineering > School of Computing Science |
Copyright Holders: | Copyright © The Author(s) 2023 |
First Published: | First published in Lecture Notes in Computer Science 13990:363-391 |
Publisher Policy: | Reproduced under a Creative Commons license |
Related URLs: |
University Staff: Request a correction | Enlighten Editors: Update this record