On the public citation graph

The reads-from equivalence for the TSO and PSO memory models

https://doi.org/10.1145/3485541
0 signed · 70 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/3-540-56922-7_34openalex-snapshot
All from one, one for all: on model checking using representatives
inferredcites →https://doi.org/10.1007/3-540-60761-7openalex-snapshot
Partial-Order Methods for the Verification of Concurrent Systems
inferredcites →https://doi.org/10.1007/978-3-030-25543-5_16openalex-snapshot
Gradual Consistency Checking
inferredcites →https://doi.org/10.1007/978-3-030-59152-6_21openalex-snapshot
Parallel Graph-Based Stateless Model Checking
inferredcites →https://doi.org/10.1007/978-3-319-63387-9_26openalex-snapshot
Context-Sensitive Dynamic Partial Order Reduction
inferredcites →https://doi.org/10.1007/978-3-319-89963-3_14openalex-snapshot
Optimal Dynamic Partial Order Reduction with Observers
inferredcites →https://doi.org/10.1007/978-3-319-96142-2_24openalex-snapshot
Constrained Dynamic Partial Order Reduction
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_31openalex-snapshot
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
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_34openalex-snapshot
Deciding Robustness against Total Store Ordering
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-46681-0_28openalex-snapshot
Stateless Model Checking for TSO and PSO
inferredcites →https://doi.org/10.1007/s100090050035openalex-snapshot
State space reduction using partial order techniques
inferredcites →https://doi.org/10.1007/s10703-005-1489-xopenalex-snapshot
Software Model Checking: The VeriSoft Approach
inferredcites →https://doi.org/10.1016/j.jcss.2006.04.007openalex-snapshot
Strong computational lower bounds via parameterized complexity
inferredcites →https://doi.org/10.1109/2.546611openalex-snapshot
Shared memory consistency models: a tutorial
inferredcites →https://doi.org/10.1109/hpca.2006.1598123openalex-snapshot
Completely Verifying Memory Consistency of Test Program Executions
inferredcites →https://doi.org/10.1109/hpca.2009.4798276openalex-snapshot
Fast complete memory consistency verification
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/tc.2011.41openalex-snapshot
Linear Time Memory Consistency Verification
inferredcites →https://doi.org/10.1137/s0097539794279614openalex-snapshot
Testing Shared Memories
inferredcites →https://doi.org/10.1145/1040305.1040315openalex-snapshot
Dynamic partial-order reduction for model checking software
inferredcites →https://doi.org/10.1145/1785414.1785443openalex-snapshot
x86-TSO
inferredcites →https://doi.org/10.1145/2103621.2103702openalex-snapshot
Sound predictive race detection in polynomial time
inferredcites →https://doi.org/10.1145/2103656.2103702openalex-snapshot
Sound predictive race detection in polynomial time
inferredcites →https://doi.org/10.1145/2509136.2509514openalex-snapshot
CDSchecker
inferredcites →https://doi.org/10.1145/2578855.2535845openalex-snapshot
Optimal dynamic partial order reduction
inferredcites →https://doi.org/10.1145/263699.263717openalex-snapshot
Model checking for programming languages using VeriSoft
inferredcites →https://doi.org/10.1145/2737924.2737956openalex-snapshot
Dynamic partial order reduction for relaxed memory models
inferredcites →https://doi.org/10.1145/2737924.2737975openalex-snapshot
Stateless model checking concurrent programs with maximal causality reduction
inferredcites →https://doi.org/10.1145/2753761openalex-snapshot
Memory-Model-Aware Testing
inferredcites →https://doi.org/10.1145/2814270.2814297openalex-snapshot
SATCheck: SAT-directed stateless model checking for SC and TSO
inferredcites →https://doi.org/10.1145/3022671.2984025openalex-snapshot
Maximal causality reduction for TSO and PSO
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3062341.3062374openalex-snapshot
Dynamic race prediction in linear time
inferredcites →https://doi.org/10.1145/3140587.3062374openalex-snapshot
Dynamic race prediction in linear time
inferredcites →https://doi.org/10.1145/3158105openalex-snapshot
Effective stateless model checking for C/C++ concurrency
inferredcites →https://doi.org/10.1145/3158119openalex-snapshot
Data-centric dynamic partial order reduction
inferredcites →https://doi.org/10.1145/3276505openalex-snapshot
Optimal stateless model checking under the release-acquire semantics
inferredcites →https://doi.org/10.1145/3290382openalex-snapshot
Bridging the gap between programming languages and hardware weak memory models
inferredcites →https://doi.org/10.1145/3314221.3314609openalex-snapshot
Model checking for weakly consistent libraries
inferredcites →https://doi.org/10.1145/3360550openalex-snapshot
Value-centric dynamic partial order reduction
inferredcites →https://doi.org/10.1145/3360576openalex-snapshot
Optimal stateless model checking for reads-from equivalence under sequential consistency
inferredcites →https://doi.org/10.1145/3360591openalex-snapshot
On the complexity of checking transactional consistency
inferredcites →https://doi.org/10.1145/3360599openalex-snapshot
Effective lock handling in stateless model checking
inferredcites →https://doi.org/10.1145/3371085openalex-snapshot
Fast, sound, and effectively complete dynamic race prediction
inferredcites →https://doi.org/10.1145/3373376.3378480openalex-snapshot
HMC
inferredcites →https://doi.org/10.1145/3373718.3394783openalex-snapshot
The Complexity of Dynamic Data Race Prediction
inferredcites →https://doi.org/10.1145/3385412.3385993openalex-snapshot
SmartTrack: efficient predictive race detection
inferredcites →https://doi.org/10.1145/3434317openalex-snapshot
Optimal prediction of synchronization-preserving races
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/564870.564897openalex-snapshot
Verifying sequential consistency using vector clocks
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.15479/at:ist-2017-872-v1-1openalex-snapshot
Data-centric Dynamic Partial Order Reduction
inferredcites →https://doi.org/10.4230/dagrep.6.11.108openalex-snapshot
Concurrency with Weak Memory Models (Dagstuhl Seminar 16471)
inferredcites →https://doi.org/10.4230/lipics.concur.2015.456openalex-snapshot
Unfolding-based Partial Order Reduction
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.16openalex-snapshot
Speeding Up Maximal Causality Reduction with Static Dependency Analysis

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-57249-4_4openalex-snapshot
Enhancing GenMC’s Usability and Performance
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_17openalex-snapshot
$$\textsf{GPUMC}$$: A Stateless Model Checker for GPU Weak Memory Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_12openalex-snapshot
Complexity of Consistency Testing for the Release-Acquire Semantics
inferred← citeshttps://doi.org/10.1109/compsac61105.2024.00348openalex-snapshot
Trace and Algebraic Semantics for Partial Store Order Memory Model
inferred← citeshttps://doi.org/10.1145/3498711openalex-snapshot
Truly stateless, optimal dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/3591251openalex-snapshot
Optimal Reads-From Consistency Checking for C11-Style Memory Models
inferred← citeshttps://doi.org/10.1145/3620666.3651358openalex-snapshot
CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis
inferred← citeshttps://doi.org/10.1145/3632908openalex-snapshot
How Hard Is Weak-Memory Testing?
inferred← citeshttps://doi.org/10.1145/3704906openalex-snapshot
RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency
inferred← citeshttps://doi.org/10.1145/3742465openalex-snapshot
AWDIT: An Optimal Weak Database Isolation Tester
inferred← citeshttps://doi.org/10.1145/3776643openalex-snapshot
The Complexity of Testing Message-Passing Concurrency
inferred← citeshttps://doi.org/10.1145/3779212.3790150openalex-snapshot
CXLMC: Model Checking CXL Shared Memory Programs
inferred← citeshttps://doi.org/10.20944/preprints202305.0049.v1openalex-snapshot
Analysis of Concurrent Systems Based on Interval Order
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.