Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource access control in systems of mobile agents
Information and Computation
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
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
Ambient Groups and Mobility Types
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Bisimulation in Name-Passing Calculi without Matching
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Towards a behavioural theory of access and mobility control in distributed systems
Theoretical Computer Science - Special issue: Foundations of wide area network computing
safeDpi: a language for controlling mobile code
Acta Informatica - Special issue: Types in concurrency. Part II , Guest Editor: R. De Nicola, D. Sangiorgi
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Pi-Calculus
Theoretical Computer Science
Mobility control via passports
Information and Computation
History-based access control for distributed processes
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
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
Information and Computation
| Hi-index | 0.00 |
Dp is a simple distributed extension of the π-calculus in which agents are explicitly located, and may use an explicit migration construct to move between locations. We introduce passports to control those migrations; in order to gain access to a location agents are now expected to show some credentials, granted by the destination location. Passports are tied to specific locations, from which migration is permitted. We describe a type system for these passports, which includes a novel use of dependent types, and prove that well-typing enforces the desired behaviour in migrating processes. Passports allow locations to control incoming processes. This induces major modifications to the observations which can be made of agentbased systems. Using the type system we describe these observations, and use them to build a loyal notion of observational equivalence. Finally we provide a complete proof technique in the form of a bisimilarity for establishing equivalences between systems.