ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of mobile processes, I
Information and Computation
ACM Computing Surveys (CSUR)
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Syntactic control of interference
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Information Processing Letters
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Name Discipline of Uniform Receptiveness (Extended Abstract)
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Global/Local Subtyping and Capability Inference for a Distributed pi-calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On abstract interpretation of mobile ambients
Information and Computation
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Communication and mobility control in boxed ambients
Information and Computation
Safe ambients: abstract machine and distributed implementation
Science of Computer Programming
BASS: boxed ambients with safe sessions
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Name-passing in an ambient-like calculus and its proof using spatial logic
Theoretical Computer Science - Expressiveness in concurrency
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
A coalgebraic approach to the semantics of the ambient calculus
Theoretical Computer Science - Algebra and coalgebra in computer science
Space-aware ambients and processes
Theoretical Computer Science
What is a free name in a process algebra?
Information Processing Letters
Electronic Notes in Theoretical Computer Science (ENTCS)
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
Symmetric electoral systems for ambient calculi
Information and Computation
Information flow security in Boundary Ambients
Information and Computation
Types for ambient and process mobility†
Mathematical Structures in Computer Science
Role-based access control for boxed ambients
Theoretical Computer Science
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
A Decentralized Implementation of Mobile Ambients
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Theoretical Computer Science
Signed and weighted trust credentials in fraglets
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
On the Relative Expressive Power of Ambient-Based Calculi
Trustworthy Global Computing
On the Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
Flow-sensitive Leakage Analysis in Mobile Ambients
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed Mobile Ambients in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Communication and mobility control in boxed ambients
Information and Computation
Deciding reachability problems in turing-complete fragments of mobile ambients
Mathematical Structures in Computer Science
From Flow Logic to static type systems for coordination languages
Science of Computer Programming
On bisimulation proofs for the analysis of distributed abstract machines
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
On recursion, replication and scope mechanisms in process calculi
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Abstract interpretation based verification of temporal properties for BioAmbients
Information and Computation
Mobility in computer science and in membrane systems
CMC'10 Proceedings of the 11th international conference on Membrane computing
Types for security in a mobile world
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Abstract machines for safe ambients in wide-area and mobile networks
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Flow Logic for Process Calculi
ACM Computing Surveys (CSUR)
A new occurrence counting analysis for bioambients
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Reachability analysis of mobile ambients in fragments of AC term rewriting
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
A correct abstract machine for safe ambients
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
An analysis for proving temporal properties of biological systems
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
A component model for the ABS language
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Coordinating parallel mobile ambients to solve SAT problem in polynomial number of steps
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Formalising security in ubiquitous and cloud scenarios
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
An object group-based component model
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Hi-index | 0.01 |
Two forms of interferences are individuated in Cardelli and Gordon's Mobile Ambients (MA): plain interferences, which are similar to the interferences one finds in CCS and π-calculus; and grave interferences, which are more dangerous and may be regarded as programming errors. To control interferences, the MA movement primitives are modified; the resulting calculus is called Mobile Safe Ambients (SA).The modification also has computational significance. In the MA interaction rules, an ambient may enter, exit, or open another ambient. The second ambient undergoes the action; it has no control on when the action takes place. In SA this is rectified: any movement takes place only if both participants agree.Existing type systems for MA can be easily adapted to SA. The type systems for controlling mobility, however, appear to be more powerful in SA, in that (i) type systems for MA may give more precise information when transplanted onto SA , and (ii) new type systems may be defined. Two type systems are presented that remove all grave interferences.Other advantages of SA are: a useful algebraic theory; programs sometimes more robust (they require milder conditions for correctness) and/or simpler. All these points are illustrated in several examples.