On the public citation graph
Optimal stateless model checking under the release-acquire semantics
0 signed · 113 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/3-540-53863-1_36openalex-snapshot
Stubborn sets for reduced state space generation
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-319-41540-6_8openalex-snapshot
Stateless Model Checking for POWER
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_12openalex-snapshot
Effective Program Verification for Relaxed Memory Models
inferredcites →https://doi.org/10.1007/978-3-540-70889-6_13openalex-snapshot
A Race-Detection and Flipping Algorithm for Automated Testing of Multi-threaded Programs
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-662-46669-8_13openalex-snapshot
The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for 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/s10009-009-0116-3openalex-snapshot
Haifa verification conference 2007
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.1109/acsd.2012.18openalex-snapshot
Improving Dynamic Partial Order Reductions for Concolic Testing
inferredcites →https://doi.org/10.1109/icst.2013.50openalex-snapshot
Systematic Testing for Detecting Concurrency Errors in Erlang Programs
inferredcites →https://doi.org/10.1109/ipps.1994.288305openalex-snapshot
Queue locks on cache coherent multiprocessors
inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot
Algorithms for scalable synchronization on shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/1040305.1040315openalex-snapshot
Dynamic partial-order reduction for model checking software
inferredcites →https://doi.org/10.1145/1706299.1706303openalex-snapshot
On the verification problem for weak memory models
inferredcites →https://doi.org/10.1145/1993316.1993520openalex-snapshot
Understanding POWER multiprocessors
inferredcites →https://doi.org/10.1145/1993316.1993521openalex-snapshot
Partial-coherence abstractions for relaxed memory models
inferredcites →https://doi.org/10.1145/1993498.1993520openalex-snapshot
Understanding POWER multiprocessors
inferredcites →https://doi.org/10.1145/1993498.1993521openalex-snapshot
Partial-coherence abstractions for relaxed memory models
inferredcites →https://doi.org/10.1145/2001420.2001436openalex-snapshot
Testing concurrent programs on relaxed memory models
inferredcites →https://doi.org/10.1145/2254064.2254115openalex-snapshot
Dynamic synthesis for relaxed memory models
inferredcites →https://doi.org/10.1145/2535838.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/2806886openalex-snapshot
A Practical Approach for Model Checking C/C++11 Code
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/2837614.2837643openalex-snapshot
Taming release-acquire consistency
inferredcites →https://doi.org/10.1145/2983990.2984025openalex-snapshot
Maximal causality reduction for TSO and PSO
inferredcites →https://doi.org/10.1145/3092282.3092287openalex-snapshot
Stateless model checking of the Linux kernel's hierarchical read-copy-update (tree RCU)
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/42190.42277openalex-snapshot
Efficient and correct execution of parallel programs that share memory
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/lipics.concur.2015.456openalex-snapshot
Unfolding-based Partial Order Reduction
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-00244-2openalex-snapshot
Formal Methods for Industrial Critical Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-31277-0_1openalex-snapshot
Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial)
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_1openalex-snapshot
The Decidability of Verification under PS 2.0
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_16openalex-snapshot
Stateless Model Checking Under a Reads-Value-From Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_20openalex-snapshot
GenMC: A Model Checker for Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-030-88806-0_19openalex-snapshot
Thread-Modular Analysis of Release-Acquire Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-030-91014-3_16openalex-snapshot
BAM: Efficient Model Checking for Barriers
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-031-19992-9_6openalex-snapshot
Fence Synthesis Under the C11 Memory Model
inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_7openalex-snapshot
A Pragmatic Approach to Stateful Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_5openalex-snapshot
Reconciling Preemption Bounding with DPOR
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_6openalex-snapshot
Optimal Stateless Model Checking for Causal Consistency
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_12openalex-snapshot
Unblocking Dynamic Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-031-56222-8_7openalex-snapshot
On Verifying Concurrent Programs Under Weak Consistency Models: Decidability and Complexity
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-57256-2_12openalex-snapshot
Decidable Verification under Localized Release-Acquire Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-65630-9_2openalex-snapshot
Parsimonious Optimal Dynamic Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-031-78709-6_9openalex-snapshot
Dynamic Partial Order Reduction for Transactional Programs on Serializable Platforms
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-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-11176-0_8openalex-snapshot
Verification of the Release-Acquire Semantics
inferred← citeshttps://doi.org/10.1007/978-981-95-3585-9_9openalex-snapshot
Checking Consistency of Event-Driven Traces
inferred← citeshttps://doi.org/10.1016/j.jss.2023.111730openalex-snapshot
Optimal dynamic partial order reduction with context-sensitive independence and observers
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom51426.2020.00168openalex-snapshot
A Heuristic Region-based Concurrency Bug Testing Approach
inferred← citeshttps://doi.org/10.1109/issre62328.2024.00061openalex-snapshot
Understanding Atomics and Memory Ordering Issues in Real-World Rust Software
inferred← citeshttps://doi.org/10.1109/tase52547.2021.00023openalex-snapshot
Dynamic Verification of C11 Concurrency over Multi Copy Atomics
inferred← citeshttps://doi.org/10.1145/3290381openalex-snapshot
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models
inferred← citeshttps://doi.org/10.1145/3293883.3295702openalex-snapshot
Verifying C11 programs operationally
inferred← citeshttps://doi.org/10.1145/3314221.3314604openalex-snapshot
Robustness against release/acquire semantics
inferred← citeshttps://doi.org/10.1145/3314221.3314609openalex-snapshot
Model checking for weakly consistent libraries
inferred← citeshttps://doi.org/10.1145/3314221.3314649openalex-snapshot
Verification of programs under the release-acquire semantics
inferred← citeshttps://doi.org/10.1145/3326938.3326942openalex-snapshot
Verification under causally consistent shared memory
inferred← citeshttps://doi.org/10.1145/3340672.3341117openalex-snapshot
Towards deductive verification of C11 programs with Event-B and ProB
inferred← citeshttps://doi.org/10.1145/3358238openalex-snapshot
Will My Program Break on This Faulty Processor?
inferred← citeshttps://doi.org/10.1145/3360576openalex-snapshot
Optimal stateless model checking for reads-from equivalence under sequential consistency
inferred← citeshttps://doi.org/10.1145/3360599openalex-snapshot
Effective lock handling in stateless model checking
inferred← citeshttps://doi.org/10.1145/3368826.3377910openalex-snapshot
Interactive debugging of concurrent programs under relaxed memory models
inferred← citeshttps://doi.org/10.1145/3385412.3385966openalex-snapshot
Decidable verification under a causally consistent shared memory
inferred← citeshttps://doi.org/10.1145/3434337openalex-snapshot
Deciding reachability under persistent x86-TSO
inferred← citeshttps://doi.org/10.1145/3445814.3446711openalex-snapshot
C11Tester: a race detector for C/C++ atomics
inferred← citeshttps://doi.org/10.1145/3445814.3446735openalex-snapshot
Jaaru: efficiently model checking persistent memory programs
inferred← citeshttps://doi.org/10.1145/3445814.3446748openalex-snapshot
VSync: push-button verification and optimization for synchronization primitives on weak memory models
inferred← citeshttps://doi.org/10.1145/3453483.3454082openalex-snapshot
Modular data-race-freedom guarantees in the promising semantics
inferred← citeshttps://doi.org/10.1145/3485541openalex-snapshot
The reads-from equivalence for the TSO and PSO memory models
inferred← citeshttps://doi.org/10.1145/3498711openalex-snapshot
Truly stateless, optimal dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/3505273openalex-snapshot
What’s Decidable About Causally Consistent Shared Memory?
inferred← citeshttps://doi.org/10.1145/3545117openalex-snapshot
Unifying Operational Weak Memory Verification: An Axiomatic Approach
inferred← citeshttps://doi.org/10.1145/3563315openalex-snapshot
Model checking for a multi-execution memory model
inferred← citeshttps://doi.org/10.1145/3591243openalex-snapshot
Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels
inferred← citeshttps://doi.org/10.1145/3591251openalex-snapshot
Optimal Reads-From Consistency Checking for C11-Style Memory Models
inferred← citeshttps://doi.org/10.1145/3641399.3641443openalex-snapshot
Parameterized Static Analysis for Weak Memory Models
inferred← citeshttps://doi.org/10.1145/3656449openalex-snapshot
SPORE: Combining Symmetry and Partial Order Reduction
inferred← citeshttps://doi.org/10.1145/3763123openalex-snapshot
Efficient Decrease-and-Conquer Linearizability Monitoring
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.1145/3830418.3843871openalex-snapshot
LMTracer: Fine-Grained and Real-Time Performance Profiling for Production LLM Systems
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d26openalex-snapshot
The Decidability of Verification under PS 2.0
inferred← citeshttps://doi.org/10.3390/computers14030110openalex-snapshot
A Novel Approach to Efficiently Verify Sequential Consistency in Concurrent Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1905.03957openalex-snapshot
Dynamic Verification with Observational Equivalence of C/C++ Concurrency
inferred← citeshttps://doi.org/10.48550/arxiv.2007.09944openalex-snapshot
The Decidability of Verification under Promising 2.0
inferred← citeshttps://doi.org/10.48550/arxiv.2010.13593openalex-snapshot
Taming x86-TSO Persistency (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2102.07901openalex-snapshot
C11Tester: A Race Detector for C/C++ Atomics Technical Report
inferred← citeshttps://doi.org/10.48550/arxiv.2103.01553openalex-snapshot
Dynamic Verification of C/C++11 Concurrency over Multi Copy Atomics
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.