From Explicit to Symbolic Types for Communication Protocols in CCS

  • Hanne Riis Nielson
  • Flemming Nielson
  • Jörg Kreiker
  • Henrik Pilegaard
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7000)


We study communication protocols having several rounds and expressed in value passing CCS. We develop a type-based analysis for providing an explicit record of all communications and show the usual subject reduction result. Since the explicit records can be infinitely large, we also develop a type-based analysis for providing a finite, symbolic record of all communications. We show that it correctly approximates the explicit record and prove an adequacy result for it.


Communication Protocol Replay Attack Proof Obligation Axiom Scheme Replication Operator 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agha, G., Mason, I.A., Smith, S.F., Talcott, C.L.: A foundation for Actor computation. J. Funct. Program. 7(1), 1–72 (1997)Google Scholar
  2. 2.
    Bauer, J., Nielson, F., Riis Nielson, H., Pilegaard, H.: Relational analysis of correlation. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 32–46. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Berry, G., Boudol, G.: The chemical abstract machine. Theor. Comput. Sci. 96(1), 217–248 (1992)Google Scholar
  4. 4.
    Bodei, C., Buchholtz, M., Degano, P., Nielson, F., Riis Nielson, H.: Static validation of security protocols. J. Comput. Secur. 13(3), 347–390 (2005)Google Scholar
  5. 5.
    Bodei, C., Degano, P., Nielson, F., Riis Nielson, H.: Static analysis for the π-calculus with applications to security. Information and Computation 168, 68–92 (2001)Google Scholar
  6. 6.
    Cardelli, L.: A language with distributed scope. In: POPL, pp. 286–297 (1995)Google Scholar
  7. 7.
    Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory IT-22(6), 644–654 (1976)Google Scholar
  8. 8.
    Feret, J.: Dependency analysis of mobile systems. In: Le Métayer, D. (ed.) ESOP 2002. LNCS, vol. 2305, pp. 314–329. Springer, Heidelberg (2002)Google Scholar
  9. 9.
    Karr, M.: Affine relationships among variables of a program. Acta Inf. 6, 133–151 (1976)Google Scholar
  10. 10.
    Lapadula, A., Pugliese, R., Tiezzi, F.: A calculus for orchestration of web services. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 33–47. Springer, Heidelberg (2007)Google Scholar
  11. 11.
    Milner, R.: Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press (1999)Google Scholar
  12. 12.
    Nicola, R.D., Gorla, D., Hansen, R.R., Nielson, F., Riis Nielson, H., Probst, C.W., Pugliese, R.: From flow logic to static type systems for coordination languages. Sci. Comput. Program. 75(6), 376–397 (2010)Google Scholar
  13. 13.
    Nielson, F., Riis Nielson, H.: Type and Effect Systems. In: Olderog, E.-R., Steffen, B. (eds.) Correct System Design. LNCS, vol. 1710, pp. 114–136. Springer, Heidelberg (1999)Google Scholar
  14. 14.
    Nielson, F., Riis Nielson, H., Bauer, J., Rosenkilde Nielsen, C., Pilegaard, H.: Relational analysis for delivery of services. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol. 4912, pp. 73–89. Springer, Heidelberg (2008)Google Scholar
  15. 15.
    Nielson, F., Riis Nielson, H., Sun, H., Buchholtz, M., Hansen, R.R., Pilegaard, H., Seidl, H.: The Succinct Solver Suite. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 251–265. Springer, Heidelberg (2004)Google Scholar
  16. 16.
    Riis Nielson, H., Nielson, F.: Flow Logic: a multi-paradigmatic approach to static analysis. In: Mogensen, T.Æ., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol. 2566, pp. 223–244. Springer, Heidelberg (2002)Google Scholar
  17. 17.
    Riis Nielson, H., Nielson, F., Pilegaard, H.: Flow logic for process calculi. ACM Computing Surveys (to appear 2010)Google Scholar
  18. 18.
    Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: LICS, pp. 176–185 (1998)Google Scholar
  19. 19.
    Smith, G.: Polymorphic type inference with overloading and subtyping. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) TAPSOFT 1993. LNCS, vol. 668, pp. 671–685. Springer, Heidelberg (1993)Google Scholar
  20. 20.
    Venet, A.: Automatic determination of communication topologies in mobile systems. In: Levi, G. (ed.) SAS 1998. LNCS, vol. 1503, pp. 152–167. Springer, Heidelberg (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Hanne Riis Nielson
    • 1
  • Flemming Nielson
    • 1
  • Jörg Kreiker
    • 2
  • Henrik Pilegaard
    • 2
  1. 1.DTU InformaticsTechnical University of DenmarkDenmark
  2. 2.Institut für InformatikTechnische Universität MünchenGermany

Personalised recommendations