Advertisement

Extended pi-Calculi

  • Magnus Johansson
  • Joachim Parrow
  • Björn Victor
  • Jesper Bengtson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5126)

Abstract

We demonstrate a general framework for extending the pi-calculus with data terms. In this we generalise and improve on several related efforts such as the spic calculus and the pi-calculus, also including pattern matching and polyadic channels. Our framework uses a single untyped notion of agent, name and scope, an operational semantics without structural equivalence and a simple definition of bisimilarity. We provide general criteria on the semantic equivalence of data terms; with these we prove algebraic laws and that bisimulation is preserved by the operators in the usual way. The definitions are simple enough that an implementation in an automated proof assistant is feasible.

Keywords

Pattern Match Operational Semantic Data Term Cryptographic Protocol Label Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, part I/II. Journal of Information and Computation 100, 1–77 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Milner, R.: The polyadic π-calculus: A tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. Series F., NATO ASI, vol. 94. Springer, Heidelberg (1993)Google Scholar
  3. 3.
    Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The Spi calculus. Journal of Information and Computation 148, 1–70 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of POPL 2001, pp. 104–115. ACM, New York (2001)Google Scholar
  5. 5.
    Borgström, J., Nestmann, U.: On bisimulations for the spi calculus. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol. 2422, pp. 287–303. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in π-calculus. Nordic Journal of Computing 10(2), 70–98 (2003)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  8. 8.
    Abadi, M., Gordon, A.D.: A bisimulation method for cryptographic protocols. Nordic Journal of Computing 5(4), 267–303 (1998)zbMATHMathSciNetGoogle Scholar
  9. 9.
    Elkjær, A.S., Höhle, M., Hüttel, H., Overgård, K.: Towards automatic bisimilarity checking in the spi calculus. In: Calude, C.S., Dinneen, M.J. (eds.) Combinatorics, Computation & Logic. Australian Computer Science Communications, vol. 21(3), pp. 175–189. Springer, Heidelberg (1999)Google Scholar
  10. 10.
    Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. SIAM Journal on Computing 31(3), 947–986 (2002)zbMATHCrossRefGoogle Scholar
  11. 11.
    Durante, L., Sisto, R., Valenzano, A.: Automatic testing equivalence verification of spi calculus specifications. ACM Trans. Softw. Eng. Methodol. 12(2), 222–284 (2003)CrossRefGoogle Scholar
  12. 12.
    Borgström, J.: Equivalences and Calculi for Formal Verifiation of Cryptographic Protocols. PhD thesis, EPFL, Lausanne (to appear, 2008)Google Scholar
  13. 13.
    Fournet, C., Abadi, M.: Hiding names: Private authentication in the applied pi calculus. In: Okada, M., Pierce, B.C., Scedrov, A., Tokuda, H., Yonezawa, A. (eds.) ISSS 2002. LNCS, vol. 2609, pp. 317–338. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  14. 14.
    Abadi, M., Blanchet, B., Fournet, C.: Just fast keying in the pi calculus. ACM Trans. Inf. Syst. Secur. 10(3) (2007)Google Scholar
  15. 15.
    Bhargavan, K., Fournet, C., Gordon, A.D.: A semantics for web services authentication. Theor. Comput. Sci. 340(1), 102–153 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Chaudhuri, A., Abadi, M.: Formal security analysis of basic network-attached storage. In: FMSE 2005: Proceedings of the 2005 ACM workshop on Formal methods in security engineering, pp. 43–52. ACM, New York (2005)CrossRefGoogle Scholar
  17. 17.
    Haack, C., Jeffrey, A.: Pattern-matching spi-calculus. Information and Computation 204(8), 1195–1263 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and Computation 186, 165–193 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Bengtson, J., Parrow, J.: Formalising the pi-calculus using nominal logic. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 63–77. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  20. 20.
    Carbone, M., Coccia, M., Ferrari, G., Maffeis, S.: Process algebra-guided design of java mobile network applications. In: Informal Proceedings of the FMTJP 2001 Workshop, Budapest (2001)Google Scholar
  21. 21.
    Urban, C.: Nominal techniques in Isabelle/HOL. Journal of Automatic Reasoning (to appear, 2007)Google Scholar
  22. 22.
    Fournet, C., Gordon, A.D., Maffeis, S.: A type discipline for authorization in distributed systems. In: Proc. of CSF 2007 (to appear, 2007)Google Scholar
  23. 23.
    Gordon, A.D., Jeffrey, A.: Secrecy despite compromise: Types, cryptography, and the pi-calculus. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 186–201. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  24. 24.
    Fournet, C., Gordon, A.D., Maffeis, S.: A type discipline for authorization policies. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 141–156. Springer, Heidelberg (2005)Google Scholar
  25. 25.
    Victor, B., Moller, F.: The Mobility Workbench — a tool for the π-calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 428–440. Springer, Heidelberg (1994)Google Scholar
  26. 26.
    Cleaveland, R., Parrow, J., Steffen, B.: The Concurrency Workbench: a semantics-based tool for the verification of concurrent systems. ACM Trans. Program. Lang. Syst. 15(1), 36–72 (1993)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Magnus Johansson
    • 1
  • Joachim Parrow
    • 1
  • Björn Victor
    • 1
  • Jesper Bengtson
    • 1
  1. 1.Department of Information TechnologyUppsala University 

Personalised recommendations