An efficiency preorder for processes
Acta Informatica
A calculus of mobile processes, II
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Bisimulation for higher-order process calculi
Information and Computation
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Theoretical Computer Science
Information and Computation
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Typing and Subtyping Mobility in Boxed Ambients
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
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
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Equational properties of mobile ambients
Mathematical Structures in Computer Science
Information and Computation
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the Relative Expressive Power of Ambient-Based Calculi
Trustworthy Global Computing
Formal Aspects in Security and Trust
Howe's Method for Calculi with Passivation
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Types for role-based access control of dynamic web data
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Characterizing contextual equivalence in calculi with passivation
Information and Computation
Reachability analysis in boxed ambients
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Basic observables for a calculus for global computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Extending howe's method to early bisimulations for typed mobile embedded resources with local names
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A mobility calculus with local and dependent types
Processes, Terms and Cycles
Formal verification of security preservation for migrating virtual machines in the cloud
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 0.00 |
Boxed Ambients (BA) replace Mobile Ambients' open capability with communication primitives acting across ambient boundaries. The expressiveness of the new communication model is achieved at the price of communication interferences whose resolution requires synchronisation of activities at multiple, distributed locations. We study a variant of BA aimed at controlling communication as well as mobility interferences. Our calculus modifies the communication mechanism of BA, and introduces a new form of co-capability, inspired from Safe Ambients (SA) (with passwords), that registers incoming agents with the receiver ambient while at the same time performing access control. We prove that the new calculus has a rich semantics theory, including a sound and complete coinductive characterisation, and an expressive, yet simple type system. Through a set of examples, and an encoding, we characterise its expressiveness with respect to both BA and SA.