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 up-to proof techniques and prove a set of algebraic laws, including the perfect firewall equation.
Titolo: | Bisimulation proof methods for mobile ambients |
Autori: | |
Data di pubblicazione: | 2003 |
Serie: | |
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 up-to proof techniques and prove a set of algebraic laws, including the perfect firewall equation. |
Handle: | http://hdl.handle.net/11562/16680 |
ISBN: | 3540404937 |
Appare nelle tipologie: | 04.01 Contributo in atti di convegno |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.