On the public citation graph

Testing for linearizability

0 signed · 56 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.1006/inco.1999.2847openalex-snapshot
Model-Checking of Correctness Conditions for Concurrent Objects
inferredcites →https://doi.org/10.1006/jpdc.1993.1015openalex-snapshot
Testing and Verifying Concurrent Objects
inferredcites →https://doi.org/10.1007/978-3-319-19195-9_4openalex-snapshot
Faster Linearizability Checking via P-Compositionality
inferredcites →https://doi.org/10.1007/978-3-642-02652-2_21openalex-snapshot
Experience with Model Checking 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-14295-6_41openalex-snapshot
Model Checking of Linearizability of Concurrent List Implementations
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-40184-8_18openalex-snapshot
Aspect-Oriented Linearizability Proofs
inferredcites →https://doi.org/10.1007/978-3-662-47666-6_8openalex-snapshot
On Reducing Linearizability to State Reachability
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1016/j.entcs.2005.04.026openalex-snapshot
Verifying Concurrent Data Structures by Simulation
inferredcites →https://doi.org/10.1109/iceccs.2005.49openalex-snapshot
Formal verification of an array-based nonblocking queue
inferredcites →https://doi.org/10.1109/icpads.2000.857731openalex-snapshot
A practical nonblocking queue algorithm using compare-and-swap
inferredcites →https://doi.org/10.1109/icse.2013.6606574openalex-snapshot
Automatic testing of sequential and concurrent substitutability
inferredcites →https://doi.org/10.1109/tse.2012.82openalex-snapshot
Verifying Linearizability via Optimized Refinement Checking
inferredcites →https://doi.org/10.1137/s0097539794279614openalex-snapshot
Testing Shared Memories
inferredcites →https://doi.org/10.1145/1146381.1146382openalex-snapshot
The art of multiprocessor programming
inferredcites →https://doi.org/10.1145/1297027.1297033openalex-snapshot
Statistically rigorous java performance evaluation
inferredcites →https://doi.org/10.1145/1297105.1297033openalex-snapshot
Statistically rigorous java performance evaluation
inferredcites →https://doi.org/10.1145/1806596.1806634openalex-snapshot
Line-up
inferredcites →https://doi.org/10.1145/1809028.1806634openalex-snapshot
Line-up
inferredcites →https://doi.org/10.1145/1889997.1890001openalex-snapshot
Mechanically verified proof obligations for linearizability
inferredcites →https://doi.org/10.1145/2254064.2254126openalex-snapshot
Fully automatic and precise detection of thread safety violations
inferredcites →https://doi.org/10.1145/2345156.2254126openalex-snapshot
Fully automatic and precise detection of thread safety violations
inferredcites →https://doi.org/10.1145/2676726.2676963openalex-snapshot
A Scalable, Correct Time-Stamped Stack
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.48550/arxiv.1004.2772openalex-snapshot
Boosting Multi-Core Reachability Performance with Shared Hash Tables
inferredcites →https://doi.org/10.5555/2486788.2486826openalex-snapshot
Automatic testing of sequential and concurrent substitutability

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.3251openalex-snapshot
Efficient linearizability checking for actor‐based systems
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_16openalex-snapshot
Gradual Consistency Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_19openalex-snapshot
On the Complexity of Checking Consistency for Replicated Data Types
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_30openalex-snapshot
Violat: Generating Tests of Observational Refinement for Concurrent Objects
inferred← citeshttps://doi.org/10.1007/978-3-030-53288-8_17openalex-snapshot
Root Causing Linearizability Violations
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_8openalex-snapshot
Concurrent Correctness in Vector Space
inferred← citeshttps://doi.org/10.1007/978-3-031-35257-7_12openalex-snapshot
VeriLin: A Linearizability Checker for Large-Scale Concurrent Objects
inferred← citeshttps://doi.org/10.1007/978-3-032-00828-2_18openalex-snapshot
Checking Linearizability of Multi-core Task Management and Scheduling System
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_5openalex-snapshot
Deciding Serializability in Network Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-19195-9_4openalex-snapshot
Faster Linearizability Checking via P-Compositionality
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_26openalex-snapshot
Monitoring Weak Consistency
inferred← citeshttps://doi.org/10.1007/978-3-319-99933-3_7openalex-snapshot
Interleaving-Tree Based Fine-Grained Linearizability Fault Localization
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.08.001openalex-snapshot
Lock-free concurrent binomial heaps
inferred← citeshttps://doi.org/10.1016/j.scico.2026.103509openalex-snapshot
A reliable non-intrusive runtime verification framework for linearizability
inferred← citeshttps://doi.org/10.1109/iccq51190.2021.9392904openalex-snapshot
An Efficient Dynamic Analysis Tool for Checking Durable Linearizability
inferred← citeshttps://doi.org/10.1109/iwqos65803.2025.11143262openalex-snapshot
Monica: Towards Scalable Distributed System Verification by Programmable Switch-Based Testing
inferred← citeshttps://doi.org/10.1142/s0218194017400071openalex-snapshot
Localization of Linearizability Faults on the Coarse-Grained Level
inferred← citeshttps://doi.org/10.1145/3158113openalex-snapshot
Sound, complete, and tractable linearizability monitoring for concurrent collections
inferred← citeshttps://doi.org/10.1145/3290371openalex-snapshot
Decoupling lock-free data structures from memory reclamation for static analysis
inferred← citeshttps://doi.org/10.1145/3293883.3295726openalex-snapshot
Checking linearizability using hitting families
inferred← citeshttps://doi.org/10.1145/3371136openalex-snapshot
Pointer life cycle types for lock-free data structures with memory reclamation
inferred← citeshttps://doi.org/10.1145/3428221openalex-snapshot
DiffStream: differential output testing for stream processing programs
inferred← citeshttps://doi.org/10.1145/3704906openalex-snapshot
RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency
inferred← citeshttps://doi.org/10.1145/3729328openalex-snapshot
Efficient Linearizability Monitoring
inferred← citeshttps://doi.org/10.1145/3763123openalex-snapshot
Efficient Decrease-and-Conquer Linearizability Monitoring
inferred← citeshttps://doi.org/10.18293/seke2017-145openalex-snapshot
Localization of Linearizability Faults on the Coarse-grained Level
inferred← citeshttps://doi.org/10.48550/arxiv.1504.00204openalex-snapshot
Faster linearizability checking via $P$-compositionality
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.