A fully abstract symbolic semantics for Psi-Calculi

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 18, Issue , 2010, Pages 17-31

  Johansson, Magnus ^a   Victor, Björn ^a   Parrow, Joachim ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTER PROGRAMMING LANGUAGES; PATHOLOGY; SEMANTICS; SYSTEMS ENGINEERING;

APPLIED PI CALCULUS; BISIMULATION CONGRUENCES; BISIMULATION EQUIVALENCES; CONCURRENT CONSTRAINT; EFFICIENT IMPLEMENTATION; FULL ABSTRACTION; SYMBOLIC SEMANTICS; SYMBOLIC TRANSITION SYSTEMS;

CALCULATIONS;

EID: 79955424635     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.18.2     Document Type: Conference Paper

References (22)

1. Martín Abadi & Bruno Blanchet (2005): Analyzing Security Protocols with Secrecy Types and Logic Programs. Journal of the ACM 52(1), pp. 102-146.
2. Martín Abadi & Cédric Fournet (2001): Mobile Values, New Names, and Secure Communication. In: Proceedings of POPL '01. ACM, pp. 104-115.
3. Martín Abadi & Andrew D. Gordon (1999): A Calculus for Cryptographic Protocols: The Spi Calculus. Journal of Information and Computation 148(1), pp. 1-70.
4. Mathieu Baudet (2007): Sécurité des protocoles cryptographiques: aspects logiques et calculatoires. Ph.D. thesis, École Normale Supérieure de Cachan.
5. Jesper Bengtson, Magnus Johansson, Joachim Parrow & Björn Victor (2009): Psi-calculi: Mobile processes, nominal data, and logic. In: Proceedings of LICS 2009. IEEE, Computer Society Press, pp. 39-48.
6. Jesper Bengtson & Joachim Parrow (2009): Psi-calculi in Isabelle. In: Stefan Berghofer, Tobias Nipkow, Christian Urban & Makarius Wenzel, editors: Proc. of TPHOLs 2009, LNCS 5674. Springer, pp. 99-114.
7. Bruno Blanchet (2001): An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. CSFW'01: Proceedings of the 14th IEEE Computer Security Foundations Workshop, p. 82.
8. Bruno Blanchet, Martín Abadi & Cédric Fournet (2005): Automated Verification of Selected Equivalences for Security Protocols. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005). IEEE, Computer Society Press, pp. 331-340.
9. Michele Boreale & Rocco De Nicola (1996): A Symbolic Semantics for the p-Calculus. Journal of Information and Computation 126(1), pp. 34-52. Available as Report SI 94 RR 04, Universita "La Sapienza" di Roma; an extended abstract appeared in Proceedings of CONCUR '94, pages 299-314, LNCS 836.
10. Johannes Borgström (2008): Equivalences and Calculi for Formal Verifiation of Cryptographic Protocols. Ph.D. thesis, EPFL, Lausanne.
11. Johannes Borgström, Sébastien Briais & Uwe Nestmann (2004): Symbolic Bisimulation in the Spi Calculus. In: Proceedings of CONCUR 2004, LNCS 3170. Springer, pp. 161-176.
12. Johannes Borgström & Uwe Nestmann (2002): On Bisimulations for the Spi Calculus. In: Hélène Kirchner & Christophe Ringeissen, editors: Proceedings of AMAST 2002, LNCS 2422. Springer, pp. 287-303.
13. Sébastien Briais (2008): Theory and Tool Support for the Formal Verification of Cryptographic Protocols. Ph.D. thesis, EPFL, Lausanne.
14. Maria Grazia Buscemi & Ugo Montanari (2008): Open Bisimulation for the Concurrent Constraint Picalculus. In: Sophia Drossopoulou, editor: Proceedings of ESOP 2008, LNCS 4960. Springer, pp. 254-268.
15. Stéphanie Delaune, Steve Kremer & Mark Ryan (2007): Symbolic Bisimulation for the Applied Pi Calculus. In: Vikraman Arvind & Sanjiva Prasad, editors: Proc. of FSTTCS 2007, Lecture Notes in Computer Science 4855. Springer, pp. 133-145. Available at http://dx.doi.org/10.1007/978-3-540-77050-3-11.
16. Murdoch Gabbay & Andrew Pitts (2001): A New Approach to Abstract Syntax with Variable Binding. Formal Aspects of Computing 13, pp. 341-363.
17. Matthew Hennessy & Huimin Lin (1995): Symbolic Bisimulations. Theoretical Computer Science 138(2), pp. 353-389. Earlier version published as Technical Report 1/92, School of Cognitive and Computing Sciences, University of Sussex, UK.
18. Huimin Lin (1996): Symbolic Transition Graph with Assignment. In: Ugo Montanari & Vladimiro Sassone, editors: Proceedings of CONCUR '96, LNCS 1119. Springer, pp. 50-65.
19. Huimin Lin (2000): Computing Bisimulations for Finite-Control pi-Calculus. Journal of Computer Science and Technology 15(1), pp. 1-9.
20. A. M. Pitts (2003): Nominal Logic, A First Order Theory of Names and Binding. Information and Computation 186, pp. 165-193.
21. Davide Sangiorgi (1996): A Theory of Bisimulation for the p-calculus. Acta Informatica 33, pp. 69-97. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in the Proceedings of CONCUR '93, LNCS 715.
22. Björn Victor & Faron Moller (1994): The Mobility Workbench - A Tool for the p-Calculus. In: David Dill, editor: Proceedings of CAV '94, LNCS 818. Springer, pp. 428-440.