The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Resources, concurrency, and local reasoning
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Communicating sequential processes
(1986) · Microprocessors and Microsystems · doi:10.1016/0141-9331(86)90196-1 · Cited by 2,167
Separation logic: a logic for shared mutable data structures
Reynolds, J. C. (2003) · Proceedings 17th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2002.1029817 · Cited by 2,156
Monitors: an operating system structuring concept
Hoare, C. A. R. (1974) · Communications of the ACM · doi:10.1145/355620.361161 · Cited by 1,496
Fiftieth volume of theoretical computer science
Maurice Nivat, B. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90001-1 · Cited by 1,319
Hierarchical ordering of sequential processes
Dijkstra, E. (1971) · Acta Informatica · doi:10.1007/bf00289519 · Cited by 797
The Polyadic π-Calculus: a Tutorial
Milner, R. (1993) · Springer eBooks · doi:10.1007/978-3-642-58041-3_6 · Cited by 780
Local Reasoning about Programs that Alter Data Structures
O’Hearn, P., Reynolds, J., & Yang, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44802-0_1 · Cited by 705
Self-citationThe temporal semantics of concurrent programs
Pnueli, A. (1981) · Theoretical Computer Science · doi:10.1016/0304-3975(81)90110-9 · Cited by 699
Language support for lightweight transactions
Harris, T., & Fraser, K. A. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641654 · Cited by 630
Hansen, P. B. (1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 608
Ownership types for safe programming: preventing data races and deadlocks
Boyapati, C., Lee, R., & Rinard, M. (2002) · Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02 · doi:10.1145/582419.582440 · Cited by 570
The Logic of Bunched Implications
O’Hearn, P. W., & Pym, D. J. (1999) · Bulletin of Symbolic Logic · doi:10.2307/421090 · Cited by 514
Self-citationHazard pointers: safe memory reclamation for lock-free objects
Michael, M. M. (2004) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2004.8 · Cited by 508
Proofs of Networks of Processes
Misra, J., & Chandy, K. M. (1981) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1981.230844 · Cited by 493
(1968) · doi:10.1007/978-1-4615-9050-7_2 · Cited by 395
Checking interference with fractional permissions
Boyland, J. (2003) · Cited by 382
The nucleus of a multiprogramming system
Hansen, P. B. (1970) · Communications of the ACM · doi:10.1145/362258.362278 · Cited by 334
A semantics for concurrent separation logic
Brookes, S. D. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.12.034 · Cited by 245
Smith, F., Walker, D., & Morrisett, G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46425-5_24 · Cited by 212
Hansen, P. B. (1972) · Communications of the ACM · doi:10.1145/361454.361473 · Cited by 203
Syntactic control of interference
Reynolds, J. C. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512766 · Cited by 200
Simple Ownership Types for Object Containment
Clarke, D. G., Noble, J., & Potter, J. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45337-7_4 · Cited by 121
Syntactic Control of Interference
Reynolds, J. C. (1997) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-4118-8_11 · Cited by 93
Variables as Resource in Separation Logic
Bornat, R., Calcagno, C., & Yang, H. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.11.059 · Cited by 70
A Calculus and logic of resources and processes
Pym, D. J., & Tofts, C. (2006) · Formal Aspects of Computing · doi:10.1007/s00165-006-0018-z · Cited by 50
Towards imperative modules: reasoning about invariants and sharing of mutable state
Naumann, D. A., & Barnett, M. (2004) · Logic in Computer Science · doi:10.1109/lics.2004.49 · Cited by 16
Towards imperative modules: reasoning about invariants and sharing of mutable state
Naumann, D. A., & Barnett, M. (2004) · Proceedings - Symposium on Logic in Computer Science · doi:10.1109/lics.2004.1319626 · Cited by 16
Cited by
A Formally Verified Compiler Back-end
Leroy, X. (2009) · Journal of Automated Reasoning · doi:10.1007/s10817-009-9155-4 · Cited by 503
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
JUNG, R., KREBBERS, R., JOURDAN, J.-H., BIZJAK, A., BIRKEDAL, L., & DREYER, D. (2018) · Journal of Functional Programming · doi:10.1017/s0956796818000151 · Cited by 372
RustBelt: securing the foundations of the Rust programming language
Jung, R., Jourdan, J.-H., Krebbers, R., & Dreyer, D. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158154 · Cited by 368
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Berdine, J., Calcagno, C., & O’Hearn, P. W. (2006) · Lecture Notes in Computer Science · doi:10.1007/11804192_6 · Cited by 316
Self-citationA type and effect system for deterministic parallel Java
Bocchino, R. L., Adve, V. S., Dig, D., Adve, S. V., Heumann, S., Komuravelli, R., Overbey, J., Simmons, P., Sung, H., & Vakilian, M. (2009) · ACM SIGPLAN Notices · doi:10.1145/1639949.1640097 · Cited by 295
Metadata
- Authors
- O’Hearn, P. W.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2007-05
- Volume
- 375
- Issue
- 1-3
- Pages
- 271-307
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2132761501
- Cited by
- 552
- References
- 29
- FWCI
- 45.70
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.