4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
A calculus of mobile processes, II
Information and Computation
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Theoretical Computer Science
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource access control in systems of mobile agents
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Types for the ambient calculus
Information and Computation - IFIP TCS2000
The Essence of Principal Typings
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Communication and mobility control in boxed ambients
Information and Computation
A mobility calculus with local and dependent types
Processes, Terms and Cycles
Behavioural typing for safe ambients
Computer Languages, Systems and Structures
Calculi, types and applications
Theoretical Computer Science
Access control in mobile ambient calculi: A comparative view
Theoretical Computer Science
Mobility control via passports
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 present a new kind of ambient calculus in which the open capability is replaced by direct mobility of generic processes. The calculus comes equipped with a labelled transition system in which types play a major role: this system allows us to show interesting algebraic laws. As usual, types express the communication, access and mobility properties of the modelled system, and inferred types express the minimal constraints required for the system to be well behaved.