Abstract
We propose an abstract interpretation-based analysis for automatically detecting all potential interactions between the agents of a part of a mobile system, without much knowledge about the rest of it.
We restrict our study to mobile systems written in the π-calculus, and introduce a non-standard semantics which restores the link between channels and the processes that have created them. This semantics also allows to describe the interaction between a system and an unknown context. It is, to the best of our knowledge, the first analysis for this problem. We then abstract this non-standard semantics into an approximated one so as to automatically obtain a non-uniform description of the communication topology of mobile systems which compute in hostile contexts.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M.: Secrecy by typing in security protocol. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 427–447. Springer, Heidelberg (1991)
Berry, G., Boudol, G.: The chemical abstract machine. Theoretical Computer Science 96, 217–248 (1992)
Bodei, C., Degano, P., Nielson, F., Nielson, H.R.: Control flow analysis for the π-calculus. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 84–98. Springer, Heidelberg (1998)
Bodei, C., Degano, P., Nielson, F., Nielson, H.R.: Static analysis of processes for no read-up and no write-down. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 120–134. Springer, Heidelberg (1999)
Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)
Colby, C.: Analyzing the communication topology of concurrent programs. In: Symposium on Partial Evaluation and Program Manipulation (1995)
Cousot, P.: Semantic foundations of program analysis. In: Muchnick, S.S., Jones, N.D. (eds.) Program Flow Analysis: Theory and Applications, ch. 10, pp. 303–342. Prentice-Hall, Inc, Englewood Cliffs (1981)
Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, U.S.A, pp. 238–252 (1977)
Cousot, P., Cousot, R.: Abstract interpretation frameworks. Journal of logic and computation 2(4), 511–547 (1992)
Cousot, P., Cousot, R.: Comparing the Galois connection and widening– narrowing approaches to abstract interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 269–295. Springer, Heidelberg (1992)
Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the Fifth Conference on Principles of Programming Languages. ACM Press, New York (1978)
Deutsch, A.: A storeless model of aliasing and its abstraction using finite representations of right-regular equivalence relations. In: Proceedings of the 1992 International Conference on Computer Languages, pp. 2–13. IEEE Computer Society Press, Los Alamitos (1992)
Feret, J.: Conception de π-sa: un analyseur statique générique pour le π- calcul. Mémoire de dea, SPP (September 1999), Electronically available at http://www.di.ens.fr/~feret/dea.html
Granger, P.: Static analysis of linear congruence equalities among variables of a program. In: Abramsky, S. (ed.) CAAP 1991 and TAPSOFT 1991. LNCS, vol. 493, Springer, Heidelberg (1991)
Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. In: Nestmann, U., Pierce, B. (eds.) 3rd International Workshop on High-Level Concurrent Languages (HLCL 1998), Nice. Electronic Notes in Theoretical Computer Science, vol. 16(3). Elsevier, Amsterdam (1998), Available from http://www.elsevier.nl/locate/entcs ; Full version available as Sussex CSTR98/02 (1998), Available from http://www.cogs.susx.ac.uk/
Honda, K., Vasconcelos, V., Yoshida, N.: Secure information flow as types process behaviour. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol. 1782, p. 180. Springer, Heidelberg (2000)
Karr, M.: Affine relationships among variables of a program. Acta Informatica, 133–151 (1976)
Milner, R.: The polyadic π-calculus: a tutorial. In: Proceedings of the International Summer School on Logic and Algebra of Specification. Springer, Heidelberg (1991)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation 100, 1–77 (1992)
Riely, J., Hennessy, M.: Secure resource access for mobile agents. Draft (June 1999), Available from http://www.depaul.edu/~jriely
Turner, D.N.: The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, Edinburgh University (1995)
Venet, A.: Automatic determination of communication topologies in mobile systems. In: Levi, G. (ed.) SAS 1998. LNCS, vol. 1503, pp. 152–167. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feret, J. (2000). Confidentiality Analysis of Mobile Systems. In: Palsberg, J. (eds) Static Analysis. SAS 2000. Lecture Notes in Computer Science, vol 1824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45099-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-45099-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67668-3
Online ISBN: 978-3-540-45099-3
eBook Packages: Springer Book Archive