The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Software transactional memory
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
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
Transactional memory: architectural support for lock-free data structures
Herlihy, M., & Moss, J. E. B. (1993) · Proceedings of the 20th annual international symposium on Computer architecture - ISCA '93 · doi:10.1145/165123.165164 · Cited by 2,141
Using cache memory to reduce processor-memory traffic
Goodman, J. R. (1998) · doi:10.1145/285930.285984 · Cited by 395
The drinking philosophers problem
Chandy, K. M., & Misra, J. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1780.1804 · Cited by 390
Cited by
Hazard 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
High performance dynamic lock-free hash tables and list-based sets
Michael, M. M. (2002) · Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures · doi:10.1145/564870.564881 · Cited by 413
Security, Performance, and Applications of Smart Contracts: A Systematic Survey
Rouhani, S., & Deters, R. (2019) · IEEE Access · doi:10.1109/access.2019.2911031 · Cited by 309
Metadata
- Authors
- Shavit, N., & Touitou, D.
- Venue
- Distributed Computing
- Published
- 1997-02-12
- Volume
- 10
- Issue
- 2
- Pages
- 99-116
- ISSN
- 0178-2770 (ISSN-L)
- 1432-0452
- OpenAlex
- W2769656678
- Cited by
- 402
- References
- 5
- FWCI
- 5.08
- Type
- journal article
- 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
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.