Invariants, Modularity, and Rights

  • Ernie Cohen
  • Eyad Alkassar
  • Vladimir Boyarinov
  • Markus Dahlweid
  • Ulan Degenbaev
  • Mark Hillebrand
  • Bruno Langenstein
  • Dirk Leinenbach
  • Michał Moskal
  • Steven Obua
  • Wolfgang Paul
  • Hristo Pentchev
  • Elena Petrova
  • Thomas Santen
  • Norbert Schirmer
  • Sabine Schmaltz
  • Wolfram Schulte
  • Andrey Shadrin
  • Stephan Tobies
  • Alexandra Tsyban
  • Sergey Tverdyshev
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5947)

Abstract

The quest for modular concurrency reasoning has led to recent proposals that extend program assertions to include not just knowledge about the state, but rights to access the state. We argue that these rights are really just sugar for knowledge that certain updates preserve certain invariants.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brochenin, R., Demri, S., Lozes, E.: On the almighty wand. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 323–338. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Calcagno, C., Yang, H., O’Hearn, P.W.: Computability and complexity results for a spatial assertion language for data structures. In: APLAS, pp. 289–300 (2001)Google Scholar
  3. 3.
    Cohen, E., Dahlweid, M., Hillebrand, M., Leinenbach, D., Moskal, M., Santen, T., Schulte, W., Tobies, S.: VCC: A practical system for verifying concurrent C. In: Urban, C. (ed.) TPHOLs 2009. LNCS, vol. 5674, pp. 1–22. Springer, Heidelberg (2009) (invited paper)Google Scholar
  4. 4.
    Dodds, M., Feng, X., Parkinson, M., Vafeiadis, V.: Deny-guarantee reasoning. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 363–377. Springer, Heidelberg (2009)Google Scholar
  5. 5.
    Jones, C.B.: Specification and design of (parallel) programs. In: IFIP Congress, pp. 321–332 (1983)Google Scholar
  6. 6.
    Rustan, K., Leino, M.: A basis for verifying multi-threaded programs. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 378–393. Springer, Heidelberg (2009)Google Scholar
  7. 7.
    O’Hearn, P.W.: Resources, concurrency, and local reasoning. Theor. Comput. Sci. 375(1-3), 271–307 (2007)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Ernie Cohen
    • 1
  • Eyad Alkassar
    • 2
  • Vladimir Boyarinov
    • 3
  • Markus Dahlweid
    • 4
  • Ulan Degenbaev
    • 2
  • Mark Hillebrand
    • 3
  • Bruno Langenstein
    • 3
  • Dirk Leinenbach
    • 3
  • Michał Moskal
    • 4
  • Steven Obua
    • 2
  • Wolfgang Paul
    • 2
  • Hristo Pentchev
    • 2
  • Elena Petrova
    • 2
  • Thomas Santen
    • 4
  • Norbert Schirmer
    • 3
  • Sabine Schmaltz
    • 2
  • Wolfram Schulte
    • 5
  • Andrey Shadrin
    • 2
  • Stephan Tobies
    • 4
  • Alexandra Tsyban
    • 2
  • Sergey Tverdyshev
    • 2
  1. 1.Microsoft CorporationRedmondUSA
  2. 2.Computer Science Dept.Saarland UniversitySaarbrückenGermany
  3. 3.German Research Center for Artificial Intelligence (DFKI)SaarbrückenGermany
  4. 4.European Microsoft Innovation CenterAachenGermany
  5. 5.Microsoft ResearchRedmondUSA

Personalised recommendations