On compositional reasoning in the spi-calculus

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

Volumn 2303, Issue , 2002, Pages 67-81

  Boreale, Michele ^a   Gorla, Daniele ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Axiomatization; Process calculi; Reasoning on security

Indexed keywords

COMPUTATION THEORY; NETWORK SECURITY;

AXIOMATIZATION; COMPOSITIONAL REASONING; OBSERVATIONAL EQUIVALENCES; PROCESS CALCULI; REASONING ON SECURITY; SECURITY PROTOCOLS; SOUND AND COMPLETE; SPI CALCULUS;

CALCULATIONS;

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

References (13)

1. M. Abadi, C. Fournet. Mobile Values, New Names and Secure Communication. POPL’01, Proceedings, 104-115.
2. M. Abadi, A.D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1-70, Academic Press, 1999.
3. M. Abadi, A.D. Gordon. A Bisimulation Method for Cryptographic Protocols. Nordic Journal of Computing, 5(4):267-303, 1998.
4. M. Boreale. Symbolic trace analysis of cryptographic protocols. ICALP’01, LNCS 2076, pp.667-681, Springer-Verlag, 2001.
5. M. Boreale, R. De Nicola. A Symbolic Semantics for the π-calculus. Information and Computation, vol.126, pp.34-52, 1996.
6. M. Boreale, R. De Nicola, R. Pugliese. Proof Techniques for Cryptographic Processes. LICS’99, Proceedings, IEEE Computer Society Press, pp.157-166, 1999. Full version to appear in SIAM Journal on Computing.
7. M. Boreale, R. De Nicola, R. Pugliese. Process Algebraic Analysis of Cryptographic Protocols. Proc. of 13th FORTE/20th PSV, Kluiver, 2000.
8. A.S. Elkjaer, M. Höhle, H. Hüttel, K.O. Nielsen. Towards Automatic Bisimilarity Checking in the Spi Calculus, Proc. of DMTCS’99+CATS’99, 1999.
9. M. Hennessy, H. Lin. Symbolic Bisimulations. Theoretical Computers Science, 138, pp. 353-389, 1995.
10. R. Milner. Communication and Concurrency. Prentice Hall International, 1989.
11. R. Milner. The poliadic π-calculus: a tutorial. Logic and Algebra of Specification, ed. F.L.Bauer, W.Bauer and H.Schwichtenberg Springer-Verlag, 1993.
12. R. Milner, D. Sangiorgi. Barbed Bisimulation. ICALP’92, Proceedings (W. Kuich, Ed.), LNCS 623, pp.685-695, Springer-Verlag, 1992.
13. J. Parrow, D. Sangiorgi. Algebraic theories for name-passing calculi. Information and Computation, 120, pp.174-197, 1995.