Abstract
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.
This work was supported by the RTD project IST-1999-20527 “DAEDALUS” of the European FP5 programme.
Chapter PDF
Similar content being viewed by others
References
G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.
C. Bodei, P. Degano, F. Nielson, and H.R Nielson. Control flow analysis for the π-calculus. In Proc. CONCUR’98, LNCS. Springer-Verlag, 1998.
L. Cardelli, G. Ghelli, and A. D. Gordon. Secrecy and group creation. In Proc. CONCUR’00, LNCS. Springer-Verlag, 2000.
P. Cousot. Semantic foundations of program analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 10, pages 303–342. Prentice-Hall, Inc., Englewood Cliffs, 1981.
P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of logic and computation, 2(4):511–547, August 1992.
P. Cousot and R. Cousot. Comparing the Galois connection and widening—narrowing approaches to abstract interpretation. In Proc. PLILP’92, LNCS. Springer-Verlag, 1992.
J. Feret. Confidentiality analysis for mobiles systems. In Proc. SAS’00, LNCS. Springer-Verlag, 2000.
J. Feret. Occurrence counting analysis for the π-calculus. ENTCS, 39.2, 2001. Workshop on GEometry and Topology in COncurrency theory, PennState, USA, August 21, 2000.
M. Karr. Affine relationships among variables of a program. Acta Informatica, pages 133–151, 1976.
R. J. Parikh. On context-free languages. Journal of the ACM, 13:570–581, 1966.
D. N. Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, Edinburgh University, 1995.
A. Venet. Automatic determination of communication topologies in mobile systems. In Proc. SAS’98, LNCS. Springer-Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feret, J. (2002). Dependency Analysis of Mobile Systems. In: Le Métayer, D. (eds) Programming Languages and Systems. ESOP 2002. Lecture Notes in Computer Science, vol 2305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45927-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-45927-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43363-7
Online ISBN: 978-3-540-45927-9
eBook Packages: Springer Book Archive