References

  1. Martín Abadi & Cédric Fournet (2001): Mobile values, new names, and secure communication. In: Chris Hankin & Dave Schmidt: POPL. ACM, pp. 104–115. Available at http://doi.acm.org/10.1145/360204.360213.
  2. Martín Abadi & Andrew D. Gordon (1999): A Calculus for Cryptographic Protocols: The spi Calculus. Inf. Comput. 148(1), pp. 1–70. Available at http://dx.doi.org/10.1006/inco.1998.2740.
  3. Jesper Bengtson, Magnus Johansson, Joachim Parrow & Björn Victor (2011): Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods in Computer Science 7(1). Available at http://dx.doi.org/10.2168/LMCS-7(1:11)2011.
  4. Bruno Blanchet (2004): Automatic Proof of Strong Secrecy for Security Protocols. In: IEEE Symposium on Security and Privacy. IEEE Computer Society, pp. 86–102. Available at http://doi.ieeecomputersociety.org/10.1109/SECPRI.2004.1301317.
  5. Bruno Blanchet (2008): A Computationally Sound Mechanized Prover for Security Protocols. IEEE Trans. Dependable Sec. Comput. 5(4), pp. 193–207. Available at http://dx.doi.org/10.1109/TDSC.2007.1005.
  6. Maria Grazia Buscemi & Ugo Montanari (2007): CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements. In: Rocco De Nicola: 16th European Symposium on Programming Programming Languages and Systems (ESOP'07), LNCS 4421. Springer, pp. 18–32. Available at http://dx.doi.org/10.1007/978-3-540-71316-6_3.
  7. Luca Cardelli & Andrew D. Gordon (1998): Mobile Ambients. In: M. Nivat: Foundations of Software Science and Computation Structure, FoSSaCS'98, Lecture Notes in Computer Science 1378. Springer, pp. 140–155. Available at http://dx.doi.org/10.1007/BFb0053547.
  8. Anupam Datta, John C. Mitchell, Arnab Roy & Stephan Hyeonjun Stiller (2011): Protocol Composition Logic. In: V. Cortier & S. Kremer: Formal Models and Techniques for Analyzing Security Protocols. IOS Press, doi:10.3233/978-1-60750-714-7-182.
  9. Rocco De Nicola, Gian Luigi Ferrari, Ugo Montanari, Rosario Pugliese & Emilio Tuosto (2005): A Process Calculus for QoS-Aware Applications. In: Jean-Marie Jacquet & Gian Pietro Picco: 7th International Conference on Coordination Models and Languages, LNCS 3454. Springer, pp. 33–48. Available at http://dx.doi.org/10.1007/11417019_3.
  10. Saar Drimer, Steven J. Murdoch & Ross J. Anderson (2009): Optimised to Fail: Card Readers for Online Banking. In: Roger Dingledine & Philippe Golle: Financial Cryptography and Data Security, LNCS 5628. Springer, pp. 184–200. Available at http://dx.doi.org/10.1007/978-3-642-03549-4_11.
  11. Nancy A. Durgin, John C. Mitchell & Dusko Pavlovic (2003): A Compositional Logic for Proving Security Properties of Protocols. Journal of Computer Security 11(4), pp. 677–722. Available at http://iospress.metapress.com/content/lgf63yyhl3ajnddt/.
  12. Carl Ellison (2007): Ceremony Design and Analysis. Cryptology ePrint Archive, Report 2007/399. Available at http://eprint.iacr.org/2007/399.
  13. Jay L. Gischer (1984): Partial Orders and the Axiomatic Theory of Shuffle. CS, Stanford University.
  14. Rob J. van Glabbeek & Ursula Goltz (2001): Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37(4/5), pp. 229–327, doi:10.1007/s002360000041. Available at http://link.springer.de/link/service/journals/00236/bibs/1037004/10370229.htm.
  15. Michael Goldsmith, Gavin Lowe, Bill Roscoe, Peter Ryan & Steve Schneider (2000): Modelling and analysis of security protocols. Pearson Education.
  16. Davide Grohmann (2008): Security, Cryptography and Directed Bigraphs. In: 4th International Conference on Graph Transformations (ICGT'08), LNCS 5214. Springer-Verlag, pp. 487–489. Available at http://dx.doi.org/10.1007/978-3-540-87405-8_41.
  17. David Harel (1987): Statecharts: A Visual Formulation for Complex Systems. Science of Computer Programmings 8(3), pp. 231–274. Available at http://dx.doi.org/10.1016/0167-6423(87)90035-9.
  18. David Harel & Rami Marelly (2003): Come, Let's Play – Scenario-Based Programming Using LSCs and the Play-Engine. Springer. Available at http://www.springer.com/computer/programming/book/978-3-540-00787-6.
  19. David Harel & Amnon Naamad (1996): The STATEMATE Semantics of Statecharts. ACM Trans. Softw. Eng. Methodol. 5(4), pp. 293–333. Available at http://doi.acm.org/10.1145/235321.235322.
  20. David Harel, Jerzy Tiuryn & Dexter Kozen (2000): Dynamic Logic. MIT Press, Cambridge, MA, USA.
  21. Matthew Hennessy (2007): A Distributed Pi-Calculus. Cambridge University Press, doi:10.1017/CBO9780511611063.
  22. Matthew Hennessy & James Riely (2002): Resource Access Control in Systems of Mobile Agents. Inf. Comput. 173(1), pp. 82–120. Available at http://dx.doi.org/10.1006/inco.2001.3089.
  23. Hans Hüttel (2011): Typed psi-calculi. In: Joost-Pieter Katoen & Barbara König: CONCUR, Lecture Notes in Computer Science 6901. Springer, pp. 265–279. Available at http://dx.doi.org/10.1007/978-3-642-23217-6_18.
  24. Hans Hüttel (2013): On Representing Located Process Calculi in the psi-calculus. personal communication.
  25. Bruno Latour (2005): Reassembling the Social – An Introduction to Actor-Network-Theory. Oxford Univ. Press.
  26. Gavin Lowe (1996): Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. Software - Concepts and Tools 17(3), pp. 93–102, doi:10.1007/3-540-61042-1_43.
  27. Robin Milner (2009): The Space and Motion of Communicating Agents. Cambridge Univ.Press, doi:10.1017/CBO9780511626661.
  28. Robin Milner, Joachim Parrow & David Walker (1992): A Calculus of Mobile Processes, I-II. Information and Computation 100(1), pp. 1–77, doi:10.1016/0890-5401(92)90008-4.
  29. John C. Mitchell, Mark Mitchell & Ulrich Stern (1997): Automated analysis of cryptographic protocols using Murphi. In: IEEE Symposium on Security and Privacy. IEEE Computer Society, pp. 141–151. Available at http://doi.ieeecomputersociety.org/10.1109/SECPRI.1997.601329.
  30. Tobias Nipkow, Lawrence C. Paulson & Markus Wenzel (2002): Isabelle/HOL - A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science 2283. Springer. Available at http://dx.doi.org/10.1007/3-540-45949-9.
  31. Håkon Norman (2013): Event Structures as Psi-calculi. In: Tarmo Uustalu & Juri Vain: 25th Nordic Workshop on Programming Theory (NWPT13).
  32. Lawrence C. Paulson (1998): The Inductive Approach to Verifying Cryptographic Protocols. Journal of Computer Security 6(1-2), pp. 85–128. Available at http://iospress.metapress.com/content/5wlu8p2am1du051d/.
  33. Dusko Pavlovic & Catherine Meadows (2011): Actor-network procedures: Modeling multi-factor authentication, device pairing, social interactions. arXiv.org. Available at http://arxiv.org/abs/1106.0706.
  34. Benjamin C. Pierce & Davide Sangiorgi (1996): Typing and Subtyping for Mobile Processes. Mathematical Structures in Computer Science 6(5), pp. 409–453, doi:10.1.1.49.2751.
  35. Wolter Pieters (2011): Representing humans in system security models: An actor-network approach. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications 2(1), pp. 75–92.
  36. Andrew M. Pitts (2013): Nominal Sets: Names and Symmetry in Computer Science. Cambridge Tracts in Theoretical Computer Science 57. Cambridge Univ. Press, doi:10.1017/CBO9781139084673.
  37. Vaughan R. Pratt (1986): Modeling Concurrency with Partial Orders. J. Parallel Programming 15(1), pp. 33–71. Available at http://dx.doi.org/10.1007/BF01379149.
  38. Kenneth Radke, Colin Boyd, Juan Manuel González Nieto & Margot Brereton (2011): Ceremony Analysis: Strengths and Weaknesses. In: 26th IFIP-TC-11 International Information Security Conference (SEC), IFIP Advances in Information and Communication Technology 354. Springer, pp. 104–115. Available at http://dx.doi.org/10.1007/978-3-642-21424-0_9.
  39. Davide Sangiorgi & David Walker (2001): The π-Calculus: a Theory of Mobile Processes. Cambridge Univ. Press.
  40. Ulrich Stern & David L. Dill (1997): Parallelizing the Murphi Verifier. In: Orna Grumberg: 9th International Conference on Computer Aided Verification (CAV), LNCS 1254. Springer, pp. 256–278. Available at http://dx.doi.org/10.1007/3-540-63166-6_26.
  41. Glynn Winskel (1986): Event Structures. In: Advances in Petri Nets, LNCS 255. Springer, pp. 325–392. Available at http://dx.doi.org/10.1007/3-540-17906-2_31.
  42. Glynn Winskel & Mogens Nielsen (1995): Models for Concurrency. In: Samson Abramski, Dov M. Gabbay & Tom S.E. Maibaum: Handbook of Logic in Computer Science – vol 4 – Semantic Modelling. Oxford University Press, pp. 1–148.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org