On the public citation graph

Effective lock handling in stateless model checking

https://doi.org/10.1145/3360599
0 signed · 47 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-17906-2_30openalex-snapshot
Trace theory
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-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-03359-9_27openalex-snapshot
A Better x86 Memory Model: x86-TSO
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_9openalex-snapshot
Partial Orders for Efficient Bounded Model Checking of Concurrent Software
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/978-3-662-47666-6_25openalex-snapshot
Owicki-Gries Reasoning for Weak Memory Models
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/1040305.1040315openalex-snapshot
Dynamic partial-order reduction for model checking software
inferredcites →https://doi.org/10.1145/1926385.1926394openalex-snapshot
Mathematizing C++ concurrency
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/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/2983990.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/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/3192366.3192385openalex-snapshot
High-coverage, unbounded sound predictive race detection
inferredcites →https://doi.org/10.1145/322154.322158openalex-snapshot
The serializability of concurrent database updates
inferredcites →https://doi.org/10.1145/3276505openalex-snapshot
Optimal stateless model checking under the release-acquire semantics
inferredcites →https://doi.org/10.1145/3314221.3314609openalex-snapshot
Model checking for weakly consistent libraries
inferredcites →https://doi.org/10.1145/42190.42277openalex-snapshot
Efficient and correct execution of parallel programs that share memory
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-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-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-30820-8_26openalex-snapshot
Industrial-Strength Controlled Concurrency Testing for $$\textsc {C}{} \texttt {\#} $$ Programs with $$\textsc {Coyote} $$
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-45332-8_9openalex-snapshot
Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs
inferred← citeshttps://doi.org/10.1007/s11704-020-9501-6openalex-snapshot
On interleaving space exploration of multi-threaded programs
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/qrs54544.2021.00033openalex-snapshot
HARS: Heuristic-Enhanced Adaptive Randomized Scheduling for Concurrency Testing
inferred← citeshttps://doi.org/10.1145/3371079openalex-snapshot
Persistency semantics of the Intel-x86 architecture
inferred← citeshttps://doi.org/10.1145/3428219openalex-snapshot
Persistent Owicki-Gries reasoning: a program logic for reasoning about persistent programs on Intel-x86
inferred← citeshttps://doi.org/10.1145/3434337openalex-snapshot
Deciding reachability under persistent x86-TSO
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/3485541openalex-snapshot
The reads-from equivalence for the TSO and PSO memory models
inferred← citeshttps://doi.org/10.1145/3498683openalex-snapshot
Extending Intel-x86 consistency and persistency: formalising the semantics of Intel-x86 memory types and non-temporal stores
inferred← citeshttps://doi.org/10.1145/3575693.3579849openalex-snapshot
AtoMig: Automatically Migrating Millions Lines of Code from TSO to WMM
inferred← citeshttps://doi.org/10.1145/3656449openalex-snapshot
SPORE: Combining Symmetry and Partial Order Reduction
inferred← citeshttps://doi.org/10.1145/3704911openalex-snapshot
Model Checking C/C++ with Mixed-Size Accesses
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.