Spi calculus translated to π-calculus preserving may-tests

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 22-31

  Baldamus, Michael ^a   Parrow, Joachim ^a   Victor, Björn ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CRYPTOGRAPHY; DATA STRUCTURES; ENCODING (SYMBOLS); MATHEMATICAL MODELS; NETWORK PROTOCOLS; SYNCHRONIZATION;

AUTHENTICATION PROTOCOLS; COMPUTER COMMUNICATION SERVICES; CONTEXT BISIMULATIONS; SPI CALCULUS;

SECURITY OF DATA;

EID: 4544313910     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. M. Abadi and C. Fournet. Mobile Values, New Names, and Secure Communication. In Principles of Programming Languages, pages 104-115. ACM, 2001. POPL '01 symposium proceedings.
2. M. Abadi and A. Gordon. The Spi Calculus. In Computer and Communications Security, pages 36-47. ACM, 1997. Conference proceedings.
3. M. Abadi and A. Gordon. A Calculus for Cryptographic Protocols: The Spi Calculus. Technical Report 149, SRC, Palo Alto, California, 1998.
4. M. Abadi and A. Gordon. A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation, 148(1): 1-70, 1999.
5. R. Amadio, D. Lugiez, and V. Vanackère. On the Symbolic Reduction of Processes with Cryptographic Functions. Theoretical Compututer Science, 290(1):695-740, 2003.
6. M. Baldamus, J. Parrow, and B. Victor. Spi Calculus Translated to π-Calculus Preserving May-Testing. Technical Report 2003-063, Department of Information Technology, Uppsala University, Sweden, 2003.
7. B. Blanchet. An Efficient Cryptographic Protocol Verifier based on Prolog Rules. In Computer Security Foundations, pages 82-96. IEEE, 2001. CSFW-14 proceedings.
8. M. Boreale. On the Expressiveness of Internal Mobility in Name-Passing Calculi. Theoretical Computer Science, 195:205-226, 1998.
9. M. Boreale and M. Buscemi. Experimenting with STA, a Tool for Automatic Analysis of Security Protocols. In Applied Computing, pages 281-285. ACM, 2002. SAC '02 proceedings.
10. J. Borgström and U. Nestmann. On Bisimulations for the Spi Calculus. Technical Report IC/2003/34, EPFL I&C, Lausanne, Switzerland, 2003.
11. M. Carbone and S. Maffeis. On the Expressive Power of Polyadic Synchronisation in π-Calculus. Nordic Journal of Computing, 10(2):70-98, 2003.
12. R. De Nicola and M. Boreale. Testing Equivalences for Mobile Processes. Information and Computation, 120:279-303, 1995.
13. R. De Nicola and M. Hennessy. Testing Equivalences for Processes. Theoretical Computer Science, 34:83-133, 1983.
14. G. Ferrari, U. Montanari, R. Raggi, and E. Tuosto. From Co-Algebraic Specifications to Implementation: The MIHDA Toolkit. In Formal Methods for Components and Objects, LNCS. Springer-Verlag, 2003. FMCO '03 symposium proceedings.
15. M. Merro and F. Zappa Nardelli. Bisimulation Proof Methods for Mobile Ambients. In Automata, Logic and Programming, LNCS 2719, pages 584-598. Springer-Verlag, 2003. ICALP '03 proceedings.
16. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Parts I+II. Information and Computation, 100:1-77, 1992.
17. Ping Yang, C. Ramakrishnan, and S. Smolka. A Logical Encoding of the π-Calculus: Model Checking Mobile Processes Using Tabled Resolution. Available via http://www.cs.sunysb.edu/~lmc/mmc, 2003.
18. D. Sangiorgi. Bisimulation in Higher-Order Calculi. Information and Computation, 131:141-178, 1996.
19. D. Sangiorgi and D. Walker. The π-Calculus: A Theory of Mobile Processes. Cambridge University Press, 2003.
20. B. Victor and F. Moller. The Mobility Workbench - A Tool for the π-Calculus. In Computer Aided Verification, LNCS 818, pages 428-440. Springer-Verlag, 1994. CAV '94 proceedings.