Confidentiality analysis of mobile systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1824 LNCS, Issue , 2000, Pages 135-154

  Feret, Jérǒme ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MOBILE AGENTS; STATIC ANALYSIS; CALCULATIONS; SEMANTICS;

COMMUNICATION TOPOLOGIES; MOBILE SYSTEMS; NON-UNIFORM; ABSTRACT INTERPRETATIONS; PI CALCULUS;

SEMANTICS; MOBILE AGENTS;

EID: 84906085593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45099-3_8     Document Type: Conference Paper

References (22)

1. Martin Abadi. Secrecy by typing in security protocol. In Proc. 5th FPCA, volume 523 of Lecture Notes in Computer Science, pages 427-447. Springer-Verlag, 1991
2. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217-248, 1992
3. C. Bodei, P. Degano, F. Nielson, and H. R. Nielson. Control flow analysis for the ?-calculus. In Proc. CONCUR'98, number 1466 in Lecture Notes in Computer Science, pages 84-98. Springer-Verlag, 1998
4. C. Bodei, P. Degano, F. Nielso n, and H. R. Nielson. Static analysis of processes for no read-up and no write-down. In Proc. FOSSACS'99, number 1578 in Lecture Notes in Computer Science, pages 120-134. Springer-Verlag, 1999
5. L. Cardelli and A. D. Gordon. Mobile ambients. In Foundations of Software Science and Computational Structures, volume 1378 of Lecture Notes in Computer Science, pages 140-155. Springer, 1998
6. C. Colby. Analyzing the communication topology of concurrent programs. In Symposium on Partial Evaluation and Program Manipulation, 1995
7. 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, 19 81
8. P. Cousot and R. Cousot. 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 Pr inciples of Programming Languages, pages 238-252, Los Angeles, California, U.S.A., 1977.
9. P. Cousot R. Cousot, Abstract interpretation frameworks.Journal of logic and computation, 2,(4):511-547, August,1992.
10. P. Cousot and R. Cousot. Comparing the Galois connection and widening-narrowing approaches to abstract interpretation. In Programming Language Implementation and Logic Programming, P roceedings of the Fourth International Symposium, PLILP'92, volume 631 of Lecture Notes in Computer Science, pages 269-295. Springer-Verlag, 1992
11. P. Cousot and N. Halbwachs. Automatic discovery of l inear restraints among variables of a program. In Proceedings of the Fifth Conference on Principles of Programming Languages. ACM Press, 1978
12. A. Deutsch. 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, pages 2-13. IEEE Computer Society Press, Los Alamitos, California, U.S.A., 1992
13. J. Feret. Conception de ?-sa : un analyseur statique ǵeń erique pour le ?-calcul. Ḿ emoire de dea, SPP, september 1999. Electronically available at http://www.di.ens.fr/?feret/dea.html
14. P. Gra nger. Static analysis of linear congruence equalities among variables of a program. In TAPSOFT'91, volume 493. Lecture Notes in Computer Science, 1991
15. Matthew Hennessy and James Riely. Resource access control in systems of mobile agents. In U. Nestmann and B. Pierce, editors, 3rd International Workshop on High-Level Concurrent Languages (HLCL'98), volume 16(3) of Electronic Notes in Theoretical Computer Science, Nice, September 1998. Elsevier. Available from http://www.elsevier.nl/locate/entcs. Full version available as Sussex CSTR 98/02, 1998. Available from http://www.cogs.susx.ac.uk/
16. K. Honda, V. Vasconcelos, and N. Yoshida. Secure information flow as types process behaviour. In Proc. ESOP'00, number 1782 in Lecture Notes in Computer Science. Springer-Verlag, 2000
17. M. Karr. Affine relationships among variables of a program. Acta Informatica, pages 133-151, 1976
18. R. Milner. The polyadic ?-calculus: a tutorial. In Proceedings of the International Summer School on Logic and Algebra of Specification. Springer Verlag, 1991
19. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100:1-77, 1992
20. James Riely and Matthew Hennessy. Secure resource access for mobile agents. Draft. Available from http://www.depaul.edu/~jriely, June 1999
21. D. N. Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, Edinburgh University, 1995
22. A. Venet. Automatic determination of communication topologies in mobile sys tems. In Proceedings of the Fifth International Static Analysis Symposium SAS'98, volume 1503 of Lecture Notes in Computer Science, pages 152-167. Springer-Verlag, 1998