Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2004: CONCUR 2004 - Concurrency Theory pp 49–67Cite as

Resources, Concurrency and Local Reasoning

  • Conference paper

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

Abstract

In this paper we show how a resource-oriented logic, separation logic, can be used to reason about the usage of resources in concurrent programs.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brinch Hansen, P.: The nucleus of a multiprogramming system. Comm. ACM 13(4), 238–250 (1970)

    Article  MATH  Google Scholar 

  2. Brinch Hansen, P.: Structured multiprogramming. Comm. ACM 15(7), 574–578 (1972); Reprinted in [3]

    Article  MATH  Google Scholar 

  3. Brinch Hansen, P. (ed.): The Origin of Concurrent Programming. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  4. Brookes, S.D.: A Semantics for Concurrent Separation Logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 16–34. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Cardelli, L., Caires, L.: A spatial logic for concurrency. In: Dean, J., Gravel, A. (eds.) ICCBSS 2002. LNCS, vol. 2255, pp. 1–37. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Cardelli, L., Gordon, A.D.: Anytime, anywhere. modal logics for mobile ambients. In: 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 365–377 (2000)

    Google Scholar 

  7. Clarke, D., Noble, J., Potter, J.: Simple ownership types for object containment. In: Knudsen, J.L. (ed.) ECOOP 2001. LNCS, vol. 2072, pp. 53–76. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Dijkstra, E.W.: Cooperating sequential processes. In: Genuys, F. (ed.) Programming Languages, pp. 43–112. Academic Press, London (1968); Reprinted in [3]

    Google Scholar 

  9. Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1(2), 115–138 (1971); Reprinted in [3]

    Article  MathSciNet  Google Scholar 

  10. Girard, J.-Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hoare, C.A.R.: Towards a theory of parallel programming. In: Hoare, Perrot (eds.) Operating Systems Techniques. Academic Press, London (1972) (Reprinted in [3])

    Google Scholar 

  12. Hoare, C.A.R.: Monitors: An operating system structuring concept. Comm. ACM 17(10), 549–557 (1974); Reprinted in [3]

    Article  MATH  Google Scholar 

  13. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  14. Jones, C.B.: Specification and design of (parallel) programs. In: IFIP Conference (1983)

    Google Scholar 

  15. Milner, R.: The polyadic pi-calculus: a tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification, pp. 203–246. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  16. O’Hearn, P., Reynolds, J., Yang, H.: Local reasoning about programs that alter data structures. In: Proceedings of 15th Annual Conference of the European Association for Computer Science Logic. LNCS, pp. 1–19. Springer, Heidelberg (2001)

    Google Scholar 

  17. O’Hearn, P.W., Pym, D.J.: The logic of bunched implications. Bulletin of Symbolic Logic 5(2), 215–244 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  18. O’Hearn, P.W., Yang, H., Reynolds, J.C.: Separation and information hiding. In: 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Venice, pp. 268–280 (January 2004)

    Google Scholar 

  19. Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs. Acta Informatica 19, 319–340 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  20. Owicki, S., Gries, D.: Verifying properties of parallel programs: An axiomatic approach. Comm. ACM 19(5), 279–285 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  21. Pnueli, A.: The temporal semantics of concurrent programs. Theoretical Computer Science 13(1), 45–60 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  22. Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings of the 17th IEEE Symposium on Logic in Computer Science, pp. 55–74 (2002) (invited paper)

    Google Scholar 

  23. Stirling, C.: A generalization of the Owicki-Gries Hoare logic for a concurrent while language. Theoretical Computer Science 58, 347–359 (1988)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Queen Mary, University of London, UK

    Peter W. O’Hearn

Authors
  1. Peter W. O’Hearn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Imperial College London, 180 Queen’s Gate, SW7 2AZ, London, UK

    Philippa Gardner

  2. Department of Computing, Imperial College, London, UK

    Nobuko Yoshida

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

O’Hearn, P.W. (2004). Resources, Concurrency and Local Reasoning. In: Gardner, P., Yoshida, N. (eds) CONCUR 2004 - Concurrency Theory. CONCUR 2004. Lecture Notes in Computer Science, vol 3170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28644-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28644-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22940-7

  • Online ISBN: 978-3-540-28644-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation