Results 1  10
of
50
Mobile ambients
, 1998
"... We introduce a calculus describing the movement of processes and devices, including ..."
Abstract

Cited by 917 (28 self)
 Add to MetaCart
We introduce a calculus describing the movement of processes and devices, including
Bisimulation Congruences in Safe Ambients
 In 29th ACM Symposium on Principles of Programming Languages (POPL
, 2001
"... We study a variant of Levi and Sangiorgi's Safe Ambients (SA) enriched with passwords (SAP). In SAP by managing passwords, for example generating new ones and distributing them selectively, an ambient may now program who may migrate into its computation space, and when. Moreover in SAP an ambie ..."
Abstract

Cited by 60 (7 self)
 Add to MetaCart
(Show Context)
We study a variant of Levi and Sangiorgi's Safe Ambients (SA) enriched with passwords (SAP). In SAP by managing passwords, for example generating new ones and distributing them selectively, an ambient may now program who may migrate into its computation space, and when. Moreover in SAP an ambient may provide different services depending on the passwords exhibited by its incoming clients. We give an lts based operational semantics for SAP and a labelled bisimulation based equivalence which is proved to coincide with barbed congruence. Our notion of bisimulation is used to prove a set of algebraic laws which are subsequently exploited to prove more significant examples. 1
A Spatial Logic for Concurrency (Part II)
 IN CONCUR2002: CONCURRENCY THEORY (13TH INTERNATIONAL CONFERENCE), LECTURE NOTES IN COMPUTER SCIENCE
, 1998
"... ..."
(Show Context)
Logical properties of name restriction
 Proc. 5th Int. Conf. Typed Lambda Calculi and Applications (TLCA’01), volume 2044 of Lecture Notes in Computer Science
, 2001
"... Abstract. We extend the modal logic of ambients described in [7] to the full ambient calculus, including name restriction. We introduce logical operators that can be used to make assertions about restricted names, and we study their properties. 1 ..."
Abstract

Cited by 47 (6 self)
 Add to MetaCart
(Show Context)
Abstract. We extend the modal logic of ambients described in [7] to the full ambient calculus, including name restriction. We introduce logical operators that can be used to make assertions about restricted names, and we study their properties. 1
The decidability of model checking mobile ambients
 In Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic, volume 2142 of LNCS
, 2001
"... We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replicationfree c ..."
Abstract

Cited by 43 (5 self)
 Add to MetaCart
We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replicationfree calculus and guaranteefree logic we prove that the problem is PSPACEcomplete. For the complexity upperbound, we devise a new representation of processes that remains of polynomial size during process execution; this allows us to keep the model checking procedure in polynomial space. Moreover, we prove PSPACEhardness of the problem for several quite simple fragments of the calculus and the logic; this suggests that there are no interesting fragments with polynomialtime model checking algorithms.
The Seal Calculus Revisited: contextual equivalence and bisimilarity
, 2003
"... We present a new version of the Seal Calculus, a calculus of mobile computation. We study observational congruence and bisimulation theory, and show how they are related. ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
We present a new version of the Seal Calculus, a calculus of mobile computation. We study observational congruence and bisimulation theory, and show how they are related.
Bisimulation Proof Methods for Mobile Ambients
 IN PROC. OF ICALP’03, VOLUME 2719 OF LNCS
, 2003
"... 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 upto proof techniques that we use to prove a set of algebraic ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
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 upto proof techniques that we use to prove a set of algebraic laws, including the perfect firewall equation.
A SpatioTemporal Logic for the Specification and Refinement of Mobile Systems
 OF LNCS
, 2003
"... We define a variant of Lamport’s Temporal Logic of Actions, extended by spatial modalities, that is intended for the specification of mobile systems with distributed state. We discuss notions of refinement appropriate for mobile systems, specifically concerning the topological structure of the syste ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
(Show Context)
We define a variant of Lamport’s Temporal Logic of Actions, extended by spatial modalities, that is intended for the specification of mobile systems with distributed state. We discuss notions of refinement appropriate for mobile systems, specifically concerning the topological structure of the system, and show how these can be represented in the logic via quantification and implication, ensuring transitivity and compositionality of refinements.
expressiveness and decidability in the ambient logic
 in: Proc. 17th Annual IEEE Symp. Logic in Computer Science (LICS’02), IEEE Computer
, 2002
"... The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the descriptive and discriminating power of AL, focusing on the equival ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
(Show Context)
The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the descriptive and discriminating power of AL, focusing on the equivalence on processes induced by the logic (=L). We consider MA, and two Turing complete subsets of it, MAIF and MA syn IF, respectively defined by imposing a semantic and a syntactic constraint on process prefixes. The main contributions include: coinductive and inductive operational characterisations of =L; an axiomatisation of =L on MA syn IF; the construc