A calculus of mobile processes, I
Information and Computation
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
Journal of the ACM (JACM)
Shape analysis for mobile ambients
Proceedings of the 27th 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
Theoretical Computer Science
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Validating Firewalls in Mobile Ambients
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Automatic Determination of Communication Topologies in Mobile Systems
SAS '98 Proceedings of the 5th International Symposium on Static Analysis
Abstract Interpretation of Mobile Ambients
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Confidentiality Analysis of Mobile Systems
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
On Small Depth Threshold Circuits
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Verification of Embedded Software: Problems and Perspectives
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
A new occurrence counting analysis for bioambients
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Verification of communication protocols using abstract interpretation of FIFO queues
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
An analysis for proving temporal properties of biological systems
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Behavioural typing for safe ambients
Computer Languages, Systems and Structures
SAS'07 Proceedings of the 14th international conference on Static Analysis
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
| Hi-index | 0.00 |
We use Abstract Interpretation to automatically prove safety properties of mobile ambients with name communications. We introduce a non-standard semantics in order to distinguish different recursive instances of agents. This allows us to specify explicitly both the link between agents and the ambient names they have declared, and the link between agents and the ambients they have activated. Then we derive from this non-standard semantics an abstract semantics which focuses on interactions between agents. This abstract semantics describes non uniformly which agents can be launched in which ambients and which ambient names can be communicated to which agents. Such a description is required to prove security properties such as noninterference or confinement for instance.