Skip to main content

Ownership Types for the Join Calculus

  • Conference paper
Formal Techniques for Distributed Systems (FMOODS 2011, FORTE 2011)

Abstract

This paper investigates ownership types in a concurrent setting using the Join calculus as the model of processes. Ownership types have the effect of statically preventing certain communication, and can block the accidental or malicious leakage of secrets. Intuitively, a channel defines a boundary and forbids access to its inside from outer channels, thus preserving the secrecy of the inner names from malicious outsiders. Secrecy is also preserved in the context of an untyped opponent.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, M.: Security protocols and specifications. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 1–13. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Abadi, M., Fournet, C., Gonthier, G.: Secure implementation of channel abstractions. Inf. Comput. 174, 37–83 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Inf. Comput. 148(1), 1–70 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bodei, C., Degano, P., Nielson, F., Riis Nielson, H.: Control flow analysis for the π-calculus. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 84–98. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Boyapati, C., Lee, R., Rinard, M.C.: Ownership types for safe programming: preventing data races and deadlocks. In: OOPSLA 2002, pp. 211–230 (2002)

    Google Scholar 

  6. Boyapati, C., Liskov, B., Shrira, L.: Ownership types for object encapsulation. In: POPL 2003, pp. 213–223 (2003)

    Google Scholar 

  7. Boyapati, C., Salcianu, A., Beebee, W.S., Rinard, M.C.: Ownership types for safe region-based memory management in real-time java. In: PLDI 2003, pp. 324–337 (2003)

    Google Scholar 

  8. Cardelli, L., Ghelli, G., Gordon, A.D.: Secrecy and group creation. Inf. Comput. 196(2), 127–155 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Clarke, D.: Object Ownership and Containment. PhD thesis, University of New South Wales (July 2001)

    Google Scholar 

  10. Clarke, D., Drossopoulou, S.: Ownership, encapsulation and the disjointness of type and effect. In: OOPSLA 2002, pp. 292–310 (2002)

    Google Scholar 

  11. Clarke, D., Potter, J., Noble, J.: Ownership types for flexible alias protection. In: OOPSLA 1998, pp. 48–64 (1998)

    Google Scholar 

  12. Clarke, D., Richmond, M., Noble, J.: Saving the world from bad beans: deployment-time confinement checking. In: OOPSLA 2003, pp. 374–387. ACM, New York (2003)

    Google Scholar 

  13. Dolev, D., Yao, A.C.: On the security of public key protocols. In: SFCS 1981, pp. 350–357. IEEE Computer Society Press, Washington, DC, USA (1981)

    Google Scholar 

  14. Fournet, C., Fessant, F.L., Maranget, L., Schmitt, A.: JoCaml: a Language for Concurrent Distributed and Mobile Programming. In: Proceedings of the 4th Summer School on Advanced Functional Programming. LNCS, pp. 129–158. Springer, Heidelberg (2002)

    Google Scholar 

  15. Fournet, C., Gonthier, G.: The reflexive CHAM and the Join-calculus. In: POPL 1996, pp. 372–385 (1996)

    Google Scholar 

  16. Fournet, C., Gonthier, G.: The join calculus: A language for distributed mobile programming. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 268–332. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Fournet, C., Laneve, C., Maranget, L., Rémy, D.: Implicit typing à la ML for the Join-calculus. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 196–212. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  18. Haller, P., Van Cutsem, T.: Implementing joins using extensible pattern matching. In: Wang, A.H., Tennenholtz, M. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 135–152. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Krishnaswami, N.R., Aldrich, J.: Permission-based ownership: encapsulating state in higher-order typed languages. In: PLDI 2005, pp. 96–106 (2005)

    Google Scholar 

  20. Patrignani, M., Clarke, D., Sangiorgi, D.: Ownership types for the Join calculus. CW Reports CW603, Dept. of Computer Science, , K.U.Leuven (March 2011)

    Google Scholar 

  21. Pierce, B.: Types and Programming Languages. MIT Press, Cambridge (2002)

    MATH  Google Scholar 

  22. Plociniczak, H., Eisenbach, S.: JErlang: Erlang with joins. In: Clarke, D., Agha, G. (eds.) COORDINATION 2010. LNCS, vol. 6116, pp. 61–75. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  23. Vitek, J., Bokowski, B.: Confined types. In: OOPSLA 1999, Denver, Colorado, United States, pp. 82–96. ACM Press, New York (1999)

    Google Scholar 

  24. Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Inf. Comput. 115, 38–94 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Patrignani, M., Clarke, D., Sangiorgi, D. (2011). Ownership Types for the Join Calculus. In: Bruni, R., Dingel, J. (eds) Formal Techniques for Distributed Systems. FMOODS FORTE 2011 2011. Lecture Notes in Computer Science, vol 6722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21461-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21461-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21460-8

  • Online ISBN: 978-3-642-21461-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics