Parameterized, concurrent session types for asynchronous multi-actor interactions

Charalambides, Minas; Dinges, Peter; Agha, Gul

doi:10.1016/j.scico.2015.10.006

Cited by 19 publications

(13 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our approach using slots to deal with simultaneous multiple sessions resembles parameterised session types [41,42], and it is smoothly extendable to the multiparty session type framework [43]. For future work, we plan to investigate code generations from Scribble [44] (a protocol description language for the multiparty session types) along the line of [13,12] integrating session-ocaml with parameterised features [41,42].…”

Section: Resultsmentioning

confidence: 99%

Session-ocaml: A Session-Based Library with Polarities and Lenses

Imai

Yoshida

Yuen

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose session-ocaml, a novel library for session-typed concurrent/distributed programming in OCaml. Our technique solely relies on parametric polymorphism, which can encode core session type structures with strong static guarantees. Our key ideas are: ( ) polarised session types, which give an alternative formulation of duality enabling OCaml to automatically infer an appropriate session type in a session with a reasonable notational overhead; and ( ) a parameterised monad with a data structure called 'slots' manipulated with lenses, which can statically enforce session linearity and delegations. We show applications of session-ocaml including a travel agency usecase and an SMTP protocol.

show abstract

Section: Resultsmentioning

confidence: 99%

Session-ocaml: A Session-Based Library with Polarities and Lenses

Imai

Yoshida

Yuen

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In general, the programmers of individual endpoints in a modular development of some non-trivial multiparty application (e.g., not just binary RPCs) should commence development top-down from some notion of agreed protocolÐotherwise the separate programmers cannot locally determine the (inherently stateful) I/O structure that their endpoint should implement. Charalambides et al [2016] extend MPST theory with parameterised versions of session type operators that represent repeat applications of the operator for some parameter value (possibly run-time instantiated). Unlike our work, their system does not support role-parametric protocols as their approach expressly requires prohibiting separate occurrences of a role with different indices; this rules out, e.g., role-parametric pipeline structures.…”

Section: Related Workmentioning

confidence: 99%

Distributed programming using role-parametric session types in go: statically-typed endpoint APIs for dynamically-instantiated communication structures

Castro

Jongmans

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

This paper presents a framework for the static specification and safe programming of message passing protocols where the number and kinds of participants are dynamically instantiated. We develop the first theory of distributed multiparty session types (MPST) to support parameterised protocols with indexed rolesÐour framework statically infers the different kinds of participants induced by a protocol definition as role variants, and produces decoupled endpoint projections of the protocol onto each variant. This enables safe MPST-based programming of the parameterised endpoints in distributed settings: each endpoint can be implemented separately by different programmers, using different techniques (or languages). We prove the decidability of role variant inference and well-formedness checking, and the correctness of projection. We implement our theory as a toolchain for programming such role-parametric MPST protocols in Go. Our approach is to generate API families of lightweight, protocol-and variant-specific type wrappers for I/O. The APIs ensure a well-typed Go endpoint program (by native Go type checking) will perform only compliant I/O actions w.r.t. the source protocol. We leverage the abstractions of MPST to support the specification and implementation of Go applications involving multiple channels, possibly over mixed transports (e.g., Go channels, TCP), and channel passing via a unified programming interface. We evaluate the applicability and run-time performance of our generated APIs using microbenchmarks and real-world applications. CCS Concepts: • Computing methodologies → Distributed programming languages; • Software and its engineering → Source code generation; Concurrent programming languages;

show abstract

“…[Lange et al 2018] infers behavioural types from Go source code and uses a model checker to analyse safety and liveness properties. Session Types [Charalambides et al 2016;Deniélou et al 2012;Honda 1993;Honda et al 2012Honda et al , 2008Lange et al 2018] project a user-provided global protocol into a set of types for the various local processes of a program. Unlike us, however, they require the user to specify the global protocol and are not concerned with functional correctness.…”

Section: Related Workmentioning

confidence: 99%

Pretend synchrony: synchronous verification of asynchronous distributed programs

Gleissenthall

Kıcı

Bakst

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We present pretend synchrony, a new approach to verifying distributed systems, based on the observation that while distributed programs must execute asynchronously, we can often soundly treat them as if they were synchronous when verifying their correctness. To do so, we compute a synchronization, a semantically equivalent program where all sends, receives, and message buffers, have been replaced by simple assignments, yielding a program that can be verified using Floyd-Hoare style Verification Conditions and SMT. We implement our approach as a framework for writing verified distributed programs in Go and evaluate it with four challenging case studiesÐ the classic two-phase commit, the Raft leader election protocol, single-decree Paxos protocol, and a Multi-Paxos based distributed key-value store. We find that pretend synchrony allows us to develop performant systems while making verification of functional correctness simpler by reducing manually specified invariants by a factor of 6, and faster, by reducing checking time by three orders of magnitude. CCS Concepts: • Theory of computation → Program verification; Program analysis; Distributed computing models; Concurrency; • Software and its engineering → Software notations and tools.

show abstract

Parameterized, concurrent session types for asynchronous multi-actor interactions

Cited by 19 publications

References 16 publications

Session-ocaml: A Session-Based Library with Polarities and Lenses

Session-ocaml: A Session-Based Library with Polarities and Lenses

Distributed programming using role-parametric session types in go: statically-typed endpoint APIs for dynamically-instantiated communication structures

Pretend synchrony: synchronous verification of asynchronous distributed programs

Contact Info

Product

Resources

About