Information flow vs. resource access in the aqsynchronous pi-calculus

ACM Transactions on Programming Languages and Systems

Volumn 24, Issue 5, 2002, Pages 566-591

  Hennessy, Matthew ^a   Riely, James ^b  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b DEPAUL UNIVERSITY   (United States)

Author keywords

General security and protection (e.g., firewalls); Local and Wide Area Networks internet (e.g., CSMA CS); Network Architecture and Design distributed networks; Security and Protection information flow controls

Indexed keywords

EID: 0038893943     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/570886.570890     Document Type: Article

References (31)

1. ABADI, M. 1997. Secrecy by typing in security protocols. In Proceedings of TACS'97. Lecture Notes in Computer Science, vol. 1281. Springer Verlag, New York, pp. 611-637.
2. BELL, D. E. AND LAPADULA, L. J. 1995. Secure computer system: Unified exposition and multics interpretation. Tech. rep. MTR-2997. MITRE Corporation.
3. BODEI, C., DEGANO, P., NIELSON, F., AND NIELSON, H. R. 1998. Control flow analysis for the π-calculus. In Proceedings of CONCUR'98. Lecture Notes in Computer Science, vol. 1466. Springer-Verlag, New York, pp. 84-98.
4. BODEI, C., DEGANO, P., NIELSON, F., AND NIELSON, H. R. 1999. Static analysis of processes for no read-up and no write-down. In Proceedings of the Foundations of Software Science and Computation Structures (FOSSACS'99). Lecture Notes in Computer Science, vol. 1578. Springer-Verlag, New York, pp. 120-134.
5. BOUDOL, G. 1992. Asynchrony and the π-calculus. Tech. Rep. 1702. INRIA-Sophia Antipolis.
6. BOUDOL, G. AND CASTELLANI, I. 2001. Noninterference for concurrent programs. In Proceedings of ICALP'01. Lecture Notes in Computer Science, vol. 2076. Springer-Verlag, New York, pp. 382-395.
7. CASTELLANI, I. AND HENNESSY, M. 1998. Testing theories for asynchronous languages. In Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science (Chennai, India, Dec. 17-19). Lecture Notes in Computer Science, vol. 1530. Springer-Verlag, New York.
8. DE NICOLA, R. AND HENNESSY, M. 1984. Testing equivalences for processes. Theoret. Comput. Sci. 24, 83-113.
9. DENNING, D. 1977. Certification of programs for secure information flow. Commun. ACM 20, 504-513.
10. FOCARDI, R., GHELLI, A., AND GORRIERI, R. 1997. Using noninterference for the analysis of security protocols. In Proceedings of DIMACS Workshop on Design and Formal Verification of Security Protocols.
11. FOCARDI, R. AND GORRIERI, R. 1995. A classification of security properties for process algebras. J. Comput. Sec. 3, 1.
12. FOCARDI, R. AND GORRIERI, R. 1997a. The compositional security checker: A tool for the verification of information flow security properties. IEEE Trans. Softw. Eng. 23.
13. FOCARDI, R. AND GORRIERI, R. 1997b. Noninterference: Past, present and future. In Proceedings of DARPA Workshop on Foundations for Secure Mobile Code.
14. FOURNET, C., GONTHIER, G., LEVY, J. J., MARGANGET, L., AND REMY, D. 1996. A calculus of mobile agents. In CONCUR: Proceedings of the International Conference on Concurrency Theory (Pisa, Italy, Aug.) U. Montanari and V. Sassone, eds. Lecture Notes in Computer Science, vol. 1119, Springer-Verlag, New York, pp. 406-421.
15. GOGUEN, J. A. AND MESEGUER, J. 1992 Security policies and security models. In IEEE Symp. Sec. Priv.
16. HEINTZ, N. AND RIECKE, J. G. 1998. The SLam calculus: Programming with secrecy and integrity. In Conference Record of the ACM Symposium on Principles of Programming Languages (San Diego, Calif., Jan.). ACM, New York.
17. HENNESSY, M. AND RIELY, J. 2002. Resource access control in systems of mobile agents. Inf. Comput. 173, 82-120.
18. HONDA, K. AND TOKORO, M. 1992. On asynchronous communication semantics. In Proceedings of the ECOOP '91 Workshop on Object-Based Concurrent Computing, P. Wegner, M. Tokoro, O. Nierstrasz, eds. Lecture Notes in Computer Science, vol. 612. Springer-Verlag, New York.
19. HONDA, K., VASCONCELOS, V., AND YOSHIDA-HONDA, N. 2000. Secure information flow as typed process behaviour. In Proceedings of European Symposium on Programming (ESOP) 2000. Springer-Verlag, New York.
20. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall, Englewood Cliffs., N.J.
21. MILNER, R., PARROW, J., AND WALKER, D. 1993. Mobile logics for mobile processes. Theoret. Comput. Sci. 114, 149-171.
22. PIERCE, B. AND SANGIORGI, D. 1996. Typing and subtyping for mobile processes. Math. Struct. Comput. Sci. 6, 5, 409-454. (Extended abstract in LICS '93).
23. PIERCE, B. AND SANGIORGI, D. 1996. Typing and subtyping for mobile processes. Math. Struct. Comput. Sci. 6, 5, 409-454. (Extended abstract in LICS '93).
24. PIERCE, B. C. AND TURNER, D. N. 2000. Pict: A programming language based on the pi-calculus. In Proof, Language and Interacting: Essays in Honour of Robin Milner, Gorden Plotkin, Colin Stirling, and Mads Tofte, eds. MIT Press, Cambridge, Mass., pp. 455-494.
25. REITMAS, R. AND ANDREWS, G. 1980. An axiomatic approach to information flow in programs. ACM Trans. Prog. Lang. Syst. 2, 1, 56-76.
26. RIELY, J. AND HENNESSY, M. 1999. Trust and partial typing in open systems of mobile agents (extended abstract). In Conference Record of POPL '99 The 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, pp. 93-104.
27. ROSCOE, A. W., WOODCOCK, J. C. P., AND WULF, L. 1994. Non-interference through determinism. In European Symposium on Research in Computer Security. Lecture Notes in Computer Science, vol. 875. Springer-Verlag, New York.
28. RYAN, P. Y. A. AND SCHNEIDER, S. A. 1997. Process algebra and noninterference. In Proceedings of the Computer Security Foundations Workshop (CSFW 12). IEEE Computer Society Press, Los Alamitos, Calif.
29. SMITH, G. AND VOLPANO, D. 1998. Secure information flow in a multi-threaded imperative language. In Conference Record of the ACM Symposium on Principles of Programming Languages (San Diego, Calif., Jan.). ACM, New York.
30. VOLPANO, D., SMITH, G., AND IRVINE, C. 1996. A sound type system for secure flow analysis. J. Comput. Sec.
31. YOSHIDA, N. 1996. Graph types for monadic mobile processes. In Proceedings of the Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Lecture Notes in Computer Science, vol. 1180. Springer-Verlag, New York, pp. 371-386.