5 results
Andrea Cerone ; Matthew Hennessy.
We propose a process calculus to model high level wireless systems, where the topology of a network is described by a digraph. The calculus enjoys features which are proper of wireless networks, namely broadcast communication and probabilistic behaviour. We first focus on the problem of composing […]
Published on September 25, 2013
matthew hennessy.
We develop a version of the pi-calculus, picost, where channels are interpreted as resources which have costs associated with them. Code runs under the financial responsibility of owners; they must pay to use resources, but may profit by providing them. We provide a proof methodology for processes […]
Published on March 23, 2011
Adrian Francalanza ; Edsko DeVries ; Matthew Hennessy.
We define a pi-calculus variant with a costed semantics where channels are treated as resources that must explicitly be allocated before they are used and can be deallocated when no longer required. We use a substructural type system tracking permission transfer to construct coinductive proof […]
Published on June 26, 2014
Giovanni Bernardi ; Matthew Hennessy.
Session types are used to describe and structure interactions between independent processes in distributed systems. Higher-order types are needed in order to properly structure delegation of responsibility between processes. In this paper we show that higher-order web-service contracts can be used […]
Published on June 29, 2016
Daniele Gorla ; Matthew Hennessy ; Vladimiro Sassone.
We propose a simple global computing framework, whose main concern is code migration. Systems are structured in sites, and each site is divided into two parts: a computing body, and a membrane, which regulates the interactions between the computing body and the external environment. More precisely, […]
Published on December 20, 2005