Types for access control

Theoretical Computer Science

Volumn 240, Issue 1, 2000, Pages 215-254

  De Nicola, Rocco ^a   Ferrari, GianLuigi ^b   Pugliese, Rosario ^a   Venneri, Betti ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Access control; Coordination; Mobile agents; Network aware programming; Type systems

Indexed keywords

EID: 0000413440     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0304-3975(99)00232-7     Document Type: Article

References (39)

1. M. Abadi, Secrecy by typing in cryptographic protocols, in: M. Abadi, M. Ito (Eds.), Theoretical Aspects of Computer Software (TACS'97), Proc., Lecture Notes in Computer Science, vol. 1281, Springer, Berlin, 1997, pp. 611-638.
2. M. Abadi, A.D. Gordon, A calculus for cryptographic protocols: the spi calculus, Inform, and Comput. 148(1) (1999) 1-70.
3. M. Abadi, R. Stata, A type system for Java Bytecode subroutines, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1998, pp. 149-160. ACM Trans. Programm. Languages Systems, to appear.
4. R. Amadio, An asynchronous model of locality, failure and process mobility, in: D. Garlan, D. Le Metayer (Eds.), COORDINATION'97, Proc., Lecture Notes in Computer Science, vol. 1282, Springer, Berlin, 1997, pp. 374-391.
5. R. Amadio, L. Cardelli, Subtyping recursive types, ACM Trans. Programm. Languages Systems 15(4) (1993) 575-631.
6. R. Amadio, S. Prasad, Localities and failures, in: P.S. Thiagarajan (Ed.), Foundations of Software Technology and Theoretical Computer Science (FSTTCS'94), Proc., Lecture Notes in Computer Science, vol. 880, Springer, Berlin, 1994, pp. 205-216.
7. A. Arnold, J. Gosling, The Java Programming Language, Addison-Wesley, Reading, MA, 1996.
8. L. Bettini, R. De Nicola, G. Ferrari, R. Pugliese, Interactive mobile agents in X-KLAIM, Proc., IEEE 7th Internat. Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises, IEEE Computer Society Press, Silverspring, MD, 1998.
9. C. Bodei, P. Degano, F. Nielson, H.R. Nielson, Control flow analysis for the π-calculus, in: D. Sangiorgi, R. de Simone (Eds.), Concurrency Theory (CONCUR'98), Proc., Lecture Notes in Computer Science, vol. 1466, Springer, Berlin, 1998, pp. 611-638.
10. M. Boreale, D. Sangiorgi, Bisimulation in naming-passing calculi without matching, Proc. 13th IEEE Symp. on Logic in Computer Science (LICS '98), IEEE Computer Society Press, Silverspring, MD, 1998, pp. 165-175.
11. G. Boudol, Typing the use of resources in a concurrent calculus, in: R.K. Shyamasundar, K. Ueda (Eds.), Advances in Computing Science (ASIAN'97), Proc., Lecture Notes in Computer Science, vol. 1345, Springer, Berlin, 1997, pp. 239-253.
12. M. Brandt, F. Henglein, Coinductive axiomatization of recursive type equality and subtyping, in: P. de Groote, J.R. Hindley (Eds.), Third Internat. Conf. on Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 1210, Springer, Berlin, 1997, pp. 63-81.
13. L. Cardelli, A. Gordon, Mobile ambients, in: M. Nivat (Ed.), Foundations of Software Science and Computation Structures (FoSSaCS'98), Proc., Lecture Notes in Computer Science, vol. 1378, Springer, Berlin, 1998, pp. 140-155.
14. L. Cardelli, A. Gordon, Types for mobile ambients, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1999, pp. 79-92.
15. N. Carriero, D. Gelernter, Linda in context, Comm. ACM 32(4) (1989) 444-458.
16. N. Carriero, D. Gelernter, J. Leichter, Distributed data structures in Linda, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1986, pp. 236-242.
17. R. De Nicola, G. Ferrari, R. Pugliese, Coordinating mobile agents via blackboards and access rights, in: D. Garlan, D. Le Metayer (Eds.), Coordination Languages and Models (COORDINATION'97), Proc., Lecture Notes in Computer Science, vol. 1282, Springer, Berlin, 1997, pp. 220-237.
18. R. De Nicola, G. Ferrari, R. Pugliese, KLAIM: a Kernel language for Agents interaction and mobility, IEEE Trans. Software Eng. 24(5) (1998) 315-330.
19. R. De Nicola, R. Pugliese, A process algebra based on Linda, in: P. Ciancarini, C. Hankin (Eds.), COORDINATION'96, Proc. Lecture Notes in Computer Science, vol. 1061, Springer, Berlin, 1996, pp. 160-178. (Theoret. Comput. Sci., to appear.)
20. M. Dezani-Ciancaglini, U. de Liguoro, A. Piperno, A filter model for concurrent λ-calculi, SIAM J. Comput. 27(5) (1998) 1376-1419.
21. C. Fournet, G. Gonthier, J.-L. Levy, L. Maranget, D. Rémy, A calculus of mobile agents, in: U. Montanari, V. Sassone (Eds.), CONCUR'96, Proc., Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 406-421.
22. D. Gelernter, Generative communication in Linda, ACM Trans. Programm. Languages Systems 7(1) (1985) 80-112.
23. D. Gelernter, N. Carriero, S. Chandran et al., Parallel programming in Linda, Proc. IEEE Internat. Conf. on Parallel Programming, IEEE Computer Society Press, Silverspring, MD, 1985, pp. 255-263.
24. N. Heintz, J.G. Riecke, The SLam calculus: programming with secrecy and integrity, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1998, pp. 365-377.
25. M. Hennessy, J. Riely, Resource access control in systems of mobile agents, Proc. Internat. Workshop on High-Level Concurrent Languages, Electronic Notes in Theoretical Computer Science, vol. 16, Elsevier, Amsterdam, 1998.
26. N. Kobayashi, B. Pierce, D. Turner, Linearity and the π-calculus, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1996.
27. D. Kozen, J. Palsberg, M. Schwartzbach, Efficient recursive subtyping, Mathematical Structures in Computer Science 5 (1995) 113-125.
28. R. Milner, Communication and Concurrency, Prentice-Hall Int., Englewood Cliffs, NJ, 1989.
29. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes (Parts I and II), Inform. and Comput. 100 (1992) 1-77.
30. G. Necula, Proof-carrying code, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1997, pp. 106-119.
31. U. Nestmann, B.C. Pierce, Decoding choice encodings, in: U. Montanari, V. Sassone (Eds.), CONCUR'96, Proc., Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 179-194.
32. B. Pierce, D. Sangiorgi, Typing and subtyping for mobile processes, Math. Struct. Comput. Sci. 6(5) (1996) 409-454.
33. R. Pugliese, Semantic theories for asynchronous languages, Ph.D. Thesis VIII-96-6, Univ. di Roma "La Sapienza", Dip. Scienze dell'Informazione, 1996.
34. J. Riely, M. Hennessy, Trust and partial typing in open systems of mobile agents, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1999.
35. P. Sewell, Global/local subtyping and capability inference for a distributed π-calculus, in: K.G. Larsen, S. Skyum, G. Winskel (Eds.), Internat. Colloquium on Automata, Languages and Programming (ICALP'98), Proc., Lecture Notes in Computer Science, vol. 1443, Springer, Berlin, 1998, pp. 695-706.
36. R. Statman, Recursive types and the subject reduction theorem, Technical Report 94-164, Carnegie Mellon University, 1994.
37. J. Vitek, G. Castagna, Towards a calculus of secure mobile computations, Proc. Workshop on Internet Programming Languages, Chicago, 1998.
38. D. Volpano, G. Smith, A typed-based approach to program security, in: M. Bidoit, M. Dauchet (Eds.), Theory and Practice of Software Development (TAPSOFT'97), Proc., Lecture Notes in Computer Science, vol. 1214, Springer, Berlin, 1997, pp. 607-621.
39. D. Volpano, G. Smith, Secure information flow in a multi-threaded imperative language, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1998, pp. 355-364.