Bisimulation Proof Methods for Mobile Ambients (2003)
Cached
Download Links
- [ftp.di.ens.fr]
- [moscova.inria.fr]
- [ftp.di.ens.fr]
- [moscova.inria.fr]
- [ftp.di.ens.fr]
- DBLP
Other Repositories/Bibliography
by
Massimo Merro
,
Francesco Zappa Nardelli
| Venue: | IN PROC. OF ICALP’03, VOLUME 2719 OF LNCS |
| Citations: | 18 - 3 self |
BibTeX
@INPROCEEDINGS{Merro03bisimulationproof,
author = {Massimo Merro and Francesco Zappa Nardelli},
title = {Bisimulation Proof Methods for Mobile Ambients},
booktitle = {IN PROC. OF ICALP’03, VOLUME 2719 OF LNCS},
year = {2003},
pages = {584--598},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study the behavioural theory of Cardelli and Gordon's Mobile Ambients. We give an LTS based operational semantics, and a labelled bisimulation based equivalence that coincides with reduction barbed congruence. We also provide two up-to proof techniques that we use to prove a set of algebraic laws, including the perfect firewall equation.
