Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
An overview of Manifold and its implementation
Concurrency: Practice and Experience
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Trust and partial typing in open systems of mobile agents
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A transition system semantics for the control-driven coordination language MANIFOLD
Theoretical Computer Science
Theoretical Computer Science
Hitting the distributed computing sweet spot with TSpaces
Computer Networks: The International Journal of Computer and Telecommunications Networking - pervasive computing
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modal logic
Modal and temporal properties of processes
Modal and temporal properties of processes
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mole – Concepts of a mobile agent system
World Wide Web
Types for the ambient calculus
Information and Computation - IFIP TCS2000
Nomadic Pict: Language and Infrastructure Design for Mobile Agents
IEEE Concurrency
Separability, Expressiveness, and Decidability in the Ambient Logic
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Global/Local Subtyping and Capability Inference for a Distributed pi-calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Secure Composition of Insecure Components
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Coordination models and languages
Coordination models and languages
Possible worlds and resources: the semantics of BI
Theoretical Computer Science - Mathematical foundations of programming semantics
Behavioural typing for safe ambients
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
We present a calculus for mobile systems, the main novel feature of which is the separation between dynamic and topological aspects of distributed computations. Our calculus realises the following basic assumptions: (1) every computation executes in a uniquely determined location, (2) processes modify the distributed structure by means of predefined operations, (3) the underlying programming language can be changed easily, and (4) locations are hierarchically organised. This paper introduces our calculus, and shows, that this separation of concerns leads to a perfect match between the logical, syntactical and algebraic theory. We discuss a core calculus, and extensions with local names and with multiple names.