Channel dependent types for higher-order mobile processes

ACM SIGPLAN Notices

Volumn 39, Issue 1, 2004, Pages 147-160

  Yoshida, Nobuko ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Access control; Mobile processes; Secrecy; The higher order calculus; Types

Indexed keywords

CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER NETWORKS; COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; DIFFERENTIATION (CALCULUS); MULTIMEDIA SYSTEMS; SECURITY OF DATA; WORLD WIDE WEB;

ACCESS CONTROL; CHANNEL DEPENDENT TYPES; HIGHER ORDER CODE MOBILITY; HIGHER ORDER MOBILE PROCESSES; NONINTERFERENCE THEOREM;

MOBILE COMPUTING;

EID: 1442336686     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964014     Document Type: Conference Paper

References (57)

1. Abadi, M., Secrecy by typing in security protocols. Journal of the ACM, 46(5):749-786, 1999.
2. Abadi, M., Banerjee, A., Heintze, N. and Riecke, J., A core calculus of dependency, POPL'99, ACM, 1999.
3. Abadi, M. and Fournet, C., Access Control based on Execution History, NDSS'03, California, 2003.
4. Abramsky, S., Jagadeesan, R. and Malacaria, P., Full Abstraction for PCF, 1994. Info. & Comp. 163 (2000), 409-470.
5. Berger, M., Honda, K. and Yoshida, N., Sequentiality and the π-Calculus, TLCA01, LNCS 2044, 29-45, Springer, 2001.
6. Berger, M., Honda, K. and Yoshida, N., Genericity and the π-Calculus, FoSSaCs'03, LNCS 2620, 103-119, Springer, 2003.
7. Bierman, G.M., Parkinson, M.J and Pitts, A.M., MJ: an imperative core calculus for Java and Java with effects, UCAM-CL-TR-563, Cambridge, 2003.
8. Box, D., Essential .Net Volume I: The Common Language Runtime. Addison Wesley, 2002.
9. Castagna, G., Vitek, J. and Zappa, F., The seal calculus, 2003, available from ftp://ftp.di.ens.fr/pub/castagna/.
10. Crafa, S., Bugliesi, M. and Castagna, G., Information Flow Security in Boxed Ambients, ENTCS 66 No. 3, 2003.
11. Denning, D. and Denning, P., Certification of programs for secure information flow. Communication of ACM, ACM, 20:504-513, 1997.
12. Fournet, C. and Gordon, A.D., Stack Inspection: theory and variants, POPL, 307-318, ACM, 2002.
13. Gordon, A. and Jeffrey, A., Typing correspondence assertions for communication protocols, TCS, 300(2003):379-409.
14. Grimm, R. and Bershad, B., Separating Access Control Policy, Enforcement, and Functionality in Extensible Systems, ACM Transactions on Computer Systems, 19(1):36-70, Feb., 2001.
15. Gong, L., Inside Java TM 2 Platform Security, Addison Wesley, 1999.
16. Heintze, N. and Riecke, J., The SLam Calculus: Programming with Secrecy and Integrity, POPL'98, pp.365-377. ACM Press, 1998.
17. Hennessy, M., Rathke, J. and Yoshida, N, SafeDpi: a language for controlling mobile code, Sussex Technical Report, 2003/02, 2003.
18. Honda, K., Composing Processes, POPL'96, pp.344-357, ACM, 1996.
19. Honda, K., Vasconcelos, V. and Yoshida, N, Secure Information Flow as Typed Process Behaviour, ESOP'00, LNCS 1782, pp. 180-199, Springer, 2000.
20. Honda, K. and Yoshida, N., On Reduction-Based Process Semantics. TCS, pp. 437-486, No.151, North-Holland, 1995.
21. Honda, K. and Yoshida, N. Game-theoretic analysis of call-by-value computation. TCS Vol. 221 (1999), 393-456, North-Holland, 1999.
22. Honda, K. and Yoshida, N., A Uniform Type Structure for Secure Information Flow, POPL'02, 81-92, ACM Press, 2002. The full version: a DOC technical report, Imperial College London, revised August 2003, available at: www.doc.ic.ac.uk/~yoshdia.
23. Honda, K. and Yoshida, N., Noninterference through Flow Analysis, 40 pages, Sep 2003, available at: www.doc.ic.ac.uk/~yoshdia.
24. Hyland, M. and Ong, L., "On Full Abstraction for PCF": I, II and III. Info. & Comp. 163 (2000), 285-408.
25. Igarashi, A. and Kobayashi, N., Resource Usage Analysis, POPL'02, 331-342, Portland, OR, ACM, 2002.
26. Igarashi, A. and Kobayashi, N., A Genetic Type System for the Pi-Calculus, POPL'01, 128-141. ACM, 2001. To appear in TCS
27. Igarashi, A., Pierce, B. and Wadler, P., Featherweight Java: A Minimal Core Calculus for Java and GJ. TOPLAS, 23(3):396-450, May 2001.
28. Java, Sun Microsystems Inc., http://www.javasoft.com/.
29. Jeffrety, A. and Rathke, J., Contextual equivalence for higher-order pi-calculus revisited, MFPS XIX, Montreal, 2003.
30. Kirli, D., Confined Mobile Functions, 14th CSFW, 2001.
31. Kobayashi, N., Pierce, B., and Turner, D., Linear types and the π-calculus, TOPLAS, 21(5):914-947, 1999.
32. Microsoft Corporation, .NET Framework Developer's Guide, http://msdn.microsoft.com, 2003.
33. Myers, M., JFlow: Practical mostly-static information flow control. POPL'99, 228-241, 1999.
34. Milner, R., Polyadic π-Calculus, Logic and Algebra of Specification, Springer, 1992.
35. Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes. Info. & Comp., 100(1), pp.1-77, 1992.
36. Necula, G., Proof-carrying code. POPL'96, ACM, 1996.
37. Pierce, B.C., Types and Programming Languages, MIT 2002.
38. Pottier, F., Skalka, C. and Smith, S., A systematic approach to access control. ESOP01, LNCS 30-45, Springer, 2001.
39. Riely,J. and Hennessy, M., Trust and partial typing in open systems of mobile agents. POPL'99, ACM Press, 1999.
40. Sangiorgi, D., Expressing Mobility in Process Algebras: First Order and Higher Order Paradigms. Ph.D. Thesis, University of Edinburgh, CST-99-93, 1993.
41. Sangiorgi, D., Asynchronous process calculi: the first-order and higher-order paradigms, TCS, 1999.
42. Sangiorgi, D., Termination of Processes, CONCUR'02, 2002.
43. Schmitt, A. and Stefani, J-B., The M-calculus: A Higher-Order Distributed Process Calculus, POPL03, ACM, 2003.
44. Sewell, P. and Vitek, J., Secure Composition of Untrusted Code: Box pi, Wrappers, and Casuality Types. Vol. 11, Number 2, 135-188, Journal of Computers Security, 2003.
45. Smith, G., A New Type System for Secure Information Flow, CSFW'01, IEEE 2001.
46. Smith, G. and Volpano, D., Secure information flow in a multi-threaded imperative language, pp. 355-364, POPL'98, ACM, 1998.
47. Vasconcelos, V., Typed concurrent objects. ECOOP'94, LNCS 821, pp.100-117. Springer-Verlag, 1994.
48. Wallach, D.S. et al., Extensible security architectures for Java. SOSP, 116-128, IEEE, 1997.
49. Wallach, D. S, et al., Safkasi: A security mechanism for language-based systems. ACM transaction on software engineering and methodology, 98(4):341-378, 2000.
50. Unypoth, A. and Sewell, P., Nomadic Pict: Correct Communication Infrastructure for Mobile Computation, POPL01, ACM, 2001.
51. Yoshida, N., Graph Types for Monadic Mobile Processes, FSTTCS'16, LNCS 1180, pp. 371-386, Springer, 1996. Full version as LFCS Technical Report, ECS-LFCS-96-350, 1996.
52. Yoshida, N., Type-Based Liveness Guarantee in the Presence of Nontermination and Nondeterminism, April 2002. MCS Technical Report, 2002-20, University of Leicester, available at www.mcs.le.ac.uk/~yoshida.
53. Yoshida, N., Berger, M. and Honda, K., Strong Normalisation in the π-Calculus, LICS'01, 311-322, IEEE, 2001. Full version: to appear in Journal of Info. & Comp., available at www.dos.ic.ac.uk/~yoshida.
54. Yoshida, N. and Hennessy, M., Subtyping and Locality in Distributed Higher Order Processes. CONCUR'99, LNCS 1664, pp.557-573, Springer, 1999.
55. Yoshida, N. and Hennessy, M., Assigning Types to Processes, Info. & Comp., Volume 174, Issue 2, 143-179, Academic Press, 2002. Extended abstract appeared in LICS'00.
56. Yoshida, N., Honda, K. and Berger, M. Linearity and Bisimulation, FoSSaCs 2002, LNCS 2303, pp.417-433. Springer, 2002.
57. The full version of this paper, Part I, II and III, available at www.doc.ic.ac.uk/~yoshida.