The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning
Abstract
We present Iris, a concurrent separation logic with a simple premise: monoids and invariants are all you need. Partial commutative monoids enable us to express---and invariants enable us to enforce---user-defined *protocols* on shared state, which are at the conceptual core of most recent program logics for concurrency. Furthermore, through a novel extension of the concept of a *view shift*, Iris supports the encoding of *logically atomic specifications*, i.e., Hoare-style specs that permit the client of an operation to treat the operation essentially as if it were atomic, even if it is not.
Overview
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
(2014) · Developing Nonprofit and Human Service Leaders: Essential Knowledge and Skills · doi:10.4135/9781483388007.n5 · Cited by 3,811
Linearizability: a correctness condition for concurrent objects
Herlihy, M. P., & Wing, J. M. (1990) · ACM Transactions on Programming Languages and Systems · doi:10.1145/78969.78972 · Cited by 3,176
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
Lamport (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675439 · Cited by 2,519
Communicating and Mobile Systems: the Pi-Calculus
Milner, R. (1999) · Cited by 2,256
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
The existence of refinement mappings
Abadi, M., & Lamport, L. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90224-p · Cited by 737
Tentative steps toward a development method for interfering programs
Jones, C. B. (1983) · ACM Transactions on Programming Languages and Systems · doi:10.1145/69575.69577 · Cited by 617
Resources, concurrency, and local reasoning
O’Hearn, P. W. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.12.035 · Cited by 552
State-dependent representation independence
Ahmed, A., Dreyer, D., & Rossberg, A. (2009) · Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1480881.1480925 · Cited by 183
Self-citationViews: compositional reasoning for concurrent programs
Dinsdale-Young, T., Birkedal, L., Gardner, P., Parkinson, M., & Yang, H. (2013) · Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/2429069.2429104 · Cited by 159
Self-citation
Cited by
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
Self-citationRustBelt: 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
Self-citationTimany, A., Stefanesco, L., Krogh-Jespersen, M., & Birkedal, L. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158152 · Cited by 51
Self-citation
Metadata
- Authors
- Jung, R., Swasey, D., Sieczkowski, F., Svendsen, K., Turon, A., Birkedal, L., & Dreyer, D.
- Venue
- Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
- Publisher
- ACM
- Published
- 2015-01-14
- Pages
- 637-650
- OpenAlex
- W2147323041
- Cited by
- 276
- References
- 15
- FWCI
- 12.06
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning. https://app.cochat.ai/papers/10.1145/2676726.2676980
- The paper
- Jung, R., Swasey, D., Sieczkowski, F., Svendsen, K., Turon, A., Birkedal, L., & Dreyer, D. (2015). Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. https://doi.org/10.1145/2676726.2676980
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.