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

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

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Glabbeek, Rob van, Hofner, Peter, Horne, Ross
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Calculus Computer science Semantics
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!