research-article

Subjective auxiliary state for coarse-grained concurrency

Authors:

Aleksandar NanevskiAuthors Info & Claims

ACM SIGPLAN Notices, Volume 48, Issue 1

Pages 561 - 574

https://doi.org/10.1145/2480359.2429134

Published: 23 January 2013 Publication History

Abstract

From Owicki-Gries' Resource Invariants and Jones' Rely/Guarantee to modern variants based on Separation Logic, axiomatic logics for concurrency require auxiliary state to explicitly relate the effect of all threads to the global invariant on the shared resource. Unfortunately, auxiliary state gives the proof of an individual thread access to the auxiliaries of all other threads. This makes proofs sensitive to the global context, which prevents local reasoning and compositionality.

To tame this historical difficulty of auxiliary state, we propose subjective auxiliary state, whereby each thread is verified using a self view (i.e., the thread's effect on the shared resource) and an other view (i.e., the collective effect of all the other threads). Subjectivity generalizes auxiliary state from stacks and heaps to user-chosen partial commutative monoids, which can eliminate the dependence on the global thread structure.

We employ subjectivity to formulate Subjective Concurrent Separation Logic as a combination of subjective auxiliary state and Concurrent Separation Logic. The logic yields simple, compositional proofs of coarse-grained concurrent programs that use auxiliary state, and scales to support higher-order recursive procedures that can themselves fork new threads. We prove the soundness of the logic with a novel denotational semantics of action trees and a definition of safety using rely/guarantee transitions over a large subjective footprint. We have mechanized the denotational semantics, logic, metatheory, and a number of examples by a shallow embedding in Coq.

Supplementary Material

JPG File (r2d3_talk7.jpg)

Download
16.49 KB

MP4 File (r2d3_talk7.mp4)

Download
190.14 MB

References

[1]

Richard Bornat, Cristiano Calcagno, PeterW. O'Hearn, and Matthew J. Parkinson. Permission accounting in separation logic. In POPL, 2005.

Digital Library

[2]

Richard Bornat, Cristiano Calcagno, and Hongseok Yang. Variables as resource in separation logic. ENTCS, 155, 2006.

Digital Library

[3]

Stephen Brookes. A semantics for concurrent separation logic. Theor. Comput. Sci., 375(1-3), 2007.

Digital Library

[4]

Cristiano Calcagno, Peter W. O'Hearn, and Hongseok Yang. Local action and abstract separation logic. In LICS, 2007.

Digital Library

[5]

Pedro da Rocha Pinto, Thomas Dinsdale-Young, Mike Dodds, Philippa Gardner, and Mark J. Wheelhouse. A simple abstraction for complex concurrent indexes. In OOPSLA, 2011.

Digital Library

[6]

Thomas Dinsdale-Young, Mike Dodds, Philippa Gardner, Matthew J. Parkinson, and Viktor Vafeiadis. Concurrent abstract predicates. In ECOOP, 2010.

Digital Library

[7]

Mike Dodds, Xinyu Feng, Matthew J. Parkinson, and Viktor Vafeiadis. Deny-guarantee reasoning. In ESOP, 2009.

Digital Library

[8]

Xinyu Feng. Local rely-guarantee reasoning. In POPL, 2009.

Digital Library

[9]

Xinyu Feng, Rodrigo Ferreira, and Zhong Shao. On the relationship between concurrent separation logic and assume-guarantee reasoning. In ESOP, 2007.

Digital Library

[10]

Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, and Yu Zhang. Reasoning about optimistic concurrency using a program logic for history. In CONCUR, 2010.

Digital Library

[11]

Bart Jacobs and Frank Piessens. Expressive modular fine-grained concurrency specification. In POPL, 2011.

Digital Library

[12]

Cliff B. Jones. Specification and design of (parallel) programs. In IFIP Congress, 1983.

[13]

Cliff B. Jones. The role of auxiliary variables in the formal development of concurrent programs. Technical Report CS-TR-1179, University of Newcastle upon Tyne, Computing Science, 2009.

[14]

Thomas Kleymann. Hoare logic and auxiliary variables. Formal Aspects of Computing, 11, 1999.

[15]

Neelakantan R. Krishnaswami, Aaron Turon, Derek Dreyer, and Deepak Garg. Superficially substructural types. In ICFP, 2012.

Digital Library

[16]

Ruy Ley-Wild and Aleksandar Nanevski. Supporting Material. https://software.imdea.org/Üaleks/scsl/, July 2012.

[17]

Per Martin-L¨of. Haupstatz for the intuitionistic theory of iterated inductive definitions. In Scandinavian Logic Symposium, 1971.

[18]

The Coq development team. The Coq proof assistant reference manual. LogiCal Project, 2004. Version 8.0.

[19]

Peter W. O'Hearn. Resources, concurrency, and local reasoning. Theor. Comput. Sci., 375(1-3), 2007.

Digital Library

[20]

Susan S. Owicki. Axiomatic Proof Techniques for Parallel Programs. PhD thesis, Cornell University, 1975.

Digital Library

[21]

Susan S. Owicki and David Gries. Verifying properties of parallel programs: An axiomatic approach. Commun. ACM, 19(5), 1976.

Digital Library

[22]

Matthew J. Parkinson and Gavin M. Bierman. Separation logic and abstraction. In POPL, 2005.

Digital Library

[23]

Matthew J. Parkinson, Richard Bornat, and Cristiano Calcagno. Variables as resource in Hoare logics. In LICS, 2006.

Digital Library

[24]

Uday S. Reddy and John C. Reynolds. Syntactic control of interference for separation logic. In POPL, 2012.

Digital Library

[25]

Viktor Vafeiadis. Concurrent separation logic and operational semantics. ENTCS, 276, 2011.

Digital Library

[26]

Viktor Vafeiadis and Matthew J. Parkinson. A marriage of rely/guarantee and separation logic. In CONCUR, 2007.

Digital Library

Cited By

Wagner AEisbach ZAhmed A(2024)Realistic Realizability: Specifying ABIs You Can Count OnProceedings of the ACM on Programming Languages10.1145/36897558:OOPSLA2(1249-1278)Online publication date: 8-Oct-2024
https://doi.org/10.1145/3689755
D’Osualdo ESutherland JFarzan AGardner P(2021)TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent ProgramsACM Transactions on Programming Languages and Systems10.1145/347708243:4(1-134)Online publication date: 10-Nov-2021
https://dl.acm.org/doi/10.1145/3477082
He MQin SXu Z(2020)A Program Logic for Reasoning About C11 Programs With Release-SequencesIEEE Access10.1109/ACCESS.2020.30246818(173874-173903)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3024681
Show More Cited By

Index Terms

Subjective auxiliary state for coarse-grained concurrency
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Concurrent programming structures
  2. Software organization and properties
    1. Software functional properties
      1. Correctness
2. Theory of computation
  1. Logic
    1. Proof theory

Recommendations

Subjective auxiliary state for coarse-grained concurrency
POPL '13: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

From Owicki-Gries' Resource Invariants and Jones' Rely/Guarantee to modern variants based on Separation Logic, axiomatic logics for concurrency require auxiliary state to explicitly relate the effect of all threads to the global invariant on the shared ...
Sequential verification of serializability
POPL '10

Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verified by considering only its sequential executions. In many cases, concurrent ...
Coarse-grained transactions
POPL '10: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Traditional transactional memory systems suffer from overly conservative conflict detection, yielding so-called false conflicts, because they are based on fine-grained, low-level read/write conflicts. In response, the recent trend has been toward ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 48, Issue 1

POPL '13

January 2013

561 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/2480359

Issue’s Table of Contents

POPL '13: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
January 2013
586 pages
ISBN:9781450318327
DOI:10.1145/2429069
General Chair:
Roberto Giacobazzi
Università di Verona, Italy
,
Program Chair:
Radhia Cousot
École normale supérieure CNRS & INRIA, France

Copyright © 2013 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 January 2013

Published in SIGPLAN Volume 48, Issue 1

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
413
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)5

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wagner AEisbach ZAhmed A(2024)Realistic Realizability: Specifying ABIs You Can Count OnProceedings of the ACM on Programming Languages10.1145/36897558:OOPSLA2(1249-1278)Online publication date: 8-Oct-2024
https://doi.org/10.1145/3689755
D’Osualdo ESutherland JFarzan AGardner P(2021)TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent ProgramsACM Transactions on Programming Languages and Systems10.1145/347708243:4(1-134)Online publication date: 10-Nov-2021
https://dl.acm.org/doi/10.1145/3477082
He MQin SXu Z(2020)A Program Logic for Reasoning About C11 Programs With Release-SequencesIEEE Access10.1109/ACCESS.2020.30246818(173874-173903)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3024681
Jung RLepigre RParthasarathy GRapoport MTimany ADreyer DJacobs B(2019)The future is ours: prophecy variables in separation logicProceedings of the ACM on Programming Languages10.1145/33711134:POPL(1-32)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371113
Nanevski ABanerjee ADelbianco GFábregas I(2019)Specifying concurrent programs in separation logic: morphisms and simulationsProceedings of the ACM on Programming Languages10.1145/33605873:OOPSLA(1-30)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360587
Sakaguchi K(2019)Program extraction for mutable arraysScience of Computer Programming10.1016/j.scico.2019.102372(102372)Online publication date: Dec-2019
https://doi.org/10.1016/j.scico.2019.102372
He MQin SFerreira J(2018)Towards a Program Logic for C11 Release-Sequences2018 International Symposium on Theoretical Aspects of Software Engineering (TASE)10.1109/TASE.2018.00012(28-35)Online publication date: Aug-2018
https://doi.org/10.1109/TASE.2018.00012
He MVafeiadis VQin SFerreira J(2018)GPS$$+$$+International Journal of Parallel Programming10.1007/s10766-017-0518-x46:6(1157-1183)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1007/s10766-017-0518-x
Doko MVafeiadis V(2017)Tackling Real-Life Relaxed Concurrency with FSL++Programming Languages and Systems10.1007/978-3-662-54434-1_17(448-475)Online publication date: 19-Mar-2017
https://doi.org/10.1007/978-3-662-54434-1_17
Sergey INanevski ABanerjee ADelbianco G(2016)Hoare-style specifications as correctness conditions for non-linearizable concurrent objectsACM SIGPLAN Notices10.1145/3022671.298399951:10(92-110)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/3022671.2983999
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.

Media

Figures

Other

Tables

View Issue’s Table of Contents