Typing Progress in Communication-Centred Systems

Vieira, Hugo Torres; Vasconcelos, Vasco T.

doi:10.1007/978-3-642-38493-6_17

Cited by 13 publications

(5 citation statements)

References 20 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The increased precision of the approach presented here comes from associating pairs of priorities with each action in a session type, while in [2,7] there is just one priority associated with the shared name on which the session is initiated. Following the ideas presented by Kobayashi [11] and adapted to sessions in the present work, Vieira and Vasconcelos [14] have defined a similar type system using abstract events instead of priorities, where events represent the temporal order with which actions should be performed. Their soundness result proves a weaker notion of progress, but it should be possible to strengthen it along the lines of Definition 2.1.…”

Section: Discussionmentioning

confidence: 99%

From Lock Freedom to Progress Using Session Types

Padovani

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Inspired by Kobayashi's type system for lock freedom, we define a behavioral type system for ensuring progress in a language of binary sessions. The key idea is to annotate actions in session types with priorities representing the urgency with which such actions must be performed and to verify that processes perform such actions with the required priority. Compared to related systems for session-based languages, the presented type system is relatively simpler and establishes progress for a wider range of processes.Comment: In Proceedings PLACES 2013, arXiv:1312.221

show abstract

Section: Discussionmentioning

confidence: 99%

From Lock Freedom to Progress Using Session Types

Padovani

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…The resulting system is quite intricate, since it combines the full multiparty session theory with the order tracking mechanism, interacts negatively with recursion (essentially disallowing interleaving with recursion) and, by tracking order at the multiparty session-level, ends up rejecting various benign configurations that can be accounted for by our more fine-grained analysis. We also highlight the analyses of Vieira and Vasconcelos [54] and Padovani et al [45] that are more powerful than the approaches above, at the cost of a more complex analysis based on conversation types [10] (themselves a partial-order based technique).…”

Section: Related Workmentioning

confidence: 97%

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

“…[fwd] fwd Remarkably, our proof of Theorem 2 leverages deep properties of Linear Logic, in particular the structure of the linear cut and co-contraction, allowing us to prove deadlock absence, even in a language with primitives exhibiting blocking behaviour, avoiding the use of extra mechanisms [47,33,48,10,25,76,31].…”

Section: Type Safety and Strong Normalisationmentioning

confidence: 99%