Search

• < Previous
• 1
• Next >

---

Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency

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&nbsp;[&hellip;]

---

Modelling Probabilistic Wireless Networks

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&nbsp;[&hellip;]

---

A calculus for costed computations

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&nbsp;[&hellip;]

---

Security Policies as Membranes in Systems for Global Computing

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,&nbsp;[&hellip;]

---