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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of logical and algebraic methods in programming Ročník 139; s. 100964
Hlavní autoři: Ciccone, Luca, Dagnino, Francesco, Padovani, Luca
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.06.2024
Témata:
Deadlock freedom
Fair subtyping
Fair termination
Multiparty sessions
Deadlock freedom
Multiparty sessions
Fair subtyping
Fair termination
ISSN:2352-2208
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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