Article

Permission accounting in separation logic

Authors:

Richard Bornat,

Cristiano Calcagno,

Matthew ParkinsonAuthors Info & Claims

POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 259 - 270

https://doi.org/10.1145/1040305.1040327

Published: 12 January 2005 Publication History

Abstract

A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission between threads, subdivision and combination of permission is discussed. The roots of the approach are in Boyland's [3] demonstration of the utility of fractional permissions in specifying non-interference between concurrent threads. We add the notion of counting permission, which mirrors the programming technique called permission counting. Both fractional and counting permissions permit passivity, the specification that a program can be permitted to access a heap cell yet prevented from altering it. Models of both mechanisms are described. The use of two different mechanisms is defended. Some interesting problems are acknowledged and some intriguing possibilities for future development, including the notion of resourcing as a step beyond typing, are paraded.

References

[1]

R. Bornat. Proving pointer programs in Hoare logic. In R. C. Backhouse and J. N. Oliveira, editors, Mathematics of Program Construction, 5th International Conference, LNCS, pages 102--126. Springer, 2000.]]

Digital Library

[2]

R. Bornat, C. Calcagno, and P. O'Hearn. Local reasoning, separation and aliasing. SPACE Workshop, Venice, 2004.]]

[3]

J. Boyland. Checking interference with fractional permissions. In R. Cousot, editor, Static Analysis: 10th International Symposium, volume 2694 of Lecture Notes in Computer Science, pages 55--72, Berlin, Heidelberg, New York, 2003. Springer.]]

Digital Library

[4]

P. Brinch Hansen. Operating System Principles. Prentice Hall, 1973.]]

Digital Library

[5]

P. Brinch Hansen, editor. The Origin of Concurrent Programming. Springer-Verlag, 2002.]]

Digital Library

[6]

S. D. Brookes. A semantics for concurrent separation logic. In CONCUR'04: 15th International Conference on Concurrency Theory, volume 3170 of Lecture Notes in Computer Science, pages 16--34, London, August 2004. Springer. Extended version to appear in Theoretical Computer Science.]]

[7]

R. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence, 7:23--50, 1972.]]

[8]

P. J. Courtois, F. Heymans, and D. L. Parnas. Concurrent control with "readers" and "writers". Commun. ACM, 14(10):667--668, 1971.]]

Digital Library

[9]

E. W. Dijkstra. Cooperating sequential processes. In F. Genuys, editor, Programming Languages, pages 43--112. Academic Press, 1968. Reprinted in {5}.]]

[10]

R. Ennals, R. Sharp, and A. Mycroft. Linear types for packet processing. In To appear. Proceedings of the 2004 European Symposium on Programming (ESOP), LNCS. Springer-Verlag, 2004.]]

[11]

C. A. R. Hoare. Towards a theory of parallel programming. In Hoare and Perrott, editors, in, ed. Operating System Techniques, 1972., pages 61--71. Academic Press, 1972.]]

[12]

E. J. Johnson and A. Kunze. IXP2400/2800 Programming: The Complete Microengine Coding Guide. Intel Press, 2003.]]

Digital Library

[13]

P. O'Hearn. Notes on separation logic for shared-variable concurrency. unpublished, Jan. 2002.]]

[14]

P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In L. Fribourg, editor, CSL 2001, pages 1--19. Springer-Verlag, 2001. LNCS 2142.]]

Digital Library

[15]

P. W. O'Hearn. Resources, concurrency and local reasoning. to appear in Theoretical Computer Science; preliminary version published as {16}.]]

Digital Library

[16]

P. W. O'Hearn. Resources, concurrency and local reasoning. In CONCUR'04: 15th International Conference on Concurrency Theory, volume 3170 of Lecture Notes in Computer Science, pages 49--67, London, August 2004. Springer. Extended version is {15}.]]

[17]

P. W. O'Hearn and D. J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215--244, June 1999.]]

[18]

D. Pym. The Semantics and Proof Theory of the Logic of Bunched Implications, volume 26 of Applied Logic Series. Kluwer Academic Publishers, 2002.]]

[19]

J. Reynolds. Separation logic: a logic for shared mutable data structures. Invited Paper, LICS'02, 2002.]]

Digital Library

[20]

J. C. Reynolds. Intuitionistic reasoning about shared mutable data structure. In J. Davies, B. Roscoe, and J. Woodcock, editors, Millennial Perspectives in Computer Science, pages 303--321. Palgrave, 2000.]]

[21]

H. Yang and P. O'Hearn. A semantic basis for local reasoning. In 5th FOSSACS, pages 402--416. Springer-Verlag, 2002.]]

Digital Library

Cited By

