On Asynchronous Session Semantics

Kouzapas, Dimitrios; Yoshida, Nobuko; Honda, Kohei

doi:10.1007/978-3-642-21461-5_15

Cited by 23 publications

(39 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the origin and the nature of these commutations are quite different. In fact, while in [14] prefix commutation arises from the distinction mentioned above, commutations in our (synchronous) framework are due to causality relations captured by types.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Linear Logical Relations for Session-Based Concurrency

Pérez

Caires

Pfenning

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In prior work we proposed an interpretation of intuitionistic linear logic propositions as session types for concurrent processes. The type system obtained from the interpretation ensures fundamental properties of session-based typed disciplines-most notably, type preservation, session fidelity, and global progress. In this paper, we complement and strengthen these results by developing a theory of logical relations. Our development is based on, and is remarkably similar to, that for functional languages, extended to an (intuitionistic) linear type structure. A main result is that well-typed processes always terminate (strong normalization). We also introduce a notion of observational equivalence for sessiontyped processes. As applications, we prove that all proof conversions induced by the logic interpretation actually express observational equivalences, and explain how type isomorphisms resulting from linear logic equivalences are realized by coercions between interface types of session-based concurrent systems.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The only work on behavioral equivalences for session-based concurrency we are aware of is [14]. It studies the behavioral theory of a π-calculus with asynchronous session communication and an event inspection primitive for buffered messages.…”

Section: Related Workmentioning

confidence: 99%

Linear Logical Relations for Session-Based Concurrency

Pérez

Caires

Pfenning

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…While typed behavioural equivalences are one of the central topics of the π-calculus, surprisingly the typed behavioural semantics based on session types have been less explored, and the existing ones only focus on binary (two-party) sessions. Our work [14] develops an asynchronous binary session typed behavioural theory with event operations. An LTS is defined on session type process judgements and ensures session typed properties, such as linearity in the presence of asynchronous queues.…”

Section: Related and Future Workmentioning

confidence: 99%

Globally Governed Session Semantics

Kouzapas

Yoshida

2013

CONCUR 2013 – Concurrency Theory

Self Cite

View full text Add to dashboard Cite

Abstract. This paper proposes a new bisimulation theory based on multiparty session types where a choreography specification governs the behaviour of session typed processes and their observer. The bisimulation is defined with the observer cooperating with the observed process in order to form complete global session scenarios and usable for proving correctness of optimisations for globally coordinating threads and processes. The induced bisimulation is strictly more fine-grained than the standard session bisimulation. The difference between the governed and standard bisimulations only appears when more than two interleaved multiparty sessions exist. The compositionality of the governed bisimilarity is proved through the soundness and completeness with respect to the governed reduction-based congruence.

show abstract

“…This article presents a full version that combines the work published in two extended abstracts, the theoretical developments from (Hu et al, 2010) and the work in (Kouzapas et al, 2011). The core eventful session calculus used through this article was firstly proposed in (Hu et al, 2010).…”

Section: Introductionmentioning

confidence: 99%

“…The core eventful session calculus used through this article was firstly proposed in (Hu et al, 2010). Apart from including the detailed definitions and explanations, further results, more examples and complete proofs, the contributions of this article are: a new typing system for eventful sessions, which is simpler than the one in (Hu et al, 2010) and a new proof of the type-safety of the calculus; the full development of the bisimulation theory from (Kouzapas et al, 2011) together with more detailed analysis of properties of the behavioural theory; a new bisimulation technique for correctness of encodings of selectors and the Lauer-Needham transformation; and more detailed comparisons with other semantics. Since the article focuses on the type and behavioural theory of eventful computations, the design and implementation of Java with eventful session types presented in (Hu et al, 2010) is only outlined in Section 8.2.…”

Section: Introductionmentioning

confidence: 99%

On asynchronous eventful session semantics

Kouzapas¹,

Yoshida²,

Hu³

et al. 2014

Math. Struct. Comp. Sci.

Self Cite

View full text Add to dashboard Cite

Event-driven programming is one of the major paradigms in concurrent and communication-based programming, where events are typically detected as the arrival of messages on asynchronous channels. Unfortunately, the flexibility and performance of traditional event-driven programming come at the cost of more complex programs: low-level APIs and the obfuscation of event-driven control flow make programs difficult to read, write and verify. This paper introduces a π-calculus with session types that models event-driven session programming (called ESP) and studies its behavioural theory. The main characteristics of the ESP model are asynchronous, order-preserving message passing, non-blocking detection of event/message arrivals, and dynamic inspection of session types. Session types offer formal safety guarantees, such as communication and event-handling safety, and programmatic benefits that overcome problems with existing event-driven programming languages and techniques. The new typed bisimulation theory developed for the ESP model is distinct from standard synchronous or asynchronous bisimulation, capturing the semantic nature of eventful session-based processes. The bisimilarity coincides with reduction-closed barbed congruence. We demonstrate the features and benefits of event-driven session programming and the behavioural theory through two key usecases. First, we examine an encoding and the semantic behaviour of the event selector, a central component of general event-driven systems, providing core results for verifying type-safe event-driven applications. Second, we examine the Lauer-Needham duality, building on the selector encoding and bisimulation theory to prove that a systematic transformation from multithreaded to event-driven session processes is type-and semantics-preserving.

show abstract

On Asynchronous Session Semantics

Cited by 23 publications

References 22 publications

Linear Logical Relations for Session-Based Concurrency

Linear Logical Relations for Session-Based Concurrency

Globally Governed Session Semantics

On asynchronous eventful session semantics

Contact Info

Product

Resources

About