Typing Liveness in Multiparty Communicating Systems

@inproceedings{Padovani2014TypingLI,
  title={Typing Liveness in Multiparty Communicating Systems},
  author={L. Padovani and V. Vasconcelos and H. Vieira},
  booktitle={COORDINATION},
  year={2014}
}
Session type systems are an effective tool to prove that communicating programs do not go wrong, ensuring that the participants of a session follow the protocols described by the types. In a previous work we introduced a typing discipline for the analysis of progress in binary sessions. In this paper we generalize the approach to multiparty sessions following the conversation type approach, while strengthening progress to liveness. We combine the usual session-like fidelity analysis with the… Expand
Multiparty session types as coherence proofs
TLDR
A Curry–Howard correspondence between a language for programming multiparty sessions and a generalisation of Classical Linear Logic, which generalise the cut rule of CLL to a new rule for composing many processes communicating in a multiparty session is proposed. Expand
Multiparty Session Types as Coherence Proofs
TLDR
A Curry-Howard correspondence between a language for programming multiparty sessions and a generalisation of Classical Linear Logic, which generalise the cut rule of CLL to a new rule for composing many processes communicating in a multiparty session is proposed. Expand
Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols
TLDR
This paper provides a syntax-free description of session-based concurrency as states of coalgebras, and rediscovers type equivalence, duality, and subtyping relations in terms of canonical coinductive presentations, and shows that the relations and type system resulting from the coalgebraic perspective agree with the existing ones. 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
Manifest Deadlock-Freedom for Shared Session Types
TLDR
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 they may acquire is developed, 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. Expand
A Semantic Deconstruction of Session Types
TLDR
The semantic foundations of session types are investigated, by revisiting them in the abstract setting of labelled transition systems, and a simulation relation is found which generalises the usual syntax-directed notions of typing and subtyping and encompasses both synchronous and asynchronous binary session types. Expand
Deadlock-Free Typestate-Oriented Programming
TLDR
The static analysis technique described in this work can be used to certify programs written in a core language for concurrent TSOP with proven correctness guarantees and is an essential first step towards the integration and application of the technique in a real-world developer toolchain. Expand
Deadlock-Free Typestate-Oriented Programming Luca Padovani
Context. TypeState-Oriented Programming (TSOP) is a paradigm intended to help developers in the implementation and use of mutable objects whose public interface depends on their private state. UnderExpand
Type-Based Analysis of Linear Communications
TLDR
This chapter presents a tool called Hypha for the type-based analysis of processes that communicate on linear channels followed by the typing rules on which the tool is based in order to verify two properties of systems, deadlock freedom and lock freedom. Expand
Interconnectability of Session-Based Logical Processes
TLDR
This work introduces a new compositional synthesis property dubbed partial multiparty compatibility (PMC), enabling it to build a global type denoting the interactions obtained by iterated composition of well-typed CLL threads and shows that CLL composition induces PMC global types without circular interconnections between three (or more) participants. Expand
...
1
2
...

References

SHOWING 1-10 OF 31 REFERENCES
Inference of Global Progress Properties for Dynamically Interleaved Multiparty Sessions
TLDR
This paper develops a static analysis technique, specified as a set of syntax-directed inference rules, that is capable of verifying whether a system of processes engaged in simultaneously active multiparty sessions has the progress property. Expand
Typing Progress in Communication-Centred Systems
TLDR
This work presents a type system for the analysis of progress in session-based communication centred systems and addresses challenging scenarios which are unaccounted for elsewhere in the literature, in particular systems that interleave communications on received session channels. 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
From Lock Freedom to Progress Using Session Types
TLDR
A behavioral type system for ensuring progress in a language of binary sessions 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. Expand
Conversation types
TLDR
It is proved that well-typed systems never violate the prescribed conversation constraints, and techniques to ensure progress of systems involving several interleaved conversations are presented, a previously open problem. Expand
Global progress for dynamically interleaved multiparty sessions
TLDR
A novel static interaction type system for global progress in dynamically interleaved and interfered multiparty sessions infers causalities of channels making sure that processes do not get stuck at intermediate stages of sessions also in presence of delegation. Expand
A Type System for Flexible Role Assignment in Multiparty Communicating Systems
TLDR
This work presents a type-based analysis for statically verifying role-based multi-party interactions, based on a simple π-calculus model and prior work on conversation types, which ensures that well-typed systems follow the role- based protocols prescribed by the types. Expand
Multiparty Asynchronous Session Types
TLDR
The theory introduces a new notion of types in which interactions involving multiple peers are directly abstracted as a global scenario, and the fundamental properties of the session type discipline, such as communication safety, progress, and session fidelity, are established. Expand
Fundamentals of session types
TLDR
A reconstruction of session types in a linear pi calculus where types are qualified as linear or unrestricted, which leads to a surprisingly simply theory which extends typability when compared to traditional systems for session types. Expand
A New Type System for Deadlock-Free Processes
TLDR
It is shown that the simply-typed λ-Calculus with recursion can be encoded into the deadlock-free fragment of the authors' typed π-calculus, and is much more expressive than the previous type systems that admit type inference. Expand
...
1
2
3
4
...