Skip to main content
SpringerLink
Log in

The Logic of Proofs as a Foundation for Certifying Mobile Computation

  • Conference paper
Book cover Logical Foundations of Computer Science (LFCS 2009)

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

Included in the following conference series:

Abstract

We explore an intuitionistic fragment of Artëmov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certificate component. Dubbed the Certifying Mobile Calculus, our language caters for both code and certificate development in a unified theory. In the same way that mobile code is constructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system additionally ensures correct certificate construction out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine.

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. Artëmov, S., Beklemishev, L.: Provability logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol. 13, pp. 189–360. Kluwer, Dordrecht (2004)

    Google Scholar 

  2. Artëmov, S.N., Bonelli, E.: The intensional lambda calculus. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 12–25. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Artemov, S.: Operational modal logic. Technical Report MSI 95-29, Cornell Univsersity (1995)

    Google Scholar 

  4. Artemov, S.: Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7(1), 1–36 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, P., Wolter, F., van Benthem, J. (eds.) Handbook of Modal Logics. Elsevier, Amsterdam (2006)

    Google Scholar 

  6. Bonelli, E., Feller, F.: The logic of proofs as a foundation for certifying mobile computation, http://www.lifia.info.unlp.edu.ar/~eduardo/lpCertFull.pdf

  7. Borghuis, T., Feijs, L.M.G.: A constructive logic for services and information flow in computer networks. Comput. J. 43(4), 274–289 (2000)

    Article  MATH  Google Scholar 

  8. Curien, P.-L., Herbelin, H.: The duality of computation. In: ICFP, pp. 233–243 (2000)

    Google Scholar 

  9. Davies, R., Pfenning, F.: A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science 11, 511–540 (2001)

    MathSciNet  MATH  Google Scholar 

  10. Davies, R., Pfenning, F.: A modal analysis of staged computation. J. ACM 48(3), 555–604 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Herbelin, H.: A lambda-calculus structure isomorphic to gentzen-style sequent calculus structure. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 61–75. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  12. Jia, L., Walker, D.: Modal proofs as distributed programs (extended abstract). In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 219–233. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Moody, J.: Logical mobility and locality types. In: Etalle, S. (ed.) LOPSTR 2004. LNCS, vol. 3573, pp. 69–84. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Murphy VII, T.: Modal Types for Mobile Code. PhD thesis, Carnegie Mellon (draft) (January 2008)

    Google Scholar 

  15. Simpson, A.: The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis, University of Edinburgh (1994)

    Google Scholar 

  16. Taha, W., Sheard, T.: Multi-stage programming. In: ICFP, p. 321 (1997)

    Google Scholar 

  17. Murphy VII, T., Crary, K., Harper, R.: Distributed control flow with classical modal logic. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 51–69. Springer, Heidelberg (2005)

    Google Scholar 

  18. Murphy VII, T., Crary, K., Harper, R.: Type-safe distributed programming with ml5. In: Barthe, G., Fournet, C. (eds.) TGC 2007 and FODO 2008. LNCS, vol. 4912, pp. 108–123. Springer, Heidelberg (2008)

    Google Scholar 

  19. Murphy VII, T., Crary, K., Harper, R., Pfenning, F.: A symmetric modal lambda calculus for distributed computing. In: LICS, pp. 286–295. IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  20. Wickline, P., Lee, P., Pfenning, F., Davies, R.: Modal types as staging specifications for run-time code generation. ACM Comput. Surv. 30(3es), 8 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depto. de Ciencia y Tecnología, Universidad Nacional de Quilmes and CONICET, Argentina

    Eduardo Bonelli

  2. LIFIA, Facultad de Informática, Universidad Nacional de La Plata, Argentina

    Eduardo Bonelli & Federico Feller

Authors
  1. Eduardo Bonelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Federico Feller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science, CUNY Graduate Center, 365 Fifth Avenue, NY 10016, New York, USA

    Sergei Artemov

  2. Department of Mathematics, Cornell University, 545 Malott Hall, NY 14853, Ithaca, USA

    Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonelli, E., Feller, F. (2008). The Logic of Proofs as a Foundation for Certifying Mobile Computation. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92687-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92686-3

  • Online ISBN: 978-3-540-92687-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation