Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, II
Information and Computation
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for cryptographic protocols
Information and Computation
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
An Asynchronous Model of Locality, Failurem and Process Mobility
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Localities and Failures (Extended Abstract)
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Secure Implementation of Channel Abstractions
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Finite-Control Mobile Ambients
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Notes on Nominal Calculi for Security and Mobility
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
A Fully Abstract Model for Higher-Order Mobile Ambients
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Using Ambients to Control Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
HOPLA-A Higher-Order Process Language
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Complexity of Model Checking Mobile Ambients
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Communication Interference in Mobile Boxed Ambients
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
An Asynchronous, Distributed Implementation of Mobile Ambients
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Ambient Groups and Mobility Types
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
The Decidability of Model Checking Mobile Ambients
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Mobile processes: a commented bibliography
Modeling and verification of parallel processes
Proof methodologies for behavioural equivalence in DPI
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
The ambient calculus is a process calculus for describing mobile computation. We develop a theory of Morris-style contextual equivalence for proving properties of mobile ambients. We prove a context lemma that allows derivation of contextual equivalences by considering contexts of a particular limited form, rather than all arbitrary contexts. We give an activity lemma that characterizes the possible interactions between a process and a context. We prove several examples of contextual equivalence. The proofs depend on characterizing reductions in the ambient calculus in terms of a labelled transition system.