Relating Process Languages for Security and Communication Correctness (Extended Abstract)

Nantes, Daniele; Pérez, Jorge A.

doi:10.1007/978-3-319-92612-4_5

Cited by 2 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Session types is a formalism to reason about processes, providing a typing discipline for concurrent programming based on process algebras such as the π-calculus [THK94,HVK98]. They have been deeply investigated in several contexts, as, for instance: detection of subtle errors in implementations; designing and analysis of choreographies between distributed systems as in multiparty session types; expressiveness power to model communication properties such as deadlock-freedom, abortable computations, nondeterminism, security, etc (see [Dd09,CCD16,CDPY15,NP18]). The work of Caires, Pfenning and Toninho [CPT16] proposes a connection between a type system for the synchronous π-calculus and intuitionistic linear logic that pro-vides a correspondence between cut elimination steps and process reductions, thus extending the Curry-Howard isomorphism to linear propositions as session types.…”

Section: Introductionmentioning

confidence: 99%

A Subexponential View of Domains in Session Types

Nantes,

Olarte,

Ventura

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Linear logic (LL) has inspired the design of many computational systems, offering reasoning techniques built on top of its meta-theory. Since its inception, several connections between concurrent systems and LL have emerged from different perspectives. In the last decade, the seminal work of Caires and Pfenning showed that formulas in LL can be interpreted as session types and processes in the π-calculus as proof terms. This leads to a Curry-Howard interpretation where proof reductions in the cutelimination procedure correspond to process reductions/interactions. The subexponentials in LL have also played an important role in concurrent systems since they can be interpreted in different ways, including timed, spatial and even epistemic modalities in distributed systems. In this paper we address the question: What is the meaning of the subexponentials from the point of view of a session type interpretation? Our answer is a π-like process calculus where agents reside in locations/sites and they make it explicit how the communication among the different sites should happen. The design of this language relies completely on the proof theory of the subexponentials in LL, thus extending the Caires-Pfenning interpretation in an elegant way.

show abstract