Fair Subtyping for Multi-party Session Types

@inproceedings{Padovani2011FairSF,
  title={Fair Subtyping for Multi-party Session Types},
  author={L. Padovani},
  booktitle={COORDINATION},
  year={2011}
}
  • L. Padovani
  • Published in COORDINATION 2011
  • Computer Science
The standard subtyping relation used in dyadic session type theories may compromise the liveness of multi-party sessions. In this paper we define a fair subtyping relation for multi-party session types that preserves liveness, we relate it with the standard subtyping relation, and we give algorithms for deciding it. As a side effect, we provide an original and remarkably simple coinductive characterization of the fair testing preorder for nondeterministic, sequential processes consisting of… Expand

Figures, Tables, and Topics from this paper

Fair subtyping for multi-party session types
  • L. Padovani
  • Computer Science
  • Mathematical Structures in Computer Science
  • 2014
TLDR
A fair subtyping relation for multi-party session types that preserves liveness is defined and coinductive, axiomatic and algorithmic characterizations for it are provided. Expand
Fair Subtyping for Open Session Types
TLDR
This paper develops complete behavioral and axiomatic characterizations of fair subtyping and gives a polynomial algorithm to decide it. Expand
Inference Systems with Corules for Fair Subtyping and Liveness Properties of Binary Session Types
TLDR
This paper illustrates the role of corules in characterizing weak termination, fair compliance, and also fair subtyping, a liveness-preserving refinement relation for session types. Expand
Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
TLDR
This paper illustrates the role of corules in characterizing fair termination, fair compliance and fair subtyping, a liveness-preserving refinement relation for session types. Expand
Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom
TLDR
It is shown that, by using a general merge operator in an otherwise standard approach to global session types, a session type system complete for the strongest amongst those notions of lock-freedom is obtained, which assumes only justness of execution paths. Expand
Full-abstraction for client testing preorders
TLDR
This paper characterise the set of usable clients wrt must testing for finite-branching LTSs, and gives a sound and complete decision procedure for it. Expand
Fair Refinement for Asynchronous Session Types (extended version)
TLDR
This work proposes a novel variant of session subtyping that leverages the notion of controllability from service contract theory and that is a sound characterisation of fair refinement, and presents a sound algorithm, and its implementation, which deals with examples that feature potentially unbounded buffering. Expand
Full Abstraction in a Subtyped pi-Calculus with Linear Types
TLDR
A concise pi-calculus with directed choices and a theory of subtyping, which shows type-directed embeddings of two known subtyped calculi, one for functions and another for session-based communications, and introduces a new proof method centring on non-deterministic computational adequacy and definability. Expand
Machine-checked semantic session typing
TLDR
This work develops a semantic approach to binary asynchronous affine session types, by developing a logical relations model in Coq using the Iris program logic, and demonstrates the power of this approach by combining various forms of polymorphism and recursion, asynchronous subtyping, references, and locks/mutexes. Expand
Less is more: multiparty session types revisited
TLDR
A new MPST theory is proposed that is less complicated, and yet more general, than the classic one, and does not require global multiparty session types nor binary session type duality, and proves type safety of many more protocols and processes. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 38 REFERENCES
Fair Subtyping for Open Session Types
TLDR
This paper develops complete behavioral and axiomatic characterizations of fair subtyping and gives a polynomial algorithm to decide it. Expand
On Global Types and Multi-party Sessions
TLDR
A new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified is presented, allowing a multiparty session to leave out redundant traces from an underspecified global type. Expand
Fundamentals of Session Types
TLDR
A reconstruction of session types in a linear pi calculus where types are qualified as linear or unrestricted, and an algorithmic type checking system is presented. Expand
Subtyping for session types in the pi calculus
TLDR
The syntax, operational semantics and typing rules of an extended pi calculus are formalized, it is proved that typability guarantees absence of run-time communication errors, and the typing rules are transformed into a practical typechecking algorithm. Expand
Semantic subtyping for the pi-calculus
TLDR
A variant of the @p-calculus where communication is subjected to pattern matching that performs dynamic typecase is defined, and it is proved decidability of the subtyping relation and sketch theSubtyping algorithm is sketched. Expand
Session Types as Intuitionistic Linear Propositions
TLDR
This paper introduces a type system for the π-calculus that exactly corresponds to the standard sequent calculus proof system for dual intuitionistic linear logic, and provides the first purely logical account of all features of session types. Expand
On Global Types and Multi-Party Session
TLDR
A new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified is presented, allowing a multi-party session to leave out redundant traces from an underspecified global type. Expand
Foundations of session types
We present a streamlined theory of session types based on a simple yet general and expressive formalism whose main eatures are semantically characterized and where each design choice is semanticallyExpand
Session Types at the Mirror
TLDR
The point of view the authors provide sheds light on the nature of session types and gives a chance to reason about them in a framework where every notion, from well-typedness to the subtyping relation between session types, is semantically -rather than syntactically- grounded. Expand
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types
TLDR
This work shows how to define a subtyped relation semantically in the presence of Boolean connectives, functional types and dynamic dispatch on types, without the complexity of denotational models, and how to derive a complete subtyping algorithm. Expand
...
1
2
3
4
...