A Type System for Flexible Role Assignment in Multiparty Communicating Systems

Baltazar, Pedro; Caires, Luís; Vasconcelos, Vasco T.; Vieira, Hugo Torres

doi:10.1007/978-3-642-41157-1_6

Cited by 17 publications

(28 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our work exploits notions introduced in [3] (e.g., the τ polarity) and in [1] (e.g., the splitting relation), allowing to type systems specified in standard π-calculus. This is in contrast with related approaches, where session channels are equipped with polarities (see, e.g., [6]) or where channels have two endpoints (see, e.g., [17]), or or where sessions are established via specialised initiation primitives (see, e.g., [9]).…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Typing Progress in Communication-Centred Systems

Vieira

Vasconcelos

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a type system for the analysis of progress in session-based communication centred systems. Our development is carried out in a minimal setting considering classic (binary) sessions, but building on and generalising previous work on progress analysis in the context of conversation types. Our contributions aim at underpinning forthcoming works on progress for session-typed systems, so as to support richer verification procedures based on a more foundational approach. Although this work does not target expressiveness, our approach already addresses challenging scenarios which are unaccounted for elsewhere in the literature, in particular systems that interleave communications on received session channels.

show abstract

Section: Discussionmentioning

confidence: 99%

“…We now introduce two notions crucial to our development, namely splitting (inspired by [1]) that explains how behaviour can be decomposed and safely distributed to distinct parts of a process (e.g., to the branches of a parallel composition), and conformance that captures the desired relation between typing contexts and strict partial orders.…”

Section: ≺\ Ementioning

confidence: 99%

Typing Progress in Communication-Centred Systems

Vieira

Vasconcelos

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…These two prefixes are taken from [BCVV12]. The second pair of prefixes is new to our calculus and concerns the communication of an authorization to act on a role: -a s l d expresses sending authorization for role d, in a message with tag l , along channel a, under role s; -a r l (d) expresses receiving authorization for role d, in a message with tag l , along channel a, under role r.…”

Section: Syntaxmentioning

confidence: 99%

“…Our type discipline builds on the conversation types language as presented in [BCVV12]: we extend message type M with the role r, so that we may capture role authorization passing. This is a rather natural extension, formally given by the syntax in Table 4.…”

Section: Type Systemmentioning

confidence: 99%

Dynamic role authorization in multiparty conversations

et al. 2016

Self Cite

View full text Add to dashboard Cite

Abstract. Protocols in distributed settings usually rely on the interaction of several parties and often identify the roles involved in communications. Roles may have a behavioral interpretation, as they do not necessarily correspond to sites or physical devices. Notions of role authorization thus become necessary to consider settings in which, e.g., different sites may be authorized to act on behalf of a single role, or in which one site may be authorized to act on behalf of different roles. This flexibility must be equipped with ways of controlling the roles that the different parties are authorized to represent, including the challenging case in which role authorizations are determined only at runtime. We present a typed framework for the analysis of multiparty interaction with dynamic role authorization and delegation. Building on previous work on conversation types with role assignment, our formal model is based on an extension of the π -calculus in which the basic resources are pairs channel-role, which denote the access right of interacting along a given channel representing the given role. To specify dynamic authorization control, our process model includes (1) a novel scoping construct for authorization domains, and (2) communication primitives for authorizations, which allow to pass around authorizations to act on a given channel. An authorization error then corresponds to an action involving a channel and a role not enclosed by an appropriate authorization scope. We introduce a typing discipline that ensures that processes never reduce to authorization errors, including when parties dynamically acquire authorizations.

show abstract

“…Multiparty session types use a projection operator to extract session types from the global type of a system . The conversation calculus includes a type splitting relation allowing to decompose the type of processes (Baltazar et al, 2013;Caires and Vieira, 2010). In comparison with these systems, the splitting capabilities of our types are quite limited: from a linear (end point) type all we can do is extract an end type while keeping the original type.…”

Section: (X)c(y)c(z)mentioning

confidence: 99%

Linearity, session types and the Pi calculus

Giunti¹,

Vasconcelos²

2014

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

We present a type system based on session types that works on a conventional pi calculus. Types are equipped with a constructor that describes the two ends of a single communication channel, this being the only type available for describing the behaviour of channels. Session types, in turn, describe the behaviour of each individual channel end, as usual. A novel notion of typing context split allows for typing processes not typable with extant type systems. We show that our system guarantees that typed processes do not engage in races for linear resources. We assess the expressiveness of type system by providing three distinct encodings-from the pi calculus with polarised variables, from the pi calculus with accept and request primitives, and from the linear pi calculus-into our system. For each language we present operational and typing correspondences, showing that our system effectively subsumes foregoing works on linear and session types. In the case of the linear pi calculus we also provide a completeness result.

show abstract

A Type System for Flexible Role Assignment in Multiparty Communicating Systems

Cited by 17 publications

References 13 publications

Typing Progress in Communication-Centred Systems

Typing Progress in Communication-Centred Systems

Dynamic role authorization in multiparty conversations

Linearity, session types and the Pi calculus

Contact Info

Product

Resources

About