Fair Subtyping for Multi-party Session Types

Padovani, Luca

doi:10.1007/978-3-642-21464-6_9

Cited by 23 publications

(28 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our future work includes the applications to higher-order processes [29,31,30], polymorphic types [19,7,18], fair subtypings [33,34] and contract subtyping [3]. We plan to use the characteristic processes in typecheckers for session types.…”

Section: Resultsmentioning

confidence: 99%

Denotational and Operational Preciseness of Subtyping: A Roadmap

Dezani‐Ciancaglini

Ghilezan

Jakšić

et al. 2016

Theory and Practice of Formal Methods

View full text Add to dashboard Cite

Abstract. The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in object-oriented programming languages. The soundness and the completeness, together referred to as the preciseness of subtyping, can be considered from two different points of view: denotational and operational. The former preciseness is based on the denotation of a type, which is a mathematical object describing the meaning of the type in accordance with the denotations of other expressions from the language. The latter preciseness has been recently developed with respect to type safety, i.e. the safe replacement of a term of a smaller type when a term of a bigger type is expected. The present paper shows that standard proofs of operational preciseness imply denotational preciseness and gives an overview on this subject.

show abstract

Section: Resultsmentioning

confidence: 99%

Denotational and Operational Preciseness of Subtyping: A Roadmap

Dezani‐Ciancaglini

Ghilezan

Jakšić

et al. 2016

Theory and Practice of Formal Methods

View full text Add to dashboard Cite

show abstract

“…Advanced subtyping of local types with respect to liveness is studied theoretically in [37]. Our present work is based on a coarser-grained treatment of fairness in the global model, to cater for applications to existing (mainstream) languages where it may be difficult to precisely enforce a particular subtyping for sessions via the native type system.…”

Section: Related Work and Concluding Remarksmentioning

confidence: 99%

“…The key to this approach is that the characteristics of syntactic MPST can be leveraged to serve the soundness of the bounded validation; as opposed to solely relying on syntactic restrictions for outright safety. We treat output choice fairness by a structural transformation in the model construction, that reflects the underlying issue of session subtyping [37]; e.g., our validation accepts P1 (above) only if fairness is assumed.…”

Section: Introductionmentioning

confidence: 99%

Explicit Connection Actions in Multiparty Session Types

Yoshida

2017

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. This work extends asynchronous multiparty session types (MPST) with explicit connection actions to support protocols with optional and dynamic participants. The actions by which endpoints are connected and disconnected are a key element of real-world protocols that is not treated in existing MPST works. In addition, the use cases motivating explicit connections often require a more relaxed form of multiparty choice: these extensions do not satisfy the conservative restrictions used to ensure safety in standard syntactic MPST. Instead, we develop a modelling-based approach to validate MPST safety and progress for these enriched protocols. We present a toolchain implementation, for distributed programming based on our extended MPST in Java, and a core formalism, demonstrating the soundness of our approach. We discuss key implementation issues related to the proposed extensions: a practical treatment of choice subtyping for MPST progress, and multiparty correlation of dynamic binary connections.

show abstract

“…There session types are higher-order and recursive, their operational semantics is defined by parametrising the interactions of session types on pre-subtyping relations, and the fair subtyping is defined as a greatest fixed point (Definition 2.4). In our development we adopted the same technique as [20]. However, our aim was to model the standard subtyping of [13], while Padovani focuses on the properties of his new fair subtyping.…”

Section: Proposition 2 [ Unfolding and Complement Commute ]mentioning

confidence: 99%

“…An alternative "fair" subtyping has been proposed recently in [20]. There session types are higher-order and recursive, their operational semantics is defined by parametrising the interactions of session types on pre-subtyping relations, and the fair subtyping is defined as a greatest fixed point (Definition 2.4).…”

Section: Proposition 2 [ Unfolding and Complement Commute ]mentioning

confidence: 99%

Using Higher-Order Contracts to Model Session Types (Extended Abstract)

Bernardi

Hennessy

2014

CONCUR 2014 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. Session types are used to describe and structure interactions between independent processes in distributed systems. Higher-order types are needed in order to properly structure delegation of responsibility between processes. In this paper we show that higher-order web-service contracts can be used to provide a fully-abstract model of recursive higher-order session types. The model is settheoretic, in the sense that the denotation of a contract is given by the set of contracts with which it complies; we use a novel notion of peer compliance. A crucial step in the proof of full-abstraction is showing that every contract has a non-empty denotation.

show abstract

Fair Subtyping for Multi-party Session Types

Cited by 23 publications

References 26 publications

Denotational and Operational Preciseness of Subtyping: A Roadmap

Denotational and Operational Preciseness of Subtyping: A Roadmap

Explicit Connection Actions in Multiparty Session Types

Using Higher-Order Contracts to Model Session Types (Extended Abstract)

Contact Info

Product

Resources

About