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
Resource access control in systems of mobile agents
Information and Computation
Types for the ambient calculus
Information and Computation - IFIP TCS2000
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Replication in Concurrent Combinators
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Soundness of the Logical Framework for Its Typed Operational Semantics
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Using Ambients to Control Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Typing and Subtyping Mobility in Boxed Ambients
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
Trust and Partial Typing in Open Systems of Mobile Agents
Journal of Automated Reasoning
Towards a behavioural theory of access and mobility control in distributed systems
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Correspondence assertions for process synchronization in concurrent communications
Journal of Functional Programming
Information and Computation
Communication and mobility control in boxed ambients
Information and Computation
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
BASS: boxed ambients with safe sessions
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Types for security in a mobile world
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
A mobility calculus with local and dependent types
Processes, Terms and Cycles
Session types for object-oriented languages
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
Behavioural typing for safe ambients
Computer Languages, Systems and Structures
Calculi, types and applications
Theoretical Computer Science
Deriving Structural Labelled Transitions for Mobile Ambients
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Deriving structural labelled transitions for mobile ambients
Information and Computation
Types for role-based access control of dynamic web data
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Hi-index | 0.00 |
We define BACI(Boxed Ambients with Communication Interfaces), an ambient calculus with a flexible communication policy. Traditionally, typed ambient calculi have a fixed communication policy determining the kind of information that can be exchanged with a parent ambient, even though mobility changes the parent. BACI lifts that restriction, allowing different communication policies with different parents during computation. Furthermore, BACI separates communication and mobility by making the channels of communication between ambients explicit. In contrast with other typed ambient calculi where communication policies are global, each ambient in BACI is equipped with a description of the communication policies ruling its information exchange with parent and child ambients. The communication policies of ambients increase when they move: more precisely, when an ambient enters another ambient, the entering ambient and the host ambient can exchange their communication ports and agree on the kind of information to be exchanged. This information is recorded locally in both ambients. We show the type-soundness of BACI, proving that it satisfies the subject reduction property, and we study its behavioural semantics by means of a labelled transition system.