On the public citation graph

Value-centric dynamic partial order reduction

0 signed · 60 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-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/978-3-319-89960-2openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferredcites →https://doi.org/10.1007/978-3-319-96142-2_22openalex-snapshot
Quasi-Optimal Partial Order Reduction
inferredcites →https://doi.org/10.1007/978-3-642-00768-2_14openalex-snapshot
The Complexity of Predicting Atomicity Violations
inferredcites →https://doi.org/10.1007/978-3-642-12029-9_22openalex-snapshot
Evaluating Ordering Heuristics for Dynamic Partial-Order Reduction Techniques
inferredcites →https://doi.org/10.1007/978-3-642-30793-5_14openalex-snapshot
TransDPOR: A Novel Dynamic Partial-Order Reduction Technique for Testing Actor Programs
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/bf00288966openalex-snapshot
Arbitration without common modifiable variables
inferredcites →https://doi.org/10.1007/bf01384077openalex-snapshot
State-space caching revisited
inferredcites →https://doi.org/10.1007/bf01384314openalex-snapshot
A technique of state space search based on unfolding
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.1007/s10703-009-0078-9openalex-snapshot
Reducing concurrent analysis under a context bound to sequential analysis
inferredcites →https://doi.org/10.1016/0020-0190(81)90106-xopenalex-snapshot
Myths about the mutual exclusion problem
inferredcites →https://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferredcites →https://doi.org/10.1109/acsd.2012.18openalex-snapshot
Improving Dynamic Partial Order Reductions for Concolic Testing
inferredcites →https://doi.org/10.1109/swat.1973.14openalex-snapshot
Mechanizable proofs about parallel processes
inferredcites →https://doi.org/10.1145/1040305.1040315openalex-snapshot
Dynamic partial-order reduction for model checking software
inferredcites →https://doi.org/10.1145/1273442.1250785openalex-snapshot
Iterative context bounding for systematic testing of multithreaded programs
inferredcites →https://doi.org/10.1145/2103656.2103693openalex-snapshot
Verification of parameterized concurrent programs by modular reasoning about data and control
inferredcites →https://doi.org/10.1145/2351676.2351698openalex-snapshot
Using unfoldings in automated testing of multithreaded programs
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.2737975openalex-snapshot
Stateless model checking concurrent programs with maximal causality reduction
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/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/3360550openalex-snapshot
Value-centric dynamic partial order reduction
inferredcites →https://doi.org/10.1145/355592.365595openalex-snapshot
Additional comments on a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/361227.361234openalex-snapshot
Reduction
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
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/800105.803398openalex-snapshot
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
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-030-59152-6_21openalex-snapshot
Parallel Graph-Based Stateless Model Checking
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-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-30823-9_5openalex-snapshot
Reconciling Preemption Bounding with DPOR
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-57249-4_4openalex-snapshot
Enhancing GenMC’s Usability and Performance
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/s10703-020-00350-4openalex-snapshot
Quasi-optimal partial order reduction
inferred← citeshttps://doi.org/10.1109/trustcom50675.2020.00187openalex-snapshot
CPN Model Checking Method of Concurrent Software Based on State Space Pruning
inferred← citeshttps://doi.org/10.1145/3445814.3446735openalex-snapshot
Jaaru: efficiently model checking persistent memory programs
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/3531130.3533343openalex-snapshot
Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
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/3632873openalex-snapshot
Coarser Equivalences for Causal Concurrency
inferred← citeshttps://doi.org/10.1145/3632908openalex-snapshot
How Hard Is Weak-Memory Testing?
inferred← citeshttps://doi.org/10.1145/3656449openalex-snapshot
SPORE: Combining Symmetry and Partial Order Reduction
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.3390/sym15091775openalex-snapshot
Depth-First Net Unfoldings and Equivalent Reduction
showing the first 22 of 23 · page through all 23
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.