On the public citation graph

Sound, complete, and tractable linearizability monitoring for concurrent collections

https://doi.org/10.1145/3158113
0 signed · 67 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.1002/cpe.3928openalex-snapshot
Testing for linearizability
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-319-26850-7_21openalex-snapshot
On the Complexity of Linearizability
inferredcites →https://doi.org/10.1007/978-3-319-48989-6_26openalex-snapshot
A Generic Logic for Proving Linearizability
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-642-05089-3_21openalex-snapshot
Model Checking Linearizability via Refinement
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-31424-7_21openalex-snapshot
How to Prove Algorithms Linearisable
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-40184-8_18openalex-snapshot
Aspect-Oriented Linearizability Proofs
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-47666-6_8openalex-snapshot
On Reducing Linearizability to State Reachability
inferredcites →https://doi.org/10.1007/s10009-003-0117-6openalex-snapshot
Efficient monitoring of safety properties
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1109/tse.2015.2467371openalex-snapshot
Round-Up: Runtime Verification of Quasi Linearizability for Concurrent Data Structures
inferredcites →https://doi.org/10.1137/s0097539794279614openalex-snapshot
Testing Shared Memories
inferredcites →https://doi.org/10.1145/1806596.1806634openalex-snapshot
Line-up
inferredcites →https://doi.org/10.1145/1835698.1835722openalex-snapshot
Verifying linearizability with hindsight
inferredcites →https://doi.org/10.1145/1950365.1950377openalex-snapshot
Specifying and checking semantic atomicity for multithreaded programs
inferredcites →https://doi.org/10.1145/1985793.1986037openalex-snapshot
Scalable automatic linearizability checking
inferredcites →https://doi.org/10.1145/2048066.2048073openalex-snapshot
Testing atomicity of composed concurrent operations
inferredcites →https://doi.org/10.1145/2491956.2462189openalex-snapshot
Modular verification of linearizability with non-fixed linearization points
inferredcites →https://doi.org/10.1145/2676726.2676963openalex-snapshot
A Scalable, Correct Time-Stamped Stack
inferredcites →https://doi.org/10.1145/2676726.2677002openalex-snapshot
Tractable Refinement Checking for Concurrent Objects
inferredcites →https://doi.org/10.1145/2699681openalex-snapshot
The Scalable Commutativity Rule
inferredcites →https://doi.org/10.1145/2737924.2737964openalex-snapshot
Mechanized verification of fine-grained concurrent programs
inferredcites →https://doi.org/10.1145/2737924.2737983openalex-snapshot
Monitoring refinement via symbolic reasoning
inferredcites →https://doi.org/10.1145/2837614.2837645openalex-snapshot
Symbolic abstract data type inference
inferredcites →https://doi.org/10.1145/343477.343502openalex-snapshot
Towards robust distributed systems (abstract)
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1145/800233.807045openalex-snapshot
Programming with abstract data types
inferredcites →https://doi.org/10.1145/942572.807045openalex-snapshot
Programming with abstract data types
inferredcites →https://doi.org/10.1201/9781315119335-48openalex-snapshot
Concurrent Data Structures
inferredcites →https://doi.org/10.1201/9781420035179.ch47openalex-snapshot
Concurrent Data Structures
inferredcites →https://doi.org/10.48550/arxiv.1706.09305openalex-snapshot
Exposing Non-Atomic Methods of Concurrent Objects

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-31277-0_3openalex-snapshot
Checking Causal Consistency of Distributed Databases
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-031-98685-7_15openalex-snapshot
On the Complexity of Checking Mixed Isolation Levels for SQL Transactions
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-96145-3_26openalex-snapshot
Monitoring Weak Consistency
inferred← citeshttps://doi.org/10.1007/s00607-021-00911-3openalex-snapshot
Checking causal consistency of distributed databases
inferred← citeshttps://doi.org/10.1109/iccq51190.2021.9392904openalex-snapshot
An Efficient Dynamic Analysis Tool for Checking Durable Linearizability
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/3360591openalex-snapshot
On the complexity of checking transactional consistency
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/3373718.3394783openalex-snapshot
The Complexity of Dynamic Data Race Prediction
inferred← citeshttps://doi.org/10.1145/3583668.3594563openalex-snapshot
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
inferred← citeshttps://doi.org/10.1145/3689802openalex-snapshot
Automated Robustness Verification of Concurrent Data Structure Libraries against Relaxed Memory Models
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.1145/3777409openalex-snapshot
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
inferred← citeshttps://doi.org/10.1145/3808248openalex-snapshot
Fast Atomicity Monitoring
inferred← citeshttps://doi.org/10.48550/arxiv.1905.06421openalex-snapshot
Quantifiability: Concurrent Correctness from First Principles
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.