Conversation types

Caires, Luís; Vieira, Hugo Torres

doi:10.1016/j.tcs.2010.09.010

Cited by 69 publications

(94 citation statements)

References 5 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%

“…6. Our types extend session types [8,9] with event annotations, and also exploit notions introduced in previous work on session types [17] and conversation types [3].…”

Section: ≺\ Ementioning

confidence: 99%

“…captures the output capability, ? captures the input capability and τ captures a synchronisation pair (cf., [3]). Types are divided in two main classes, shared and linear.…”

Section: ≺\ Ementioning

confidence: 99%

“…Notice that our types build on the notion of abstract events, differently from other related approaches (cf., [2][3][4]) that resort to channel names (and communication labels) to order communication actions. Notice also our types structurally resemble "classic" session types, differing in the introduction of the event identifier, crucial to our approach, the polarity annotation that allows us to avoid polarised channels, and the linear/unrestricted annotation that allows us to avoid separate typing contexts for shared and linear channels and separate typing rules for linear/unrestricted argument type of communications.…”

Section: ≺\ Ementioning

confidence: 99%

“…Session types are by now widely adopted as the basis of pragmatic typing disciplines, targeting operating system design [5], middleware communication protocols [16] and distributed object-oriented programming [7], just to mention a few. Session types have also been generalised so as to consider multiparty interactions [3,10].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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%

“…6. Our types extend session types [8,9] with event annotations, and also exploit notions introduced in previous work on session types [17] and conversation types [3].…”

Section: ≺\ Ementioning

confidence: 99%

“…captures the output capability, ? captures the input capability and τ captures a synchronisation pair (cf., [3]). Types are divided in two main classes, shared and linear.…”

Section: ≺\ Ementioning

confidence: 99%

Section: ≺\ Ementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Typing Progress in Communication-Centred Systems

Vieira

Vasconcelos

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Manifest Deadlock-Freedom for Shared Session Types

Balzer

Toninho

Pfenning

2019

Programming Languages and Systems

View full text Add to dashboard Cite

Shared session types generalize the Curry-Howard correspondence between intuitionistic linear logic and the session-typed π-calculus with adjoint modalities that mediate between linear and shared session types, giving rise to a programming model where shared channels must be used according to a locking discipline of acquire-release. While this generalization greatly increases the range of programs that can be written, the gain in expressiveness comes at the cost of deadlock-freedom, a property which holds for many linear session type systems. In this paper, we develop a type system for logically-shared sessions in which types capture not only the interactive behavior of processes but also constrain the order of resources (i.e., shared processes) they may acquire. This typelevel information is then used to rule out cyclic dependencies among acquires and synchronization points, resulting in a system that ensures deadlock-free communication for well-typed processes in the presence of shared sessions, higher-order channel passing, and recursive processes. We illustrate our approach on a series of examples, showing that it rules out deadlocks in circular networks of both shared and linear recursive processes, while still being permissive enough to type concurrent implementations of shared imperative data structures as processes.

show abstract