Skip to main content

Effect Algebras, Girard Quantales and Complementation in Separation Logic

  • Conference paper
  • First Online:
Relational and Algebraic Methods in Computer Science (RAMiCS 2021)

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

  • 536 Accesses

Abstract

We study convolution and residual operations within convolution quantales of maps from partial abelian semigroups and effect algebras into value quantales, thus generalising separating conjunction and implication of separation logic to quantitative settings. We show that effect algebras lift to Girard convolution quantales, but not the standard partial abelian monoids used in separation logic. It follows that the standard assertion quantales of separation logic do not admit a linear negation relating convolution and its right adjoint. We consider alternative dualities for these operations on convolution quantales using boolean negations, some old, some new, relate them with properties of the underlying partial abelian semigroups and outline potential uses.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

Notes

  1. 1.

    Most results on partial abelian monoids, more generally relational monoids, and (convolution) quantales can be found in the Archive of Formal Proofs [11, 24]. The complete formalisation can be found online http://hoefner-online.de/ramics21.

  2. 2.

    CBI models are relational monoids, deterministic means that results of compositions are singletons, partial deterministic that they are singletons or empty.

References

  1. Appel, A.W.: Program Logics - for Certified Compilers. Cambridge University Press, Cambridge (2014)

    Book  Google Scholar 

  2. Bannister, C., Höfner, P., Klein, G.: Backwards and forwards with separation logic. In: Avigad, J., Mahboubi, A. (eds.) ITP 2018. LNCS, vol. 10895, pp. 68–87. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94821-8_5

    Chapter  Google Scholar 

  3. Brotherston, J., Calcagno, C.: Classical BI: its semantics and proof theory. Logical Methods Comput. Sci. 6(3), 1–42 (2010)

    Article  MathSciNet  Google Scholar 

  4. Brotherston, J., Villard, J.: Sub-classical boolean bunched logics and the meaning of par. In: CSL 2015, vol. 41 of LIPIcs, pp. 325–342. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)

    Google Scholar 

  5. Calcagno, C., Gardner, P., Zarfaty, U.: Context logic as modal logic: completeness and parametric inexpressivity. In: POPL 2007, pp. 123–134. ACM (2007)

    Google Scholar 

  6. Calcagno, C., O’Hearn, P.W., Yang, H.: Local action and abstract separation logic. In: LICS 2007, pp. 366–378. IEEE Computer Society (2007)

    Google Scholar 

  7. Cranch, J., Doherty, S., Struth, G.: Convolution and concurrency (2020). arXiv:2002.02321

  8. Cranch, J., Doherty, S., Struth, G.: Relational semigroups and object-free categories (2020). arXiv:2001.11895

  9. Dang, H.-H., Höfner, P., Möller, B.: Algebraic separation logic. J. Logic Algebraic Program. 80(6), 221–247 (2011)

    Article  MathSciNet  Google Scholar 

  10. Day, B., Street, R.: Quantum categories, star autonomy, and quantum groupoids. In: Galois Theory, Hopf Algebras, and Semiabelian Categories, vol. 43 of Fields Institute Communications, pp. 193–231. American Mathematical Society (2004)

    Google Scholar 

  11. Dongol, B., Gomes, V.B.F., Hayes, I.J., Struth, G.: Partial semigroups and convolution algebras. Arch. Formal Proofs (2017)

    Google Scholar 

  12. Dongol, B., Gomes, V.B.F., Struth, G.: A program construction and verification tool for separation logic. In: Hinze, R., Voigtländer, J. (eds.) MPC 2015. LNCS, vol. 9129, pp. 137–158. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19797-5_7

    Chapter  MATH  Google Scholar 

  13. Dongol, B., Hayes, I., Struth, G.: Convolution algebras: Relational convolution, generalised modalities and incidence algebras. Logical Methods Comput. Sci. 17(1) (2021)

    Google Scholar 

  14. Dongol, B., Hayes, I.J., Struth, G.: Convolution as a unifying concept: applications in separation logic, interval calculi, and concurrency. ACM Trans. Comput. Logic 17(3), 15:1-15:25 (2016)

    Article  MathSciNet  Google Scholar 

  15. Foulis, D.J., Bennett, M.K.: Effect algebras and unsharp quantum logics. Found. Phys. 24, 1331–1352 (1994)

    Article  MathSciNet  Google Scholar 

  16. Haslbeck, M.P.L.: Verified Quantiative Analysis of Imperative Algorithms. PhD thesis, Fakuktät für Informatik, Technische Universität München (2021)

    Google Scholar 

  17. Hedlíková, J., Pulmannová, S.: Generalized difference posets and orthoalgebras. Acta Mathematica Universitatis Comenianae LXV, 247–279 (1996)

    MathSciNet  MATH  Google Scholar 

  18. Jenča, G., Pulmannová, S.: Quotients of partial abelian monoids and the Riesz decomposition property. Algebra Universalis 47, 443–447 (2002)

    Article  MathSciNet  Google Scholar 

  19. Jipsen, P., Litak, T.: An algebraic glimpse at bunched implications and separation logic (2017). CoRR, abs/1709.07063

    Google Scholar 

  20. Jung, R., Krebbers, R., Jourdan, J.-H., Bizjak, A., Birkedal, L., Dreyer, D.: Iris from the ground up: A modular foundation for higher-order concurrent separation logic. J. Funct. Program. 28, e20 (2018)

    Article  MathSciNet  Google Scholar 

  21. Larchey-Wendling, D.:An alternative direct simulation of Minsky machines into classical bunched logics via group semantics. In: MFPS 2010, vol. 265 of ENTCS, pp. 369–387. Elsevier (2010)

    Google Scholar 

  22. O’Hearn, P., Reynolds, J., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 1–19. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44802-0_1

    Chapter  Google Scholar 

  23. Rosenthal, K.L.: Quantales and their Applications. Longman Scientific & Technical, Harlow (1990)

    MATH  Google Scholar 

  24. Struth, G.: Quantales. Arch. Formal Proofs (2018)

    Google Scholar 

  25. 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). https://doi.org/10.1007/978-3-540-74407-8_18

    Chapter  Google Scholar 

  26. Yetter, D.N.: Quantales and (noncommutative) linear logic. J. Symb. Logic 55(1), 41–64 (1990)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This research was supported in part by Australian Research Council (ARC) Grant DP190102142. The third author acknowledges sponsorship by Labex DigiCosme for an invited professorship at Laboratoire d’informatique de l’École polytechnique. The authors are grateful for helpful comments by the anonymous reviewers.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Callum Bannister .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bannister, C., Höfner, P., Struth, G. (2021). Effect Algebras, Girard Quantales and Complementation in Separation Logic. In: Fahrenberg, U., Gehrke, M., Santocanale, L., Winter, M. (eds) Relational and Algebraic Methods in Computer Science. RAMiCS 2021. Lecture Notes in Computer Science(), vol 13027. Springer, Cham. https://doi.org/10.1007/978-3-030-88701-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-88701-8_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-88700-1

  • Online ISBN: 978-3-030-88701-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics