Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Theoretical Computer Science
Abstractions for mobile computations
Secure Internet programming
Type-safe execution of mobile agents in anonymous networks
Secure Internet programming
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types and programming languages
Types and programming languages
Resource access control in systems of mobile agents
Information and Computation
Types for the ambient calculus
Information and Computation - IFIP TCS2000
What Are Polymorphically-Typed Ambients?
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Mobility Types for Mobile Ambients
ICAL '99 Proceedings of the 26th 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
Subtyping and Typing Algorithms for Mobile Ambients
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
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
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
Communication and mobility control in boxed ambients
Information and Computation
Information and Computation
Resource access and mobility control with dynamic privileges acquisition
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Basic observables for a calculus for global computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Behavioural typing for safe ambients
Computer Languages, Systems and Structures
Boxed ambients with communication interfaces
Mathematical Structures in Computer Science
Types for ambient and process mobility†
Mathematical Structures in Computer Science
Calculi, types and applications
Theoretical Computer Science
Access control in mobile ambient calculi: A comparative view
Theoretical Computer Science
Security types for dynamic web data
Theoretical Computer Science
Security types for dynamic web data
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Static vs dynamic typing for access control in pi-calculus
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
Hi-index | 0.00 |
We introduce an ambient-based calculus that combines ambient mobility with process mobility, uses group names to collect ambients with homologous features, and exploits co-moves and runtime type checking to implement flexible policies for controlling process activities. Types rely on group names and, to support dynamicity, may depend on group variables. Policies can dynamically change also through installation of co-moves. The compliance with ambient policies can be checked locally to the ambients and requires no global assumptions. We prove that the type assignment system and the operational semantics of the calculus are ‘sound', and define a sound and complete type inference algorithm which, when applied to terms whose type decorations only express the desired policies, computes the minimal type annotations required for their execution. As an application of our calculus, we present a couple of examples and linger on the setting up of policies for controlling the activities of the entities involved.