Selected papers of the Second Workshop on Concurrency and compositionality
Journal of the ACM (JACM)
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
Control Flow Analysis for the pi-calculus
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Automatic Determination of Communication Topologies in Mobile Systems
SAS '98 Proceedings of the 5th International Symposium on Static Analysis
Confidentiality Analysis of Mobile Systems
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Abstract Interpretation-Based Certification of Assembly Code
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Relational Analysis of Correlation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Abstract interpretation of cellular signalling networks
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Relational analysis for delivery of services
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Flow Logic for Process Calculi
ACM Computing Surveys (CSUR)
Dependence analysis for safe futures
Science of Computer Programming
Static safety for an actor dedicated process calculus by abstract interpretation
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
| Hi-index | 0.00 |
We propose an Abstract Interpretation-based static analysis for automatically detecting the dependencies between the names linked to the agents of a mobile system. We focus our study on the mobile systems written in the 驴-calculus. We first refine the standard semantics in order to restore the relation between the names and the agents that have declared them. We then abstract the dependency relations that are always satisfied by the names of the agents of a mobile system. That is to say we will detect which names are always pair-wisely equal and which names have necessarily been declared by the same recursive instance of an agent.