Declarative interpretations of session-based concurrency

Abstract

Session-based concurrency is a type-based approach to the analysis of communication-intensive systems. Correct behavior in these systems may be specified in an operational or declarative style: the former defines how interactions are structured; the latter defines governing conditions. In this paper, we investigate the relationship between operational and declarative models of session-based concurrency. We propose two interpretations of session π-calculus processes as declarative processes in linear concurrent constraint programming (lcc). They offer a basis on which both operational and declarative requirements can be specified and reasoned about. By coupling our interpretations with a type system for lcc, we obtain robust declarative encodings of π-calculus mobility.

Session-based concurrency, declaratively

“…This paper builds upon results first reported in the conference paper [17]. Such results include (i) an encoding of π into lcc, as well as (ii) an encoding of an extension of π with session establishment into a variant of lcc.…”

The Challenge of Typed Expressiveness in Concurrency

“…López et al [42] encode binary session processes into a declarative process calculus, enabling the transfer of LTL reasoning to scenarios of session communications. Cano et al [10] encode a session π-calculus into declarative process calculus with explicit linearity and establish strong operational correspondences. Padovani [47] relates labeled choice operators in session types with intersection and union types.…”