We illustrate the concepts of sessions and session types as they have been developed in
the setting of the π-calculus. Motivated by the goal of obtaining a formalisation closer to …

Abstract Concurrent Constraint Programming (CCP) has been used over the last two
decades as an elegant and expressive model for concurrent systems. It models systems of …

Programming digital contracts comes with unique challenges, which include (i) expressing
and enforcing protocols of interaction,(ii) controlling resource usage, and (iii) preventing the …

We study the problem of parametric parallel complexity analysis of concurrent, message-
passing programs. To make the analysis local and compositional, it is based on a …

Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency
offering a logic for specifying reactive systems, ie, systems that continuously interact with the …

In this work, we present a new constraint-based workflow definition language called Saturn,
which uses Linear-time Temporal Logic (LTL) to express workflow constraints. A declarative …

Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency
offering a logic for specifying reactive systems, ie systems that continuously interact with the …

By classifying behaviors (rather than data values), behavioral types abstract structured
protocols and enforce disciplined message-passing programs. Many different behavioral …

Abstract The Conversation Calculus (CC) is a model of multiparty interactions which extends
the π-calculus with the notion of conversation—a possibly distributed medium in which …

We explore logical reasoning for the global calculus, a coordination model based on the
notion of choreography, with the aim to provide a methodology for specification and …