On bisimulations for the spi calculus

Mathematical Structures in Computer Science

Volumn 15, Issue 3, 2005, Pages 487-552

  Borgström, Johannes ^a   Nestmann, Uwe ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745873822     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129505004706     Document Type: Conference Paper

References (18)

1. Abadi, M. and Fournet, C. (2001) Mobile values, new names, and secure communication. Proceedings of POPL '01, ACM 104-115.
2. Abadi, M. and Gordon, A.D. (1998) A bisimulation method for cryptographic protocols. Nordic Journal of Computing 5 (4) 267-303.
3. Abadi, M. and Gordon, A.D. (1999) A calculus for cryptographic protocols: The Spi calculus. Journal of Information and Computation 148 (1) 1-70.
4. Boreale, M. (2004) Erratum of Proof techniques for cryptographic processes. (Unpublished manuscript.)
5. Boreale, M., De Nicola, R. and Pugliese, R. (1999) Proof techniques for cryptographic processes. Proceedings of LICS '99, IEEE, Computer Society Press 157-166.
6. Boreale, M., De Nicola, R. and Pugliese, R. (2002) Proof techniques for cryptographic processes. SIAM Journal on Computing 31 (3) 947-986.
7. Boreale, M. and Gorla, D. (2002) On compositional reasoning in the spi-calculus. Proceedings of FoSsaCS. Springer-Verlag Lecture Notes in Computer Science 2303 67-81.
8. Cortier, V. (2002) Observational equivalence and trace equivalence in an extension of spi-calculus. Technical Report LSV-02-3, Lab. Specification and Verification, ENS de Cachan.
9. Dolev, D. and Yao, A.C. (1983) On the security of public key protocols. IEEE Transactions on Information Theory 29 (2) 198-208.
10. Elkjær, A. S., Höhle, M., Hüttel, H. and Overgaard, K. (1999) Towards automatic bisimilarity checking in the spi calculus. Combinatorics, Computation & Logic. Australian Computer Science Communications 21 (3) 175-189.
11. Frendrup, U., Hüttel, H. and Jensen, J. N. (2001) Two notions of environment sensitive bisimilarity for spi-calculus processes. (Unpublished manuscript, available at http://www.cs.auc.dk/research/FS/ny/PR-pi/ESB/ twoNotionsofESB.ps.)
12. Hüttel, H. (2002) Deciding framed bisimilarity. Pre-proceedings of INFINITY '02 1-20.
13. Milner, R. (1989) Communication and Concurrency, Prentice Hall.
14. Milner, R., Parrow, J. and Walker, D. (1992) A calculus of mobile processes, part I/II. Journal of Information and Computation 100 1-77.
15. Milner, R., Parrow, J. and Walker, D. (1993) Modal logics for mobile processes. Theoretical Computer Science 114 149-171.
16. Milner, R. and Sangiorgi, D. (1992) Barbed bisimulation. In: Kuich, W. (ed.) Proceedings of ICALP '92. Springer-Verlag Lecture Notes in Computer Science 623 685-695.
17. Park, D. (1981) Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany. Springer-Verlag Lecture Notes in Computer Science 104 167-183.
18. Sangiorgi, D. (1998) On the bisimulation proof method. Mathematical Structures in Computer Science 8 (5) 447-479.