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

@article{Glabbeek2021AssumingJE,
  title={Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom},
  author={R. V. Glabbeek and P. H{\"o}fner and Ross Horne},
  journal={2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
  year={2021},
  pages={1-13}
}
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… Expand

Figures from this paper

References

SHOWING 1-10 OF 38 REFERENCES
Weak and Strong Fairness in CCS
Fair Subtyping for Multi-party Session Types
Progress as Compositional Lock-Freedom
Less is more: multiparty session types revisited
A Very Gentle Introduction to Multiparty Session Types
Appraising fairness in languages for distributed programming
Subtyping for session types in the pi calculus
...
1
2
3
4
...