Skip to main content
SpringerLink
Log in

Proof-Carrying Code in a Session-Typed Process Calculus

  • Conference paper
Certified Programs and Proofs (CPP 2011)

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

Included in the following conference series:

Abstract

Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dependent session types to express proof-carrying communication. We further introduce two modal operators into the type theory to provide detailed control about how much information is communicated: one based on traditional proof irrelevance and one integrating digital signatures.

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

Access this chapter

Log in via an institution
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. Avijit, K., Datta, A., Harper, R.: Distributed programming with distributed authorization. In: Proceedings of the 5th Workshop on Types in Language Design and Implementation, TLDI 2010, pp. 27–38. ACM, New York (2010)

    Google Scholar 

  2. Awodey, S., Bauer, A.: Propositions as [types]. Journal of Logic and Computation 14(4), 447–471 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bengtson, J., Bhargavan, K., Fournet, C., Gordon, A.D., Maffeis, S.: Refinement types for secure implementations. In: 21st Computer Security Foundations Symposium, CSF 2008, Pittsburgh, Pennsylvania, pp. 17–32. IEEE Computer Society (June 2008)

    Google Scholar 

  4. Bonelli, E., Compagnoni, A., Gunter, E.L.: Correspondence Assertions for Process Synchronization in Concurrent Communications. J. of Func. Prog. 15(2), 219–247 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Caires, L., Pfenning, F.: Session Types as Intuitionistic Linear Propositions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 222–236. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Dezani-Ciancaglini, M., de’Liguoro, U.: Sessions and Session Types: An Overview. In: Laneve, C., Su, J. (eds.) WS-FM 2009. LNCS, vol. 6194, pp. 1–28. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Garg, D., Bauer, L., Bowers, K.D., Pfenning, F., Reiter, M.K.: A Linear Logic of Authorization and Knowledge. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol. 4189, pp. 297–312. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Garg, D., Pfenning, F.: A proof-carrying file system. In: Evans, D., Vigna, G. (eds.) Proceedings of the 31st Symposium on Security and Privacy (Oakland 2010), Berkeley, California. IEEE (May 2010); Extended version available as Technical Report CMU-CS-09-123 (June 2009)

    Google Scholar 

  9. Honda, K.: Types for Dyadic Interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509–523. Springer, Heidelberg (1993)

    Google Scholar 

  10. Honda, K., Vasconcelos, V.T., Kubo, M.: Language Primitives and Type Discipline for Structured Communication-Based Programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122–138. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Mazurak, K., Zdancewic, S.: Lolliproc: To concurrency from classical linear logic via Curry-Howard and control. In: Hudak, P., Weirich, S. (eds.) Proceedings of the 15th International Conference on Functional Programming (ICFP 2010), Baltimore, Maryland, pp. 39–50. ACM (September 2010)

    Google Scholar 

  12. Necula, G.C.: Proof-carrying code. In: Jones, N.D. (ed.) Conference Record of the 24th Symposium on Principles of Programming Languages (POPL 1997), Paris, France, pp. 106–119. ACM Press (January 1997)

    Google Scholar 

  13. Necula, G.C., Lee, P.: Safe kernel extensions without run-time checking. In: Proceedings of the Second Symposium on Operating System Design and Implementation (OSDI 1996), Seattle, Washington, pp. 229–243 (October 1996)

    Google Scholar 

  14. Pfenning, F.: Intensionality, extensionality, and proof irrelevance in modal type theory. In: Halpern, J. (ed.) Proceedings of the 16th Annual Symposium on Logic in Computer Science (LICS 2001), Boston, Massachusetts, pp. 221–230. IEEE (June 2001)

    Google Scholar 

  15. Salvesen, A., Smith, J.M.: The strength of the subset type in Martin-Löf’s type theory. In: 3rd Annual Symposium on Logic in Computer Science (LICS 1988), Edinburgh, Scotland, pp. 384–391. IEEE (July 1988)

    Google Scholar 

  16. Swamy, N., Checn, J., Fournet, C., Strub, P.-Y., Bhargavan, K., Yang, J.: Secure distributed programming with value-dependent types. In: Danvy, O. (ed.) International Conference on Functional Programming (ICFP 2011), Tokyo, Japan. ACM (September 2011) (to appear)

    Google Scholar 

  17. Swamy, N., Chen, J., Chugh, R.: Enforcing Stateful Authorization and Information Flow Policies in Fine. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 529–549. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  18. Toninho, B., Caires, L., Pfenning, F.: Dependent session types via intuitionistic linear type theory. In: Proceedings of the 13th International Symposium on Principles and Practice of Declarative Programming (PPDP 2011), pp. 161–172. ACM ( July 2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA

    Frank Pfenning & Bernardo Toninho

  2. Faculdade de Ciencias e Tecnologia, Universidade Nova de Lisboa, Lisboa, Portugal

    Luis Caires & Bernardo Toninho

Authors
  1. Frank Pfenning
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luis Caires
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bernardo Toninho
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tsinghua University, FIT 3-603, 100084, Beijing, China

    Jean-Pierre Jouannaud

  2. Department of Computer Science, Yale University, 51 Prospect Street, 06520-8285, New Haven, CT, USA

    Zhong Shao

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pfenning, F., Caires, L., Toninho, B. (2011). Proof-Carrying Code in a Session-Typed Process Calculus. In: Jouannaud, JP., Shao, Z. (eds) Certified Programs and Proofs. CPP 2011. Lecture Notes in Computer Science, vol 7086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25379-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25379-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation