Skip to main content
Springer Nature Link
Log in

Excommunication: Transforming \(\pi \)-Calculus Specifications to Remove Internal Communication

  • Conference paper
  • First Online:
Formal Methods: Foundations and Applications (SBMF 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13768))

Included in the following conference series:

  • 204 Accesses

Abstract

In this paper, we present a new automatic transformation algorithm called excommunication that transforms \(\pi \)-calculus processes to remove parallelism, and hence internal communication. We prove that the transformation is correct and that it always terminates for any specification in which the named processes are in a particular syntactic form we call serial form. We argue that this transformation facilitates the proving of properties of mobile processes, and demonstrate this by showing how it can be used to simplify a leakage analysis.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aziz, B., Hamilton, G.: A denotational semantics for the \(\pi \)-calculus. In: Proceedings of the 5th Irish Conference on Formal Methods, pp. 37–47 (2001)

    Google Scholar 

  2. Banks, A., Gupta, R.: MQTT Version 3.1.1 Plus Errata 01. Technical report, OASIS (2015)

    Google Scholar 

  3. Bensaou, N., Guessarian, I.: Transforming constraint logic programs. Theoret. Comput. Sci. 206(1–2), 81–125 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Burstall, R., Darlington, J.: A transformation system for developing recursive programs. J. ACM 24(1), 44–67 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  5. Etalle, S., Gabbrielli, M., Meo, M.C.: Transformations of CCP programs. ACM Trans. Program. Lang. Syst. (TOPLAS) 23(3), 304–395 (2001)

    Article  MATH  Google Scholar 

  6. De Francesco, N., Santone, A.: Unfold/fold transformations of concurrent processes. In: Kuchen, H., Doaitse Swierstra, S. (eds.) PLILP 1996. LNCS, vol. 1140, pp. 167–181. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61756-6_84

    Chapter  Google Scholar 

  7. Gengler, M., Martel, M.: Self-applicable partial evaluation for the \(\pi \)-calculus. In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 36–46 (1997)

    Google Scholar 

  8. Hamilton, G.W.: Higher order deforestation. In: Proceedings of the Eighth International Symposium on Programming, Logics, Implementation and Programs, pp. 213–227 (1996)

    Google Scholar 

  9. Hamilton, G.W.: Extending higher order deforestation: transforming programs to eliminate even more trees. In: Trends in Functional Programming (Volume 3), pp. 25–36. Intellect Books (2002)

    Google Scholar 

  10. Hamilton, G.: Distillation: extracting the essence of programs. In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 61–70 (2007)

    Google Scholar 

  11. Hosoya, H., Kobayashi, N., Yonezawa, A.: Partial evaluation scheme for concurrent languages and its correctness. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds.) Euro-Par 1996. LNCS, vol. 1123, pp. 625–632. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61626-8_83

    Chapter  Google Scholar 

  12. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. I. Inf. Comput. 100(1), 1–40 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. II. Inf. Comput. 100(2), 41–77 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pettorossi, A., Proietti, M.: Rules and strategies for transforming functional and logic programs. ACM Comput. Surv. 28(2), 360–414 (1996)

    Article  Google Scholar 

  15. Sahlin, D.: Partial evaluation of AKL. In: Proceedings of the First International Conference on Concurrent Constraint Programming (1995)

    Google Scholar 

  16. Sørensen, M.H., Glück, R., Jones, N.D.: A positive supercompiler. J. Funct. Program. 6(6), 811–838 (1996)

    Article  MATH  Google Scholar 

  17. Tamaki, H., Sato, T.: Unfold/fold transformations of logic programs. In: Second International Conference on Logic Programming, pp. 127–138 (1984)

    Google Scholar 

  18. Turchin, V.: The concept of a supercompiler. ACM Trans. Program. Lang. Syst. 8(3), 90–121 (1986)

    Article  MATH  Google Scholar 

  19. Ueda, K., Furukawa, K.: Transformation rules for GHC Programs. Institute for New Generation Computer Technology Tokyo (1988)

    Google Scholar 

  20. Wadler, P.: Deforestation: transforming programs to eliminate trees. Theoret. Comput. Sci. 73, 231–248 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Dublin City University, Dublin, Ireland

    Geoff W. Hamilton

  2. School of Computing, University of Portsmouth, Portsmouth, England

    Benjamin Aziz

Authors
  1. Geoff W. Hamilton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benjamin Aziz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Geoff W. Hamilton .

Editor information

Editors and Affiliations

  1. Federal Rural University of Pernambuco, Recife, Brazil

    Lucas Lima

  2. Budapest University of Technology and Economics, Budapest, Hungary

    Vince Molnár

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hamilton, G.W., Aziz, B. (2022). Excommunication: Transforming \(\pi \)-Calculus Specifications to Remove Internal Communication. In: Lima, L., Molnár, V. (eds) Formal Methods: Foundations and Applications. SBMF 2022. Lecture Notes in Computer Science, vol 13768. Springer, Cham. https://doi.org/10.1007/978-3-031-22476-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-22476-8_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-22475-1

  • Online ISBN: 978-3-031-22476-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics