On the public citation graph

Don’t Sit on the Fence

https://doi.org/10.1145/2994593
0 signed · 80 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/jpdc.1996.0136openalex-snapshot
Analyses and Optimizations for Shared Address Space Programs
inferredcites →https://doi.org/10.1007/3-540-40026-5_4openalex-snapshot
Even Better DCAS-Based Concurrent Deques
inferredcites →https://doi.org/10.1007/978-3-319-10936-7_15openalex-snapshot
Synthesis of Memory Fences via Refinement Propagation
inferredcites →https://doi.org/10.1007/978-3-319-14896-0_3openalex-snapshot
Automating Software Analysis at Large Scale
inferredcites →https://doi.org/10.1007/978-3-319-19249-9_19openalex-snapshot
Property-Driven Fence Insertion Using Reorder Bounded Model Checking
inferredcites →https://doi.org/10.1007/978-3-319-26850-7_3openalex-snapshot
Precise and Sound Automatic Fence Insertion Procedure under PSO
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-14295-6_25openalex-snapshot
Fences in Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-642-22012-8_34openalex-snapshot
Deciding Robustness against Total Store Ordering
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_6openalex-snapshot
Stability in Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-642-23702-7_14openalex-snapshot
Verifying Fence Elimination Optimisations
inferredcites →https://doi.org/10.1007/978-3-642-25318-8_21openalex-snapshot
Soundness of Data Flow Analyses for Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_24openalex-snapshot
A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_37openalex-snapshot
Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_28openalex-snapshot
Software Verification for Weak Memory via Program Transformation
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_29openalex-snapshot
Checking and Enforcing Robustness against TSO
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_13openalex-snapshot
The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO
inferredcites →https://doi.org/10.1016/0020-0190(81)90106-xopenalex-snapshot
Myths about the mutual exclusion problem
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1109/12.599898openalex-snapshot
How to make a correct multiprocess program execute correctly on a multiprocessor
inferredcites →https://doi.org/10.1109/12.947002openalex-snapshot
Hiding relaxed memory consistency with a compiler
inferredcites →https://doi.org/10.1109/2.546611openalex-snapshot
Shared memory consistency models: a tutorial
inferredcites →https://doi.org/10.1109/cgo.2009.30openalex-snapshot
Reducing Memory Ordering Overheads in Software Transactional Memory
inferredcites →https://doi.org/10.1137/0202017openalex-snapshot
Enumeration of the Elementary Circuits of a Directed Graph
inferredcites →https://doi.org/10.1145/1065944.1065947openalex-snapshot
Compiler techniques for high performance sequentially consistent java programs
inferredcites →https://doi.org/10.1145/1073970.1073974openalex-snapshot
Dynamic circular work-stealing deque
inferredcites →https://doi.org/10.1145/1504176.1504186openalex-snapshot
Idempotent work stealing
inferredcites →https://doi.org/10.1145/1595696.1595701openalex-snapshot
Static data race detection for concurrent programs with asynchronous calls
inferredcites →https://doi.org/10.1145/1993316.1993521openalex-snapshot
Partial-coherence abstractions for relaxed memory models
inferredcites →https://doi.org/10.1145/1993316.1993522openalex-snapshot
A case for an SC-preserving compiler
inferredcites →https://doi.org/10.1145/1993498.1993521openalex-snapshot
Partial-coherence abstractions for relaxed memory models
inferredcites →https://doi.org/10.1145/1993498.1993522openalex-snapshot
A case for an SC-preserving compiler
inferredcites →https://doi.org/10.1145/2254064.2254115openalex-snapshot
Dynamic synthesis for relaxed memory models
inferredcites →https://doi.org/10.1145/2345156.2254115openalex-snapshot
Dynamic synthesis for relaxed memory models
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/2509136.2509514openalex-snapshot
CDSchecker
inferredcites →https://doi.org/10.1145/2627752openalex-snapshot
Herding Cats
inferredcites →https://doi.org/10.1145/2749469.2750378openalex-snapshot
ArMOR
inferredcites →https://doi.org/10.1145/277650.277725openalex-snapshot
The implementation of the Cilk-5 multithreaded language
inferredcites →https://doi.org/10.1145/2814270.2814318openalex-snapshot
Declarative fence insertion
inferredcites →https://doi.org/10.1145/2858965.2814318openalex-snapshot
Declarative fence insertion
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot
Solution of a problem in concurrent programming control
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/55364.55425openalex-snapshot
A simple solution to Lamport's concurrent programming problem with linear wait
inferredcites →https://doi.org/10.1145/7351.7352openalex-snapshot
A fast mutual exclusion algorithm
inferredcites →https://doi.org/10.1145/782814.782854openalex-snapshot
Automatic fence insertion for shared memory multiprocessing
inferredcites →https://doi.org/10.3403/30299932openalex-snapshot
Information technology. Programming languages. C++

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-030-63461-2_16openalex-snapshot
Lock and Fence When Needed: State Space Exploration + Static Analysis = Improved Fence and Lock Insertion
inferred← citeshttps://doi.org/10.1007/978-3-031-52183-6_11openalex-snapshot
Embedding Formal Verification in Model-Driven Software Engineering with Slco: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_3openalex-snapshot
Sufficient Conditions for Robustness of RDMA Programs
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103386openalex-snapshot
An overview of research with Slco on seamless integration of formal verification into model-driven software engineering
inferred← citeshttps://doi.org/10.1016/j.sysarc.2024.103187openalex-snapshot
WOPE: A write-optimized and parallel-efficient B + -tree for persistent memory
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00208openalex-snapshot
Automated Insertion of Flushes and Fences for Persistency
inferred← citeshttps://doi.org/10.1109/cgo57630.2024.10444836openalex-snapshot
Compiler Testing with Relaxed Memory Models
inferred← citeshttps://doi.org/10.1109/fccm.2018.00025openalex-snapshot
Concurrency-Aware Thread Scheduling for High-Level Synthesis
inferred← citeshttps://doi.org/10.1109/issre.2018.00028openalex-snapshot
Bugaroo: Exposing Memory Model Bugs in Many-Core Systems
inferred← citeshttps://doi.org/10.1109/qrs65678.2025.00036openalex-snapshot
Formal Verification of Preemptive Interrupt-Driven Programs Based on Partial Order Modeling
inferred← citeshttps://doi.org/10.1109/saner67736.2026.00113openalex-snapshot
Symbolic Analysis for Repairing Bugs in Concurrent Persistent-Memory Programs
inferred← citeshttps://doi.org/10.1109/tc.2020.3047972openalex-snapshot
Circ-Tree: A B+-Tree Variant With Circular Design for Persistent Memory
inferred← citeshttps://doi.org/10.1109/tvlsi.2020.3026112openalex-snapshot
Global Analysis of C Concurrency in High-Level Synthesis
inferred← citeshttps://doi.org/10.1145/3314221.3314604openalex-snapshot
Robustness against release/acquire semantics
inferred← citeshttps://doi.org/10.1145/3360561openalex-snapshot
Weak persistency semantics from the ground up: formalising the persistency semantics of ARMv8 and transactional models
inferred← citeshttps://doi.org/10.1145/3368826.3377910openalex-snapshot
Interactive debugging of concurrent programs under relaxed memory models
inferred← citeshttps://doi.org/10.1145/3434285openalex-snapshot
Verifying observational robustness against a c11-style memory model
inferred← citeshttps://doi.org/10.1145/3470496.3527412openalex-snapshot
Axiomatic hardware-software contracts for security
inferred← citeshttps://doi.org/10.1145/3470496.3533045openalex-snapshot
Mixed-proxy extensions for the NVIDIA PTX memory consistency model
inferred← citeshttps://doi.org/10.1145/3519939.3523719openalex-snapshot
Lasagne: a static binary translator for weak memory model architectures
inferred← citeshttps://doi.org/10.1145/3567955.3567962openalex-snapshot
Risotto: A Dynamic Binary Translator for Weak Memory Model Architectures
inferred← citeshttps://doi.org/10.1145/3597503.3639204openalex-snapshot
Constraint Based Program Repair for Persistent Memory Bugs
inferred← citeshttps://doi.org/10.1145/3622855openalex-snapshot
Static Analysis of Memory Models for SMT Encodings
inferred← citeshttps://doi.org/10.1145/3650212.3685549openalex-snapshot
Robustness against the C/C++11 Memory Model
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/3729277openalex-snapshot
Dynamic Robustness Verification against Weak Memory
inferred← citeshttps://doi.org/10.1145/3779212.3790127openalex-snapshot
Arancini: A Hybrid Binary Translator for Weak Memory Model Architectures
inferred← citeshttps://doi.org/10.1145/3832810.3832852openalex-snapshot
HGB+-Tree: An Hourglass-like B+-tree for Persistent Memory
inferred← citeshttps://doi.org/10.20944/preprints202305.0049.v1openalex-snapshot
Analysis of Concurrent Systems Based on Interval Order
inferred← citeshttps://doi.org/10.3384/9789180750011openalex-snapshot
Teaching and Learning Concurrent Programming in the Shared Memory Model
inferred← citeshttps://doi.org/10.48550/arxiv.2009.03846openalex-snapshot
On Architecture to Architecture Mapping for Concurrency
inferred← citeshttps://doi.org/10.70675/6f86083bz89aez4751zb868zc4ee47a9ccc8openalex-snapshot
Vérification par model-checking de programmes concurrents paramétrés sur des modèles mémoires faibles
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.