Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom

Rob van Glabbeek, Peter Höfner, Ross Horne

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

We investigate how different fairness assumptions affect results concerning lock-freedom, a typical liveness property targeted by session type systems. We fix a minimal session calculus and systematically take into account all known fairness assumptions, thereby identifying precisely three interesting and semantically distinct notions of lock-freedom, all of which having a sound session type system. We then show that, by using a general merge operator in an otherwise standard approach to global session types, we obtain a session type system complete for the strongest amongst those notions of lock-freedom, which assumes only justness of execution paths, a minimal fairness assumption for concurrent systems.
Original languageEnglish
Title of host publication2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
PublisherIEEE
Number of pages13
ISBN (Electronic)978-1-6654-4896-3
ISBN (Print)978-1-6654-4895-6
DOIs
Publication statusPublished - 7 Jul 2021
Event36th Annual ACM/IEEE Symposium on Logic in Computer Science - Online
Duration: 29 Jun 20212 Jul 2021
http://easyconferences.eu/lics2021/

Symposium

Symposium36th Annual ACM/IEEE Symposium on Logic in Computer Science
Abbreviated titleLICS 2021
Period29/06/212/07/21
Internet address

Fingerprint

Dive into the research topics of 'Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom'. Together they form a unique fingerprint.

Cite this