skip to main content
10.1145/2635631.2635847acmotherconferencesArticle/Chapter ViewAbstractPublication PagesecoopConference Proceedingsconference-collections
tutorial

Constraint Semantics for Abstract Read Permissions

Authors Info & Claims
Published:28 July 2014Publication History

ABSTRACT

The concept of controlling access to mutable shared data via permissions is at the heart of permission logics such as separation logic and implicit dynamic frames, and is also used in type systems, for instance, to give a semantics to "read-only" annotations. Existing permission models have different strengths in terms of expressiveness. Fractional permissions, for example, enable unbounded (recursive) splitting, whereas counting permissions enable unbounded subtraction of the same permission amount. Combining these strengths in a single permission model appeared to increase the complexity for the user and tools. In this paper we extend our previous work on abstract read permissions by providing them with a novel constraint semantics, which retains the use of the domain of rational numbers but enables unbounded subtraction of identical amounts. Thus we can keep an intuitive model conducive to SMT solvers while enabling "counting."

References

  1. R. Bornat, C. Calcagno, P. O'Hearn, and M. Parkinson. Permission accounting in separation logic. In POPL, pages 259--270. ACM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Boyland. Checking interference with fractional permissions. In SAS, volume 2694 of LNCS, pages 55--72. Springer, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Boyland. Fractional permissions. In Aliasing in Object-Oriented Programming, volume 7850 of LNCS, pages 270--288. Springer, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Dockins, A. Hobor, and A. W. Appel. A fresh look at separation algebras and share accounting. In APLAS, volume 5904 of LNCS, pages 161--177. Springer, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Heule, K. R. M. Leino, P. Müller, and A. J. Summers. Abstract read permissions: Fractional permissions without the fractions. In VMCAI, volume 7737 of LNCS, pages 315--334. Springer, 2013.Google ScholarGoogle Scholar
  6. B. Jacobs and F. Piessens. The VeriFast program verifier. Technical Report CW-520, KU Leuven, Aug. 2008.Google ScholarGoogle Scholar
  7. U. Juhasz, I. T. Kassios, P. Müller, M. Novacek, M. Schwerhoff, and A. J. Summers. Viper: A verification infrastructure for permission-based reasoning. Technical report, ETH Zurich, 2014.Google ScholarGoogle Scholar
  8. X. B. Le, C. Gherghina, and A. Hobor. Decision procedures over sophisticated fractional permissions. In APLAS, volume 7705 of LNCS, pages 368--385. Springer, 2012.Google ScholarGoogle Scholar
  9. K. R. M. Leino and R. Monahan. Reasoning about comprehensions with first-order SMT solvers. In SAC, pages 615--622. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. K. R. M. Leino and P. Müller. A basis for verifying multi-threaded programs. In ESOP, volume 5502 of LNCS, pages 378--393. Springer, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. J. Parkinson and G. M. Bierman. Separation logic and abstraction. In POPL, pages 247--258. ACM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS, pages 55--74. IEEE, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. J. Smans, B. Jacobs, and F. Piessens. Implicit dynamic frames: Combining dynamic frames and separation logic. In ECOOP, volume 5653 of LNCS, pages 148--172. Springer, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Constraint Semantics for Abstract Read Permissions

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        FTfJP'14: Proceedings of 16th Workshop on Formal Techniques for Java-like Programs
        July 2014
        33 pages
        ISBN:9781450328661
        DOI:10.1145/2635631
        • Program Chair:
        • David J. Pearce

        Copyright © 2014 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 28 July 2014

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • tutorial
        • Research
        • Refereed limited

        Acceptance Rates

        FTfJP'14 Paper Acceptance Rate5of8submissions,63%Overall Acceptance Rate32of49submissions,65%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader