Projects per year
Abstract
A large variety of process calculi extend the pi-calculus with more general notions of messages. Bengtson et al. have shown that many of these pi-like calculi can be expressed as so-called psi-calculi. In this paper, we describe a simple type system for psi-calculi. The type system satisfies a subject reduction property and a general notion of channel safety. A number of existing systems are shown to be instances of our system, and other, new type systems can also be obtained. We first present a new type system for the calculus of explicit fusions by Wischik and Gardner, then one for the distributed pi-calculus of Hennessy and Riely and finally show how existing type systems for secrecy and authenticity in the spi calculus can be represented and shown to be safe.
Original language | English |
---|---|
Book series | Lecture Notes in Computer Science |
Volume | 6901 |
Pages (from-to) | 265-279 |
Number of pages | 15 |
ISSN | 0302-9743 |
DOIs | |
Publication status | Published - 2011 |
Event | 22nd International Conference on Concurrency Theory - Aachen, Germany Duration: 6 Sept 2011 → 9 Sept 2011 Conference number: 22 |
Conference
Conference | 22nd International Conference on Concurrency Theory |
---|---|
Number | 22 |
Country/Territory | Germany |
City | Aachen |
Period | 06/09/2011 → 09/09/2011 |
Projects
- 1 Finished
-
BETTY: Behavioural Types for Reliable Large-Scale Software Systems
01/10/2012 → 01/11/2015
Project: Research