Moine ACharguéraud APottier F(2025)Will it Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage CollectionACM Transactions on Programming Languages and Systems10.1145/3716312Online publication date: 10-Feb-2025
https://doi.org/10.1145/3716312
Kim YCho MLee JKim JYoon TSong YHur C(2025)Archmage and CompCertCast: End-to-End Verification Supporting Integer-Pointer CastingProceedings of the ACM on Programming Languages10.1145/37048819:POPL(1326-1354)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704881
Liu CSridharan M(2024)Design of Fractional Permissions for a Gradual VerifierCompanion Proceedings of the 2024 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity10.1145/3689491.3689972(40-42)Online publication date: 20-Oct-2024
https://dl.acm.org/doi/10.1145/3689491.3689972
Show More Cited By

Index Terms

Permission accounting in separation logic

Recommendations

Permission accounting in separation logic
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission between threads, subdivision and combination of permission is discussed. The ...
Permission based granular access control pattern
PLoP '14: Proceedings of the 21st Conference on Pattern Languages of Programs

Enterprise applications are designed to address specific business needs and are generally run within the internal corporate networks. Access to enterprise applications is controlled by various corporate policies, based on numerous widely accepted ...
Separation of Duty Constraint for Permission Based Delegation Model
ISBIM '08: Proceedings of the 2008 International Seminar on Business and Information Management - Volume 01

In large enterprise software systems, users often need to delegate their authority to others. Permission base delegation model (PBDM) based on RBAC96 currently is the most attractive model to fulfill the delegation requirement since it supports partly ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 2005

402 pages

ISBN:158113830X

DOI:10.1145/1040305

General Chair:
Jens Palsberg
University of California, Los Angeles, CA
,
Program Chair:
Martín Abadi
University of California, Santa Cruz, CA

ACM SIGPLAN Notices Volume 40, Issue 1
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
January 2005
391 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1047659
Issue’s Table of Contents

Copyright © 2005 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 ACM 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 January 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

POPL05

Sponsor:

POPL05: The 32nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2005

January 12 - 14, 2005

California, Long Beach, USA

Acceptance Rates

Overall Acceptance Rate 860 of 4,328 submissions, 20%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

374
Total Citations
View Citations
1,014
Total Downloads

Downloads (Last 12 months)70
Downloads (Last 6 weeks)7

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Moine ACharguéraud APottier F(2025)Will it Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage CollectionACM Transactions on Programming Languages and Systems10.1145/3716312Online publication date: 10-Feb-2025
https://doi.org/10.1145/3716312
Kim YCho MLee JKim JYoon TSong YHur C(2025)Archmage and CompCertCast: End-to-End Verification Supporting Integer-Pointer CastingProceedings of the ACM on Programming Languages10.1145/37048819:POPL(1326-1354)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704881
Liu CSridharan M(2024)Design of Fractional Permissions for a Gradual VerifierCompanion Proceedings of the 2024 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity10.1145/3689491.3689972(40-42)Online publication date: 20-Oct-2024
https://dl.acm.org/doi/10.1145/3689491.3689972
Timany AKrebbers RDreyer DBirkedal L(2024)A Logical Approach to Type SoundnessJournal of the ACM10.1145/367695471:6(1-75)Online publication date: 11-Nov-2024
https://dl.acm.org/doi/10.1145/3676954
Enea CKoskinen E(2024)Scenario-Based Proofs for Concurrent ObjectsProceedings of the ACM on Programming Languages10.1145/36498578:OOPSLA1(1294-1323)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649857
Marshall DOrchard D(2024)Functional Ownership through Fractional UniquenessProceedings of the ACM on Programming Languages10.1145/36498488:OOPSLA1(1040-1070)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649848
Moine AWestrick SBalzer S(2024)DisLog: A Separation Logic for DisentanglementProceedings of the ACM on Programming Languages10.1145/36328538:POPL(302-331)Online publication date: 5-Jan-2024
https://doi.org/10.1145/3632853
Lammich P(2024)Refinement of Parallel Algorithms Down to LLVM: Applied to Practically Efficient Parallel SortingJournal of Automated Reasoning10.1007/s10817-024-09701-w68:3Online publication date: 19-Jun-2024
https://dl.acm.org/doi/10.1007/s10817-024-09701-w
Wittingen EHuisman MŞakar Ö(2024)Deductive Verification of SYCL in VerCorsSoftware Engineering and Formal Methods10.1007/978-3-031-77382-2_11(182-199)Online publication date: 4-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-77382-2_11
Rubbens RBos PHuisman M(2024)VeyMont: Choreography-Based Generation of Correct Concurrent Programs with Shared MemoryIntegrated Formal Methods10.1007/978-3-031-76554-4_12(217-236)Online publication date: 11-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-76554-4_12
Show More Cited By

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten