On the public citation graph
An Operational Approach to Library Abstraction under Relaxed Memory Concurrency
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-030-44914-8_11openalex-snapshot
Verifying Visibility-Based Weak Consistency
inferredcites →https://doi.org/10.1007/978-3-030-99336-8_10openalex-snapshot
Abstraction for Crash-Resilient Objects
inferredcites →https://doi.org/10.1007/978-3-319-51046-0_9openalex-snapshot
Analysing Lock-Free Linearizable Datatypes Using CSP
inferredcites →https://doi.org/10.1007/978-3-319-73721-8_9openalex-snapshot
On abstraction and compositionality for weak-memory linearisability
inferredcites →https://doi.org/10.1007/978-3-319-96142-2_21openalex-snapshot
Reasoning About TSO Programs Using Reduction and Abstraction
inferredcites →https://doi.org/10.1007/978-3-319-98938-9_7openalex-snapshot
Making Linearizability Compositional for Partially Ordered Executions
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_27openalex-snapshot
A Better x86 Memory Model: x86-TSO
inferredcites →https://doi.org/10.1007/978-3-642-22012-8_36openalex-snapshot
Liveness-Preserving Atomicity Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-28869-2_5openalex-snapshot
Concurrent Library Correctness on the TSO Memory Model
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_15openalex-snapshot
Verifying Concurrent Memory Reclamation Algorithms with Grace
inferredcites →https://doi.org/10.1007/978-3-642-54862-8_13openalex-snapshot
FDR3 — A Modern Refinement Checker for CSP
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_12openalex-snapshot
The Problem of Programming Language Concurrency Semantics
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_29openalex-snapshot
On Atomicity in Presence of Non-atomic Writes
inferredcites →https://doi.org/10.1007/s00165-019-00499-8openalex-snapshot
Linearizability on hardware weak memory models
inferredcites →https://doi.org/10.1016/j.tcs.2010.09.021openalex-snapshot
Abstraction for concurrent objects
inferredcites →https://doi.org/10.1109/tc.1979.1675439openalex-snapshot
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
inferredcites →https://doi.org/10.1109/tpds.2011.159openalex-snapshot
User-Level Implementations of Read-Copy Update
inferredcites →https://doi.org/10.1145/1993498.1993520openalex-snapshot
Understanding POWER multiprocessors
inferredcites →https://doi.org/10.1145/2429069.2429099openalex-snapshot
Library abstraction for C/C++ concurrency
inferredcites →https://doi.org/10.1145/2676726.2677002openalex-snapshot
Tractable Refinement Checking for Concurrent Objects
inferredcites →https://doi.org/10.1145/2837614.2837643openalex-snapshot
Taming release-acquire consistency
inferredcites →https://doi.org/10.1145/3009837.3009850openalex-snapshot
A promising semantics for relaxed-memory concurrency
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3158105openalex-snapshot
Effective stateless model checking for C/C++ concurrency
inferredcites →https://doi.org/10.1145/3173162.3177156openalex-snapshot
Frightening Small Children and Disconcerting Grown-ups
inferredcites →https://doi.org/10.1145/3192366.3192421openalex-snapshot
Bounding data races in space and time
inferredcites →https://doi.org/10.1145/3276506openalex-snapshot
Towards understanding the costs of avoiding out-of-thin-air results
inferredcites →https://doi.org/10.1145/3290373openalex-snapshot
Weak-consistency specification via visibility relaxation
inferredcites →https://doi.org/10.1145/3290381openalex-snapshot
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models
inferredcites →https://doi.org/10.1145/3314221.3314604openalex-snapshot
Robustness against release/acquire semantics
inferredcites →https://doi.org/10.1145/3314221.3314609openalex-snapshot
Model checking for weakly consistent libraries
inferredcites →https://doi.org/10.1145/3437801.3441619openalex-snapshot
Verifying C11-style weak memory libraries
inferredcites →https://doi.org/10.1145/3445814.3446711openalex-snapshot
C11Tester: a race detector for C/C++ atomics
inferredcites →https://doi.org/10.1145/3453483.3454082openalex-snapshot
Modular data-race-freedom guarantees in the promising semantics
inferredcites →https://doi.org/10.1145/3473571openalex-snapshot
Formal verification of a concurrent bounded queue in a weak memory model
inferredcites →https://doi.org/10.1145/3473586openalex-snapshot
Theorems for free from separation logic specifications
inferredcites →https://doi.org/10.1145/3519939.3523451openalex-snapshot
Compass: strong and compositional library specifications in relaxed memory separation logic
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.2168/lmcs-9(3:12)2013openalex-snapshot
Linearizability with Ownership Transfer
inferredcites →https://doi.org/10.23638/lmcs-17(1:12)2021openalex-snapshot
Robustness Against Transactional Causal Consistency
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.17openalex-snapshot
Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris
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-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_8openalex-snapshot
Specifying and Verifying Persistent Libraries
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_3openalex-snapshot
Specifying and Verifying RDMA Synchronisation
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_20openalex-snapshot
Reasoning over Relaxed Shared Memory Models: A Tutorial
inferred← citeshttps://doi.org/10.1007/s10703-024-00462-1openalex-snapshot
A verified durable transactional mutex lock for persistent x86-TSO
inferred← citeshttps://doi.org/10.1145/3591297openalex-snapshot
Putting Weak Memory in Order via a Promising Intermediate Representation
inferred← citeshttps://doi.org/10.1145/3656384openalex-snapshot
A Proof Recipe for Linearizability in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/3656399openalex-snapshot
Compositional Semantics for Shared-Variable Concurrency
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/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
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.