Linearity and bisimulation

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

Volumn 2303, Issue , 2002, Pages 417-433

  Yoshida, Nobuko ^a   Honda, Kohei ^b   Berger, Martin ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SEMANTICS;

BISIMULATIONS; LINEAR CHANNEL; LINEAR TYPES; LIVENESS PROPERTIES; NON TERMINATIONS; NON-DETERMINISM; SECURE INFORMATION FLOW; WEAK BISIMILARITY;

COMPUTATION THEORY;

EID: 19044369934     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45931-6_29     Document Type: Conference Paper

References (36)

1. Abadi, M., Secrecy by typing in security protocols. Journal of the ACM, 46(5):749–786, 1999.
2. Abadi, M., Secrecy in programming-language semantics, MFPS XV, ENTCS, 20 (April 1999).
3. Abadi, M., Banerjee, A., Heintze, N. and Riecke, J., A core calculus of dependency, POPL’99, ACM, 1999.
4. Abramsky, S., Jagadeesan, R. and Malacaria, P., Full Abstraction for PCF. Info. & Comp. 163(2000), 409–470.
5. Boreale, M. and Sangiorgi, D. Bisimulation in name-passing calculi without matching. LICS’98, IEEE, 1998.
6. Berger, M., Honda, K. and Yoshida, N., Sequentiality and the p-Calculus, TLCA’01, LNCS 2044, 29–45, Springer, 2001. The full version available at www.dcs.qmw.ac.uk/~kohei.
7. Boudol, G. and Castellani, I., Noninterference for Concurrent Programs, ICALP’01, LNCS, Springer, 2001.
8. Denning, D. and Denning, P., Certification of programs for secure information flow. Communication of ACM, ACM, 20:504–513, 1997.
9. Focardi, R. and Gorrieri, R., The compositional security checker: A tool for the verification of information flow security properties. IEEE Transactions on Software Engineering, 23(9), 1997.
10. Focardi, R., Gorrieri, R. and Martinelli, F., Non-interference for the analysis of cryptographic protocols. ICALP’00, LNCS 1853, Springer, 2000.
11. Gay, S. and Hole, M., Types and Subtypes for Client-Server Interactions, ESOP’99, LNCS 1576, 74–90, Springer, 1999.
12. Girard, J.-Y., Linear Logic, TCS, 50, 1–102, 1987.
13. Hennessy, M. and Rathke, J., Typed behavioural equivalences for processes in the presence of subtyping, To appear in Proc. CATS 2002.
14. Hennessy, M. and Riely, J., Information flow vs resource access in the asynchronous pi-calculus, ICALP’00, LNCS 1853, 415–427, Springer, 2000.
15. Honda, K., Types for Dyadic Interaction. CONCUR’93, LNCS 715, 509–523, 1993.
16. Honda, K., Composing Processes, POPL’96, 344–357, ACM, 1996.
17. Honda, K., Notes on Linear Typing for Free Outputs, May, 2001.
18. Honda, K., Kubo, M. and Vasconcelos, V., Language Primitives and Type Discipline for Structured Communication-Based Programming. ESOP’98, LNCS 1381, 122–138. Springer-Verlag, 1998.
19. Honda, K. and Tokoro, M. An object calculus for asynchronous communication. ECOOP’91, LNCS 512, 133–147, 1991.
20. Honda, K., Vasconcelos, V. and Yoshida, N., Secure Information Flow as Typed Process Behaviour, ESOP’00, LNCS 1782, 180–199, 2000.
21. Honda, K. and Yoshida, N. On Reduction-Based Process Semantics. TCS, 151, 437–486, 1995.
22. Honda, K. and Yoshida, N., Game-theoretic analysis of call-by-value computation. TCS, 221 (1999), 393–456, 1999.
23. Honda, K. and Yoshida, N., A uniform type structure for secure information flow, To appear in POPL’02, ACM, 2002.
24. Hyland, M. and Ong, L., “On Full Abstraction for PCF”: I, II and III. Info. & Comp. 163(2000), 285–408, 2000.
25. Kobayashi, N., Pierce, B., and Turner, D., Linearity and the p-calculus, POPL’96, 358–371, 1996.
26. Milner, R., Functions as Processes. MSCS, 2(2), 119–146, CUP, 1992.
27. Milner, R. and Sangiorgi, D., Barbed Bisimulation, ICALP’92, LNCS 623, 685–695, Springer, 1992.
28. Philippou, A. and Walker, D., On confluence in the p-Calculus, ICALP’97, LNCS 1256, 314–324, Springer, 1997.
29. Sangiorgi, D. p-calculus, internal mobility, and agent-passing calculi. TCS, 167(2):235–271, 1996.
30. Sangiorgi, D., The name discipline of uniform receptiveness, TCS, 221, 457–493, 1999.
31. Sabelfield, A. and Sands, D. A per model of secure information flow in sequential programs. ESOP’99, LNCS 1576, Springer, 1999.
32. Smith, G. and Volpano, D., Secure information flow in a multi-threaded imperative language, 355–364, POPL’98, ACM, 1998.
33. Vasconcelos, V., Typed concurrent objects. ECOOP’94, LNCS 821, 100–117. Springer, 1994.
34. Yoshida, N. Graph Types for Mobile Processes. FST/TCS’16, LNCS 1180, 371–386, Springer, 1996.
35. Yoshida, N., Berger, M. and Honda, K., Strong Normalisation in the p-Calculus, LICS’01, IEEE, 2001. The full version as MCS technical report, 2001-09, University of Leicester, 2001. Available at www.mcs.le.ac.uk/~nyoshida/paper.html.
36. A full version of this paper. MCS technical report, 2001-48, University of Leicester, 2001. Available at www.mcs.le.ac.uk/~nyoshida/paper.html.