Fair termination of multiparty sessions

There exists a broad family of multiparty sessions in which the progress of one session participant is not unconditional, but depends on the choices performed by other participants. These sessions fall outside the scope of currently available session type systems that guarantee progress. In this wor...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 139; p. 100964
Main Authors Ciccone, Luca, Dagnino, Francesco, Padovani, Luca
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.06.2024
Subjects
Deadlock freedom
Fair subtyping
Fair termination
Multiparty sessions
Deadlock freedom
Multiparty sessions
Fair subtyping
Fair termination
Online AccessGet full text

Cover

More Information
Summary:There exists a broad family of multiparty sessions in which the progress of one session participant is not unconditional, but depends on the choices performed by other participants. These sessions fall outside the scope of currently available session type systems that guarantee progress. In this work we propose the first type system ensuring that well-typed multiparty sessions, including those exhibiting the aforementioned dependencies, fairly terminate. Fair termination is termination under a fairness assumption that disregards those interactions deemed unfair and therefore unrealistic. Fair termination, combined with the usual safety properties ensured within sessions, not only is desirable per se, but it entails livelock freedom and enables a compositional form of static analysis such that the well-typed composition of fairly terminating sessions results in a fairly terminating program.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2024.100964