We study a variant of Levi and Sangiorgi's Safe Ambients (SA) enriched with passwords
(SAP). In SAP by managing passwords, for example generating new ones and distributing …

We investigate strong normalization, confluence, and behavioral equality in the realm of
session-based concurrency. These interrelated issues underpin advanced correctness …

This paper provides a fully abstract semantics for a variant of the concurrent object calculus.
We define may testing for concurrent object components and then characterise it using a …

We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete
lattices. This theory improves over existing results by providing a way to compose arbitrarily …

Artificial intelligence (AI) receives attention in media as well as in academe and business. In
media coverage and reporting, AI is predominantly described in contrasted terms, either as …

This paper proposes a bisimulation theory based on multiparty session types where a
choreography specification governs the behaviour of session typed processes and their …

We develop a behavioural theory of distributed programs in the presence of failures such as
nodes crashing and links breaking. The framework we use is that of Dπ, a language in which …

The higher-order pi-calculus is an extension of the pi-calculus to allow communication of
abstractions of processes rather than names alone. It has been studied intensively by …

Bigraphs have been introduced with the aim to provide a topographical meta-model for
mobile, distributed agents that can manipulate their own communication links and nested …

The security π-calculus is a typed version of the asynchronous π-calculus in which the types,
in addition to constraining the input/output behaviour of processes, have security levels …