Hide and New in the Pi-Calculus

Hide and New in the Pi-Calculus

In this paper, we enrich the π-calculus with an operator for confidentiality (hide), whose main effect is to restrict the access to the object of the communication, thus representing confidentiality in a natural way. The hide operator is meant for local communication, and it differs from new in that it forbids the extrusion of the name and hence has a static scope. Consequently, a communication...

New directions in implementing the pi calculus

Do you know what the pi calculus is? It is a language invented ten years ago for describing concurrent and distributed systems. It has come to dominate theoretical research into concurrency and distribution, and now its time has come to be used in practice. The author, along with Laneve and Gardner, has recently developed a distributed virtual machine [10, 12, 2] for the pi calculus. This is ne...

Matching in the Pi-Calculus

We study whether, in the π-calculus, the match prefix—a conditional operator testing two names for (syntactic) equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables). Later on, Gorla developed a by now widely-tested set of criteria for encoding...

Genericity and the pi-Calculus

The pi-calculus

We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely following the intuitive arguments found in manual proofs. In this way we have covered many of the standa...