A typed process calculus for fine-grained resource access control in distributed computation

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

Volumn 2215, Issue , 2001, Pages 64-81

  Hoshina, Daisuke ^a   Sumii, Eijiro ^b   Yonezawa, Akinori ^b  

^a TOSHIBA CORPORATION   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL; CALCULATIONS; COMPUTER SOFTWARE; SEMANTICS;

DISTRIBUTED COMPUTATIONS; FINE-GRAINED CONTROL; OPERATIONAL SEMANTICS; PROCESS CALCULI; PROTECTION DOMAINS; RESOURCE ACCESS; RESOURCE ACCESS CONTROL; TYPE SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84979035734     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45500-0_3     Document Type: Conference Paper

References (22)

1. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security. ACM Press, 1997.
2. M. Bugliesi and G. Castagna. Secure safe ambients. In POPL'01. ACM Press, 2001.
3. L. Cardelli and A. D. Gordon. Mobile ambients. In FoSSaCS'98. Springer-Verlag, 1998.
4. L. Cardelli and A. D. Gordon. Secrecy and group creation. In CONCUR'2000. Springer-Verlag, 2000.
5. R. De Nicola, G. Ferrari, and R. Pugliese. Klaim: a kernel language for agents interaction and mobility. IEEE Trans. on Software Engineering, 24(5), 1998.
6. M. Dezani-Ciancaglini and I. Salvo. Security types for mobile safe ambients. In ASIAN'00, 2000.
7. C. Fournet, G. Gonthier, J. J. Levy, L. Maranget, and D. Remy. A calculusof mobile agents. In CONCUR'96. Springer-Verlag, 1996.
8. J. Gosling, B. Joy, and G. Steele. The Java language specification. Addison-Wesley, 1996.
9. N. Heintze and J. G. Riecke. The SLam calculus: Programming with secrecy and integrity. In POPL'98. ACM Press, 1998.
10. M. Hennessy and J. Riely. Resource access control in systems of mobile agents. In HLCL'98. Elsevier, 1998.
11. M. Hennessy and J. Rily. Information flow vs. resource access in the asynchronous pi-calculus(extended abstract). In ICALP'00, January 2000.
12. D. Hoshina, E. Sumii, and A. Yonezawa. A typed process calculus for fine-grained resource access control in distributed computation (full version), 2001. Available from http://www. yl. is. s. u-tokyo. ac. jp/-hoshina/papers/tacs01full. ps. gz.
13. N. Kobayashi, B. Pierce, and D. Turner. Linearity and the pi-calculus. In POPL'96. ACM Press, 1996.
14. F. Levi and D. Sangiorgi. Controlling interference in ambients. In POPL'00. ACM Press, 2000.
15. R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundationsof Computer Science, Department of Computer Science, University of Edinburgh, Octorber 1991.
16. B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structure in Computer Science, 6(5): 409-454, 1996.
17. B. Pierce and D. Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. In POPL'97. ACM Press, 1997.
18. J. Riely and M. Hennessy. A typed language for distributed mobile processes. In POPL'98. ACM Press, 1998.
19. J. Riely and M. Hennessy. Trust and partial typing in open systems of mobile agents. In POPL'99. ACM Press, 1999.
20. P. Sewell. Global/local subtyping and capability inference for a distributed π-calculus. In ICALP'98. Springer-Verlag, 1998. LNCS 1433.
21. J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, 1999. LNCS 1686.
22. N. Yoshida and M. Hennessy. Assigning types to processes. In LICS'00. IEEE, 2000.