Trust in the pi-calculus

Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2001, Pages 103-114

  Hepburn, Mark ^a   Wright, David ^a  

^a UNIVERSITY OF TASMANIA   (Australia)

Author keywords

Runtime coercion; Trust analysis; Type annotations; calculus

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DATA FLOW ANALYSIS; SECURITY OF DATA;

CALCULUS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0035790273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773184.773196     Document Type: Conference Paper

References (26)

1. http://www.beowuff.org/.
2. http://www.seti.org/.
3. http://www.distributed.net/.
4. http://www.popularpower.com/.
5. Abadi. Secrecy by typing in security protocols. In TACS: 3rd International Conference on Theoretical Aspects of Computer Software, 1997.
6. D. E. Denning. The limits of formal security models. National Computer Systems Security Award Acceptance Speech.
7. D. E. Denning. A lattice model of information flow. Communications of the ACM, 19(5):236-243, May 1976.
8. M. Hennessy and J. Riely. Information flow vs. resource access in the asynchronous pi-calculus. In 27th International Colloquium on Automata, Languages and Programming (ICALP '2000), Lecture Notes in Computer Science. Springer-Verlag, Berlin Germany, July 2000. A longer version appeared as Computer Science Technical Report 2000:03, School of Cognitive and Computing Sciences, University of Sussex.
9. K. Honda, V. Vasconcelos, and N. Yoshida. Secure information flow as typed process behaviour. In G. Smolka, editor, Programming Languages and Systems: Proceedings of the 9th European Symposium on Programming (ESOP 2000), Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS 2000), (Berlin, Germany, March/April 2000), volume 1782 of lncs, pages 180-199. sv, 2000.
10. A. Igarashi and N. Kobayashi. Type reconstruction for linear pi-calculus with I/O subtyping. Journal of Information and Computation, 161(1):1-44, 2000. An extended abstract appeared in the Proceedings of SAS '97, LNCS 1302.
11. F. Levi and C. Bodei. Security analysis for mobile ambients.
12. U. Martin and T. Nipkow. Boolean unification - the story so far. In C. Kirchner, editor, Unification, pages 437-456. Academic Press, 1990.
13. R. Milner. The polyadic π-calculus: A tutorial. In F. L. Hamer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, 1993.
14. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I. Information and Computation, 100(1):1-40, Sept. 1992.
15. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, II. Information and Computation, 100(1):41-77, Sept. 1992.
16. G. C. Necula and P. Lee. Safe, untrusted agents using proof-carrying code. In G. Vigna, editor, Mobile Agents and Security, volume 1419 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
17. P. Ørbæk. Can you Trust your Data? In M. I. S. P. D. Mosses and M. Nielsen, editors, Proceedings of the TAPSOFT/FASE'95 Conference, volume 915 of LNCS of Springer Lecture Notes in Computer Science, pages 575-590, Aarhus, Denmark, may 1995. Springer-Verlag.
18. J. Palsberg and P. Ørbæk. Trust in the λ-calculus. In A. Mycroft, editor, SAS'95: Static Analysis, volume 983 of Lecture Notes in Computer Science, pages 314-330. Springer-Verlag, 1995.
19. A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. Lecture Notes in Computer Science, 1576:40-58, 1999.
20. D. Sangiorgi. From pi-calculus to higher-order pi-calculus-and back. In TAPSOFT. Springer Verlag, LNCS 668, 1993.
21. P. Sewell and J. Vitek. Secure composition of untrusted code: Wrappers and causality types. Technical Report 478, Computer Laboratory, University of Cambridge, 1999.
22. V. T. Vasconcelos and K. Honda. Principal typing schemes in a polyadic pi-calculus. Lecture Notes in Computer Science, 715:524-??, 1993.
23. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167-187, Dec. 1996.
24. D. A. Wright. Reduction Types and Intensionality in the Lambda-Calculus, PhD thesis, University of Tasmania, 1992.
25. D. A. Wright. Linear, strictness and usage logics. In M. E. Houle and P. Eades, editors, Proceedings of Conference on Computing: The Australian Theory Symposium, pages 73-80, Townsville, Jan. 29-30 1996. Australian Computer Science Communications.
26. R. Yahalom, B. Klein, and T. Beth. Trust-based navigation in distributed systems, 1994.