On the public citation graph

CheckFence

https://doi.org/10.1145/1273442.1250737
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.1007/11513988_9openalex-snapshot
Bounded Model Checking of Concurrent Programs
inferredcites →https://doi.org/10.1007/11795490_3openalex-snapshot
A Lazy Concurrent List-Based Set Algorithm
inferredcites →https://doi.org/10.1007/11817963_44openalex-snapshot
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
inferredcites →https://doi.org/10.1007/11817963_45openalex-snapshot
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
inferredcites →https://doi.org/10.1007/11864219_11openalex-snapshot
Checking a Multithreaded Algorithm with + CAL
inferredcites →https://doi.org/10.1016/j.jpdc.2004.12.005openalex-snapshot
Fast and lock-free concurrent priority queues for multi-thread systems
inferredcites →https://doi.org/10.1016/s1571-0661(05)80006-4openalex-snapshot
Automatically Verifying Concurrent Queue Algorithms
inferredcites →https://doi.org/10.1057/978-1-349-95988-4_489openalex-snapshot
International Business Machines Corporation
inferredcites →https://doi.org/10.1057/978-1-349-96042-2_6541openalex-snapshot
International Business Machines Corporation
inferredcites →https://doi.org/10.1109/2.546611openalex-snapshot
Shared memory consistency models: a tutorial
inferredcites →https://doi.org/10.1109/ipdps.2004.1302944openalex-snapshot
Nemos: a framework for axiomatic and executable specifications of memory consistency models
inferredcites →https://doi.org/10.1109/isca.2006.16openalex-snapshot
Conditional Memory Ordering
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.1145/1007912.1007945openalex-snapshot
DCAS is not a silver bullet for nonblocking algorithm design
inferredcites →https://doi.org/10.1145/1040305.1040336openalex-snapshot
The Java memory model
inferredcites →https://doi.org/10.1145/1065010.1065013openalex-snapshot
A serializability violation detector for shared-memory server programs
inferredcites →https://doi.org/10.1145/1065010.1065042openalex-snapshot
Threads cannot be implemented as a library
inferredcites →https://doi.org/10.1145/1095408.1095421openalex-snapshot
Software and the Concurrency Revolution
inferredcites →https://doi.org/10.1145/1119479.1119480openalex-snapshot
Types for safe locking
inferredcites →https://doi.org/10.1145/1122971.1122992openalex-snapshot
Proving correctness of highly-concurrent linearisable objects
inferredcites →https://doi.org/10.1145/1133981.1134018openalex-snapshot
Effective static race detection for Java
inferredcites →https://doi.org/10.1145/1133981.1134019openalex-snapshot
LOCKSMITH
inferredcites →https://doi.org/10.1145/215399.215413openalex-snapshot
An executable specification, analyzer and verifier for RMO (relaxed memory order)
inferredcites →https://doi.org/10.1145/248052.248106openalex-snapshot
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
inferredcites →https://doi.org/10.1145/259380.259442openalex-snapshot
Practical implementations of non-blocking synchronization primitives
inferredcites →https://doi.org/10.1145/265924.265927openalex-snapshot
Eraser
inferredcites →https://doi.org/10.1145/349299.349328openalex-snapshot
Type-based race detection for Java
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1145/42190.42277openalex-snapshot
Efficient and correct execution of parallel programs that share memory
inferredcites →https://doi.org/10.1145/782814.782854openalex-snapshot
Automatic fence insertion for shared memory multiprocessing
inferredcites →https://doi.org/10.1145/996841.996844openalex-snapshot
Race checking by context inference
inferredcites →https://doi.org/10.1145/996841.996848openalex-snapshot
Scalable lock-free dynamic memory allocation
inferredcites →https://doi.org/10.5555/1898953.1898968openalex-snapshot
On the effectiveness of speculative and selective memory fences

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-1-4419-9359-5_6openalex-snapshot
Bounded Model Checking for Concurrent Systems: Synchronous Vs. Asynchronous
inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_20openalex-snapshot
Stateful Dynamic Partial Order Reduction for Model Checking Event-Driven Applications that Do Not Terminate
inferred← citeshttps://doi.org/10.1007/978-3-319-03077-7_21openalex-snapshot
SPIN as a Linearizability Checker under Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_10openalex-snapshot
Reasoning Algebraically About Refinement on TSO Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_26openalex-snapshot
PBMC: Symbolic Slicing for the Verification of Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_8openalex-snapshot
Stateless Model Checking for POWER
inferred← citeshttps://doi.org/10.1007/978-3-319-66706-5_15openalex-snapshot
Portability Analysis for Weak Memory Models porthos: One Tool for all Models
inferred← citeshttps://doi.org/10.1007/978-3-319-89963-3_4openalex-snapshot
EMME: A Formal Tool for ECMAScript Memory Model Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_12openalex-snapshot
Effective Program Verification for Relaxed Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_21openalex-snapshot
Experience with Model Checking Linearizability
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_2openalex-snapshot
What’s Decidable about Weak Memory Models?
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_11openalex-snapshot
A High-Level Semantics for Program Execution under Total Store Order Memory
inferred← citeshttps://doi.org/10.1007/978-3-662-44202-9_8openalex-snapshot
Reusable Concurrent Data Types
inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_28openalex-snapshot
Stateless Model Checking for TSO and PSO
inferred← citeshttps://doi.org/10.1007/978-3-662-54580-5_4openalex-snapshot
Context-Bounded Analysis for POWER
inferred← citeshttps://doi.org/10.1007/s00165-011-0179-2openalex-snapshot
Symbolic predictive analysis for concurrent programs
inferred← citeshttps://doi.org/10.1145/1375581.1375598openalex-snapshot
Deriving linearizable fine-grained concurrent objects
inferred← citeshttps://doi.org/10.1145/1379022.1375598openalex-snapshot
Deriving linearizable fine-grained concurrent objects
inferred← citeshttps://doi.org/10.1145/2723372.2746480openalex-snapshot
FOEDUS
inferred← citeshttps://doi.org/10.1145/2818302.2818309openalex-snapshot
Making lock-free data structures verifiable with artificial transactions
inferred← citeshttps://doi.org/10.1145/2883591.2883603openalex-snapshot
Making Lock-free Data Structures Verifiable with Artificial Transactions
inferred← citeshttps://doi.org/10.1587/transinf.2018edp7099openalex-snapshot
A Verification Framework for Assembly Programs Under Relaxed Memory Model Using SMT Solver
inferred← citeshttps://doi.org/10.2200/s00499ed1v01y201304cac023openalex-snapshot
Shared-Memory Synchronization
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.