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
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Seal: A Framework for Secure Mobile Computations
ICCL'98 Workshop on Internet Programming Languages
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
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
Equational Properties of Mobile Ambients
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Trust and Partial Typing in Open Systems of Mobile Agents
Journal of Automated Reasoning
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
Information and Computation
Communication and mobility control in boxed ambients
Information and Computation
Information flow in secure contexts
Journal of Computer Security
Locating reaction with 2-categories
Theoretical Computer Science - Foundations of software science and computation structures
Information flow security in dynamic contexts
Journal of Computer Security
Role-based access control for boxed ambients
Theoretical Computer Science
Mobility control via passports
Information and Computation
Unwinding in Information Flow Security
Electronic Notes in Theoretical Computer Science (ENTCS)
Splitting Mobility and Communication in Boxed Ambients
Electronic Notes in Theoretical Computer Science (ENTCS)
Communication and mobility control in boxed ambients
Information and Computation
Information and Computation
Deriving bisimulation congruences: 2-categories vs precategories
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Types for security in a mobile world
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Instant polymorphic type systems for mobile process calculi: just add reduction rules and close
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Mobility control via passports
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Boxed Ambients (BA) replace Mobile Ambients'open capability with communication primitives acting across ambient boundaries. Expressiveness is achieved at the price of communication interferences on message reception whose resolution requires synchronisation of activities at multiple, distributed locations. We study a variant of BA aimed at controlling communication interferences as well as mobility ones. Our calculus draws inspiration from Safe Ambients (SA) (with passwords) and modifies the communication mechanism of BA. Expressiveness is maintained through a new form of co-capability that at the same time registers incoming agents with the receiver ambient and performs access control.