On the public citation graph

Proving highly-concurrent traversals correct

https://doi.org/10.1145/3428196
0 signed · 75 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11795490_3openalex-snapshot
A Lazy Concurrent List-Based Set Algorithm
inferredcites →https://doi.org/10.1007/3-540-45414-4_21openalex-snapshot
A Pragmatic Implementation of Non-blocking Linked-lists
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_1openalex-snapshot
Poling: SMT Aided Linearizability Proofs
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_28openalex-snapshot
Proving Linearizability Using Forward Simulations
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_2openalex-snapshot
A Semantics for Concurrent Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_4openalex-snapshot
Resources, Concurrency and Local Reasoning
inferredcites →https://doi.org/10.1007/978-3-540-72951-8_11openalex-snapshot
A Simple Optimistic Skiplist Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_49openalex-snapshot
Comparison Under Abstraction for Verifying Linearizability
inferredcites →https://doi.org/10.1007/978-3-540-93900-9_27openalex-snapshot
Shape-Value Abstraction for Verifying Linearizability
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_40openalex-snapshot
Automatically Proving Linearizability
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_23openalex-snapshot
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_17openalex-snapshot
Verifying Concurrent Programs against Sequential Specifications
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_11openalex-snapshot
Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
inferredcites →https://doi.org/10.1007/978-3-642-40047-6_25openalex-snapshot
A Contention-Friendly Binary Search Tree
inferredcites →https://doi.org/10.1007/978-3-642-40184-8_18openalex-snapshot
Aspect-Oriented Linearizability Proofs
inferredcites →https://doi.org/10.1007/978-3-662-44202-9_9openalex-snapshot
TaDA: A Logic for Time and Data Abstraction
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_14openalex-snapshot
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_29openalex-snapshot
CoLoSL: Concurrent Local Subjective Logic
inferredcites →https://doi.org/10.1007/978-3-662-48653-5_24openalex-snapshot
A Constructive Approach for Proving Data Structures’ Linearizability
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferredcites →https://doi.org/10.1109/icdcs.2013.42openalex-snapshot
No Hot Spot Non-blocking Skip List
inferredcites →https://doi.org/10.1109/tpds.2011.159openalex-snapshot
User-Level Implementations of Read-Copy Update
inferredcites →https://doi.org/10.1142/s0129626416500158openalex-snapshot
A Fast Contention-Friendly Binary Search Tree
inferredcites →https://doi.org/10.1145/1040305.1040327openalex-snapshot
Permission accounting in separation logic
inferredcites →https://doi.org/10.1145/1122971.1122992openalex-snapshot
Proving correctness of highly-concurrent linearisable objects
inferredcites →https://doi.org/10.1145/1190215.1190261openalex-snapshot
Modular verification of a non-blocking stack
inferredcites →https://doi.org/10.1145/1190216.1190261openalex-snapshot
Modular verification of a non-blocking stack
inferredcites →https://doi.org/10.1145/1693453.1693488openalex-snapshot
A practical concurrent binary search tree
inferredcites →https://doi.org/10.1145/1706299.1706305openalex-snapshot
Sequential verification of serializability
inferredcites →https://doi.org/10.1145/1835698.1835722openalex-snapshot
Verifying linearizability with hindsight
inferredcites →https://doi.org/10.1145/2150976.2150998openalex-snapshot
Scalable address spaces using RCU balanced trees
inferredcites →https://doi.org/10.1145/2168836.2168855openalex-snapshot
Cache craftiness for fast multicore key-value storage
inferredcites →https://doi.org/10.1145/2312005.2312036openalex-snapshot
A non-blocking internal binary search tree
inferredcites →https://doi.org/10.1145/2429069.2429134openalex-snapshot
Subjective auxiliary state for coarse-grained concurrency
inferredcites →https://doi.org/10.1145/2491956.2462189openalex-snapshot
Modular verification of linearizability with non-fixed linearization points
inferredcites →https://doi.org/10.1145/2500365.2500600openalex-snapshot
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
inferredcites →https://doi.org/10.1145/2517349.2522713openalex-snapshot
Speedy transactions in multicore in-memory databases
inferredcites →https://doi.org/10.1145/2555243.2555256openalex-snapshot
Fast concurrent lock-free binary search trees
inferredcites →https://doi.org/10.1145/2555243.2555267openalex-snapshot
A general technique for non-blocking trees
inferredcites →https://doi.org/10.1145/2555243.2555269openalex-snapshot
Practical concurrent binary search trees via logical ordering
inferredcites →https://doi.org/10.1145/2611462.2611471openalex-snapshot
Concurrent updates with RCU
inferredcites →https://doi.org/10.1145/2684464.2684472openalex-snapshot
A Fast Lock-Free Internal Binary Search Tree
inferredcites →https://doi.org/10.1145/2688500.2688501openalex-snapshot
More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms
inferredcites →https://doi.org/10.1145/2694344.2694359openalex-snapshot
Asynchronized Concurrency
inferredcites →https://doi.org/10.1145/2983990.2983999openalex-snapshot
Hoare-style specifications as correctness conditions for non-linearizable concurrent objects
inferredcites →https://doi.org/10.1145/3158125openalex-snapshot
Go with the flow: compositional abstractions for concurrent data structures
inferredcites →https://doi.org/10.1145/3360587openalex-snapshot
Specifying concurrent programs in separation logic: morphisms and simulations
inferredcites →https://doi.org/10.1145/3371113openalex-snapshot
The future is ours: prophecy variables in separation logic
inferredcites →https://doi.org/10.1145/3385412.3386029openalex-snapshot
Verifying concurrent search structure templates
inferredcites →https://doi.org/10.1145/3428196openalex-snapshot
Proving highly-concurrent traversals correct
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1145/42201.42204openalex-snapshot
Concurrent search structure algorithms
inferredcites →https://doi.org/10.1145/564870.564881openalex-snapshot
High performance dynamic lock-free hash tables and list-based sets
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.2168/lmcs-11(1:20)2015openalex-snapshot
Aspect-oriented linearizability proofs
inferredcites →https://doi.org/10.25405/ncl.34125705openalex-snapshot
Specification and Design of (Parallel) Programs
inferredcites →https://doi.org/10.4230/lipics.disc.2018.23openalex-snapshot
Order out of Chaos: Proving Linearizability Using Local Views
inferredcites →https://doi.org/10.48456/tr-579openalex-snapshot
Practical lock-freedom
inferredcites →https://doi.org/10.48456/tr-659openalex-snapshot
A safety proof of a lazy concurrent list-based set implementation
inferredcites →https://doi.org/10.48456/tr-726openalex-snapshot
Modular fine-grained concurrency verification
inferredcites →https://doi.org/10.48550/arxiv.1502.06882openalex-snapshot
On Reducing Linearizability to State Reachability
inferredcites →https://doi.org/10.6083/m4gh9fvbopenalex-snapshot
Exploiting deferred destruction an analysis of read-copy-update techniques in operating system kernels

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_9openalex-snapshot
nekton: A Linearizability Proof Checker
inferred← citeshttps://doi.org/10.1145/3485490openalex-snapshot
Verifying concurrent multicopy search structures
inferred← citeshttps://doi.org/10.1145/3503221.3508412openalex-snapshot
Bundling linked data structures for linearizable range queries
inferred← citeshttps://doi.org/10.1145/3563337openalex-snapshot
A concurrent program logic with a future and history
inferred← citeshttps://doi.org/10.1145/3591284openalex-snapshot
Efficient Parallel Functional Programming with Effects
inferred← citeshttps://doi.org/10.1145/3591296openalex-snapshot
Embedding Hindsight Reasoning in Separation Logic
inferred← citeshttps://doi.org/10.1145/3636501.3636940openalex-snapshot
Compositional Verification of Concurrent C Programs with Search Structure Templates
inferred← citeshttps://doi.org/10.1145/3689775openalex-snapshot
Concurrent Data Structures Made Easy
inferred← citeshttps://doi.org/10.1145/3704906openalex-snapshot
RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency
inferred← citeshttps://doi.org/10.1145/3729248openalex-snapshot
Verifying Lock-Free Traversals in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2110.05801openalex-snapshot
Verify Linearizability of Concurrent Stacks
showing the first 11 of 12 · page through all 12
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.