Sciweavers

ICALP
2003
Springer

Bisimulation Proof Methods for Mobile Ambients

13 years 8 months ago
Bisimulation Proof Methods for Mobile Ambients
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.
Massimo Merro, Francesco Zappa Nardelli
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where ICALP
Authors Massimo Merro, Francesco Zappa Nardelli
Comments (0)