Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

European Symposium on Programming

ESOP 2012: Programming Languages and Systems pp 336–356Cite as

  1. Home
  2. Programming Languages and Systems
  3. Conference paper
Reasoning about Lock Placements

Reasoning about Lock Placements

  • Peter Hawkins17,
  • Alex Aiken17,
  • Kathleen Fisher18,
  • Martin Rinard19 &
  • …
  • Mooly Sagiv20 
  • Conference paper
  • 1417 Accesses

  • 6 Citations

Part of the Lecture Notes in Computer Science book series (LNPSE,volume 7211)

Abstract

A lock placement describes, for each heap location, which lock guards the location, and under what circumstances. We formalize methods for reasoning about lock placements, making precise the interactions between the program, the heap structure, and the lock placement.

Keywords

  • Memory Location
  • Incoming Edge
  • Access Path
  • Separation Logic
  • Placement Function

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. Attiya, H., Ramalingam, G., Rinetzky, N.: Sequential verification of serializability. In: POPL, pp. 31–42. ACM, New York (2010)

    Google Scholar 

  2. Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: Transactional predication: high-performance concurrent sets and maps for STM. In: PODC, pp. 6–15. ACM, New York (2010)

    Google Scholar 

  3. Cherem, S., Chilimbi, T., Gulwani, S.: Inferring locks for atomic sections. In: PLDI, pp. 304–315. ACM, New York (2008)

    CrossRef  Google Scholar 

  4. Cunningham, D., Gudka, K., Eisenbach, S.: Keep Off the Grass: Locking the Right Path for Atomicity. In: Hendren, L. (ed.) CC 2008. LNCS, vol. 4959, pp. 276–290. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  5. Deshmukh, J., Ramalingam, G., Ranganath, V.-P., Vaswani, K.: Logical Concurrency Control from Sequential Proofs. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 226–245. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  6. Diniz, P.C., Rinard, M.C.: Lock coarsening: Eliminating lock overhead in automatically parallelized object-based programs. JPDC 49(2), 218–244 (1998)

    MATH  Google Scholar 

  7. Emmi, M., Fischer, J.S., Jhala, R., Majumdar, R.: Lock allocation. In: POPL, pp. 291–296. ACM, New York (2007)

    Google Scholar 

  8. Eswaran, K.P., Gray, J.N., Lorie, R.A., Traiger, I.L.: The notions of consistency and predicate locks in a database system. Commun. ACM 19, 624–633 (1976)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Golan-Gueta, G., Bronson, N., Aiken, A., Ramalingam, G., Sagiv, M., Yahav, E.: Automatic fine-grained locking using shape properties. In: OOPSLA (2011)

    Google Scholar 

  10. Gotsman, A., Berdine, J., Cook, B., Rinetzky, N., Sagiv, M.: Local Reasoning for Storable Locks and Threads. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 19–37. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  11. Halpert, R.L., Pickett, C.J.F., Verbrugge, C.: Component-based lock allocation. In: PACT, pp. 353–364. IEEE Computer Society, Washington, DC (2007)

    Google Scholar 

  12. Hawkins, P., Aiken, A., Fisher, K., Rinard, M., Sagiv, M.: Reasoning about lock placements (extended version). Tech. rep., Stanford University (2011), http://theory.stanford.edu/~hawkinsp/papers/tr/lockplacements.pdf

  13. Hawkins, P., Aiken, A., Fisher, K., Rinard, M., Sagiv, M.: Data representation synthesis. In: PLDI, pp. 38–49. ACM, New York (2011)

    Google Scholar 

  14. Hicks, M., Foster, J.S., Pratikakis, P.: Lock inference for atomic sections. In: TRANSACT (2006)

    Google Scholar 

  15. Jones, C.: Development methods for computer programs including a notion of interference. Ph.D. thesis, Oxford University (1981)

    Google Scholar 

  16. McCloskey, B., Zhou, F., Gay, D., Brewer, E.: Autolocker: Synchronization inference for atomic sections. In: POPL, pp. 346–358. ACM, New York (2006)

    Google Scholar 

  17. O’Hearn, P.W.: Resources, concurrency, and local reasoning. Theoretical Computer Science 375(1-3), 271–307 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. Vafeiadis, V., Parkinson, M.: A Marriage of Rely/Guarantee and Separation Logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 256–271. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  19. Wickerson, J., Dodds, M., Parkinson, M.: Explicit Stabilisation for Modular Rely-Guarantee Reasoning. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 610–629. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  20. Zhang, Y., Sreedhar, V., Zhu, W., Sarkar, V., Gao, G.: Minimum Lock Assignment: A Method for Exploiting Concurrency among Critical Sections. In: Amaral, J.N. (ed.) LCPC 2008. LNCS, vol. 5335, pp. 141–155. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, US

    Peter Hawkins & Alex Aiken

  2. Tufts University, US

    Kathleen Fisher

  3. MIT, US

    Martin Rinard

  4. Tel Aviv University, Israel

    Mooly Sagiv

Authors
  1. Peter Hawkins
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alex Aiken
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kathleen Fisher
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Martin Rinard
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Mooly Sagiv
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität München, Boltzmannstrasse 3, 85748, Garching, Germany

    Helmut Seidl

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hawkins, P., Aiken, A., Fisher, K., Rinard, M., Sagiv, M. (2012). Reasoning about Lock Placements. In: Seidl, H. (eds) Programming Languages and Systems. ESOP 2012. Lecture Notes in Computer Science, vol 7211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28869-2_17

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-28869-2_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28868-5

  • Online ISBN: 978-3-642-28869-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature