Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A Complete Symbolic Bisimulation for Full Applied Pi Calculus

  • Conference paper
SOFSEM 2010: Theory and Practice of Computer Science (SOFSEM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5901))

  • 924 Accesses

Abstract

Symbolic characterizations of bisimilarities for the applied pi-calculus proposed so far are sound but incomplete, even restricted to the finite fragment of the calculus. In this paper we present a novel approach to symbolic semantics for the applied pi-calculus, leading to a notion of symbolic bisimulation which is both sound and complete with respect to the standard concrete bisimulation. Moreover, our approach accommodates recursions hence works for the full calculus.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abadi, M., Cortier, V.: Deciding Knowledge in Security Protocols under Equational Theories. Theor. Comput. Sci. 367(1-2), 2–32 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Abadi, M., Fournet, C.: Mobile Values, New Names, and Secure Communication. In: POPL, pp. 104–115 (2001)

    Google Scholar 

  3. Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: the spi Calculus. In: CCS 1997: Proceedings of the 4th ACM Conference on Computer and Communications Security, pp. 36–47. ACM, New York (1997)

    Chapter  Google Scholar 

  4. Baudet, M.: Deciding Security of Protocols against Off-Line Quessing Attacks. In: CCS 2005: Proceedings of the 12th ACM Conference on Computer and Communications Security, pp. 16–25. ACM, New York (2005)

    Chapter  Google Scholar 

  5. Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-Calculi: Mobile Processes, Nominal Data, and Logic. In: LICS 2009: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp. 39–48 (2009)

    Google Scholar 

  6. Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: CSFW 2001: Proceedings of the 14th IEEE Workshop on Computer Security Foundations, p. 82 (2001)

    Google Scholar 

  7. Blanchet, B., Abadi, M., Fournet, C.: Automated Verification of Selected Equivalences for Security Protocols. In: LICS, pp. 331–340 (2005)

    Google Scholar 

  8. Boreale, M., Buscemi, M.: A Method for Symbolic Analysis of Security Protocols. Theor. Comput. Sci. 338(1-3), 393–425 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Boreale, M., De Nicola, R.: A Symbolic Semantics for the Pi-Calculus. Inf. Comput. 126(1), 34–52 (1996)

    Article  MATH  Google Scholar 

  10. Borgström, J.: A Complete Symbolic Bisimilarity for an Extended spi Calculus. Electron. Notes Theor. Comput. Sci. 242(3) (2009)

    Google Scholar 

  11. Borgström, J., Briais, S., Nestmann, U.: Symbolic Bisimulation in the spi Calculus. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 161–176. Springer, Heidelberg (2004)

    Google Scholar 

  12. Comon-Lundh, H., Shmatikov, V.: Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. In: LICS 2003: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, p. 271 (2003)

    Google Scholar 

  13. Delaune, S., Kremer, S., Ryan, M.D.: Symbolic Bisimulation for the Applied Pi Calculus. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 133–145. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Delaune, S., Kremer, S., Ryan, M.D.: Symbolic Bisimulation for the Applied pi Calculus. Journal of Computer Security (to appear, 2009)

    Google Scholar 

  15. Hennessy, M., Lin, H.: Symbolic Bisimulations. Theor. Comput. Sci. 138(2), 353–389 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  16. Hennessy, M., Lin, H.: Proof Systems for Message-Passing Process Algebras. Formal Asp. Comput. 8(4), 379–407 (1996)

    Article  MATH  Google Scholar 

  17. Johansson, M., Parrow, J., Victor, B., Bengtson, J.: Extended Pi-Calculi. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 87–98. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Lin, H.: Complete Inference Systems for Weak Bisimulation Equivalences in the Pi-Calculus. Inf. Comput. 180(1), 1–29 (2003)

    Article  MATH  Google Scholar 

  19. Liu, J., Lin, H.: A Complete Symbolic Bisimulation for Full Applied pi Calculus (full version) (2009), http://lcs.ios.ac.cn/~jliu

  20. Millen, J., Shmatikov, V.: Constraint Solving for Bounded-Process Cryptographic Protocol Analysis. In: CCS 2001: Proceedings of the 8th ACM Conference on Computer and Communications Security, pp. 166–175. ACM, New York (2001)

    Chapter  Google Scholar 

  21. Milner, R.: Communicating and Mobile Systems: the pi Calculus. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Computer Science Institute of Software, Chinese Academy of Sciences,  

    Jia Liu & Huimin Lin

  2. Graduate University, Chinese Academy of Sciences,  

    Jia Liu

Authors
  1. Jia Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huimin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584 CH, Utrecht, The Netherlands

    Jan van Leeuwen

  2. LaBRI, Universit Bordeaux, 351 cours de la Libration, 1F-33405, Talence Cedex, France

    Anca Muscholl

  3. Department of Computer Science & Applied Mathematics, Weizmann Institute, Faculty of Mathematics and Computer Science, 76100, Rehovot, Israel

    David Peleg

  4. Department of Software Engineering Faculty of Mathematics and Physics Malostranské nám, Charles University, 25 11800, Prague 1, Czech Republic

    Jaroslav Pokorný

  5. Software Engineering, Department of Computer Science, RWTH Aachen University, 3, Ahornstrae 55, D-52074, Aachen, Germany

    Bernhard Rumpe

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, J., Lin, H. (2010). A Complete Symbolic Bisimulation for Full Applied Pi Calculus. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11266-9_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11265-2

  • Online ISBN: 978-3-642-11266-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation