Affiliation:
1. University of Turin, Italy
Abstract
A binary session is a private communication channel that connects two processes, each adhering to a protocol description called
session type
. In this work, we study the first type system that ensures the
fair termination
of binary sessions. A session fairly terminates if all of the infinite executions admitted by its protocol are deemed unrealistic because they violate certain
fairness assumptions
. Fair termination entails the eventual completion of all pending input/output actions, including those that depend on the completion of an unbounded number of other actions in possibly different sessions. This form of
lock freedom
allows us to address a large family of natural communication patterns that fall outside the scope of existing type systems. Our type system is also the first to adopt
fair subtyping
, a liveness-preserving refinement of the standard subtyping relation for session types that so far has only been studied theoretically. Fair subtyping is surprisingly subtle not only to characterize concisely but also to use appropriately, to the point that the type system must carefully account for all usages of fair subtyping to avoid compromising its liveness-preserving properties.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献