Bisimulation proof methods for mobile ambients

Massimo Merro; Francesco Zappa Nardelli

doi:10.1007/3-540-45061-0_47

Bisimulation proof methods for mobile ambients

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

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.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger
Publisher	Springer Verlag
Pages	584-598
Number of pages	15
ISBN (Print)	3540404937, 9783540404934
DOIs	https://doi.org/10.1007/3-540-45061-0_47
Publication status	Published - 1 Jan 2003
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2719
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/3-540-45061-0_47

Cite this

Merro, M., & Zappa Nardelli, F. (2003). Bisimulation proof methods for mobile ambients. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, & G. J. Woeginger (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 584-598). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2719). Springer Verlag. https://doi.org/10.1007/3-540-45061-0_47

Merro, Massimo ; Zappa Nardelli, Francesco. / Bisimulation proof methods for mobile ambients. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Jos C. M. Baeten ; Jan Karel Lenstra ; Joachim Parrow ; Gerhard J. Woeginger. Springer Verlag, 2003. pp. 584-598 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{e6803d16f1c9432e8ef3c05c2ffd68c3,

title = "Bisimulation proof methods for mobile ambients",

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.",

author = "Massimo Merro and \{Zappa Nardelli\}, Francesco",

year = "2003",

month = jan,

day = "1",

doi = "10.1007/3-540-45061-0\_47",

language = "English",

isbn = "3540404937",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "584--598",

editor = "Baeten, \{Jos C. M.\} and Lenstra, \{Jan Karel\} and Joachim Parrow and Woeginger, \{Gerhard J.\}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Merro, M & Zappa Nardelli, F 2003, Bisimulation proof methods for mobile ambients. in JCM Baeten, JK Lenstra, J Parrow & GJ Woeginger (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2719, Springer Verlag, pp. 584-598. https://doi.org/10.1007/3-540-45061-0_47

Bisimulation proof methods for mobile ambients. / Merro, Massimo; Zappa Nardelli, Francesco.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Jos C. M. Baeten; Jan Karel Lenstra; Joachim Parrow; Gerhard J. Woeginger. Springer Verlag, 2003. p. 584-598 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2719).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Bisimulation proof methods for mobile ambients

AU - Merro, Massimo

AU - Zappa Nardelli, Francesco

PY - 2003/1/1

Y1 - 2003/1/1

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-45061-0_47

DO - 10.1007/3-540-45061-0_47

M3 - Chapter

AN - SCOPUS:35248826856

SN - 3540404937

SN - 9783540404934

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 584

EP - 598

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Baeten, Jos C. M.

A2 - Lenstra, Jan Karel

A2 - Parrow, Joachim

A2 - Woeginger, Gerhard J.

PB - Springer Verlag

ER -

Merro M, Zappa Nardelli F. Bisimulation proof methods for mobile ambients. In Baeten JCM, Lenstra JK, Parrow J, Woeginger GJ, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 584-598. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45061-0_47

Bisimulation proof methods for mobile ambients

Abstract

Publication series

Access to Document

Fingerprint

Cite this