Skip to main content

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

  • 616 Accesses

Abstract

Based on a former relation-algebraic approach to separation logic we present an abstraction of the theory of dynamic frames and algebraically describe concepts, properties and behaviour of that theory in a pointfree fashion. Moreover, relationships to abstract concepts of separation logic are given to pave the way for a unified treatment of both approaches. In particular, we also sketch the main ideas within the framework of local actions.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Bornat, R., Calcagno, C., O’Hearn, P.W., Parkinson, M.J.: Permission Accounting in Separation Logic. In: Palsberg, J., Abadi, M. (eds.) Proc. of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 259–270. ACM Press (2005)

    Google Scholar 

  2. Calcagno, C., O’Hearn, P.W., Yang, H.: Local Action and Abstract Separation Logic. In: Proc. of the 22nd Symposium on Logic in Computer Science, pp. 366–378. IEEE Press (2007)

    Google Scholar 

  3. Dang, H.-H., Höfner, P., Möller, B.: Algebraic Separation Logic. Journal of Logic and Algebraic Programming 80, 221–247 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dang, H.-H., Möller, B.: Reverse Exchange for Concurrency and Local Reasoning. In: Gibbons, J., Nogueira, P. (eds.) MPC 2012. LNCS, vol. 7342, pp. 177–197. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  5. Dang, H.-H., Möller, B.: Concurrency and Local Reasoning under Reverse Exchange. Science of Computer Programming (2013)

    Google Scholar 

  6. Dinsdale-Young, T., Dodds, M., Gardner, P., Parkinson, M.J., Vafeiadis, V.: Concurrent Abstract Predicates. In: D’Hondt, T. (ed.) ECOOP 2010. LNCS, vol. 6183, pp. 504–528. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Dockins, R., Hobor, A., Appel, A.W.: A Fresh Look at Separation Algebras and Share Accounting. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol. 5904, pp. 161–177. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Frias, M.F., Baum, G., Haeberer, A.M.: Fork Algebras in Algebra, Logic and Computer Science. Fundam. Inform. 32, 1–25 (1997)

    MATH  MathSciNet  Google Scholar 

  9. Garbervetsky, D., Gorín, D., Neisen, A.: Enforcing Structural Invariants using Dynamic Frames. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 65–80. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Hoare, C.A.R., Hussain, A., Möller, B., O’Hearn, P.W., Petersen, R.L., Struth, G.: On Locality and the Exchange Law for Concurrent Processes. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 250–264. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Hobor, A., Villard, J.: The Ramifications of Sharing in Data Structures. In: Giacobazzi, R., Cousot, R. (eds.) Proc. of the 40th annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, pp. 523–536. ACM Press (2013)

    Google Scholar 

  12. Jensen, J.B., Birkedal, L.: Fictional Separation Logic. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 377–396. Springer, Heidelberg (2012)

    Google Scholar 

  13. Kassios, I.T.: The Dynamic Frames Theory. Formal Aspects of Computing 23, 267–289 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  14. Leino, K.R.M.: Dafny: An Automatic Program Verifier for Functional Correctness. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol. 6355, pp. 348–370. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. McCarthy, J., Hayes, P.J.: Some Philosophical Problems from the Standpoint of Artificial Intelligence. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence 4, pp. 463–502. Edinburgh University Press (1969)

    Google Scholar 

  16. Parkinson, M.J., Summers, A.J.: The Relationship between Separation Logic and Implicit Dynamic Frames. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 439–458. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  17. Reynolds, J.C.: Separation Logic: A Logic for Shared Mutable Data Structures. In: Proc. of the 17th Annual IEEE Symposium on Logic in Computer Science, pp. 55–74. IEEE Computer Society (2002)

    Google Scholar 

  18. Smans, J., Jacobs, B., Piessens, F.: Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logic. In: Drossopoulou, S. (ed.) ECOOP 2009. LNCS, vol. 5653, pp. 148–172. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Dang, HH. (2014). Abstract Dynamic Frames. In: Höfner, P., Jipsen, P., Kahl, W., Müller, M.E. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2014. Lecture Notes in Computer Science, vol 8428. Springer, Cham. https://doi.org/10.1007/978-3-319-06251-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06251-8_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06250-1

  • Online ISBN: 978-3-319-06251-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics