(Enter summary)
Abstract: We develop some theory of the ambient calculus, based on a labeled
transition system, strong bisimilarity and contextual equivalence.
The goal of this Annex to the main paper is to recast notions of observational
equivalence from the ß-calculus in the setting of the ambient calculus,
so as to reason about mobile computation. In Section 1 we review the technical
definitions of the ambient calculus from the main part of the paper.
In Section 2 we define the commitment relation, a labeled... (Update)
Context of citations to this paper: More
.... is higher order as we are sending processes over channels, the definition is thus related to Thomsen s Higher Order Applicative Bisimulation [18, 3]. If R is a relation on well formed processes, then we define the relation R [ on processes such that P R [ P 0 iff for any...
.... is higher order as we are sending processes over channels, the definition is thus related to Thomsen s Higher Order Applicative Bisimulation [18, 3]. If R is a relation on well formed processes, then we define the relation R ## on processes such that P R ## P 0 iff for any x...
Cited by: More
Mobile Computations and Hostile Hosts - Vitek, Castagna (1999)
(Correct)
Similar documents (at the sentence level):
5.2%: A Commitment Relation for the Ambient Calculus - Luca Cardelli Luca (1996)
(Correct)
Active bibliography (related documents): More All
0.1: A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1998)
(Correct)
0.1: Reasoning about Cryptographic Protocols in the Spi Calculus - Abadi, Gordon (1997)
(Correct)
0.1: Equational Properties of Mobile Ambients - Gordon, Cardelli (1999)
(Correct)
Similar documents based on text: More All
0.5: The Q-convexity. - Alain
(Correct)
0.2: Bisimilarity for a First-Order Calculus of Objects with Subtyping - Gordon, Rees (1996)
(Correct)
0.2: Mobile Ambients - Cardelli, Gordon (1998)
(Correct)
Related documents from co-citation: More All
2: A calculus of mobile agents
- Fournet, Gonthier et al. - 1996
2: Type-safe execution of mobile agents in anonymous networks
- Hennessy, Riely - 1998
2: Protecting mobile agents against malicious hosts
- Sander, Tschudin
BibTeX entry: (Update)
L. Cardelli and A. D. Gordon. Mobile Ambients--annex--. Manuscript, Microsoft Research, 1997. http://citeseer.ist.psu.edu/article/cardelli97mobile.html More
@incollection{ cardelli97mobile,
author = "Luca Cardelli",
title = "{Mobile Computations}",
booktitle = "Mobile Object Systems: Towards the Programmable Internet",
volume = "1222",
publisher = "Springer-Verlag: Heidelberg, Germany",
editor = "{Jan Vitek} and {Christian Tschudin}",
pages = "3--6",
year = "1997",
url = "citeseer.ist.psu.edu/article/cardelli97mobile.html" }
Citations (may not include all citations):
854
Information and Computation (context) - Milner, Parrow et al. - 1992
502
Concurrency and automata on infinite sequences (context) - Park - 1981
447
Prentice-Hall International (context) - Milner, Concurrency - 1989
404
A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1997
248
Expressing Mobility (context) - Sangiorgi - 1992
168
Testing equivalences for processes (context) - De Nicola, Hennessy - 1984
11
Undergraduate lecture notes (context) - Milner - 1995
Documents on the same site (http://www.luca.demon.co.uk/Bibliography.html): More
On Binary Methods - Bruce, Cardelli, Castagna, Eifrig.. (1995)
(Correct)
Subtyping and Parametricity - Plotkin, Abadi, Cardelli (1993)
(Correct)
On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC