On the public citation graph
Source Sets
0 signed · 85 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/11693017_25openalex-snapshot
Automated Systematic Testing of Open Distributed Programs
inferredcites →https://doi.org/10.1007/3-540-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
inferredcites →https://doi.org/10.1007/3-540-17906-2openalex-snapshot
Petri Nets: Applications and Relationships to Other Models of Concurrency
inferredcites →https://doi.org/10.1007/3-540-36577-x_40openalex-snapshot
Generalized Symbolic Execution for Model Checking and Testing
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-56922-7_36openalex-snapshot
Refining dependencies improves partial-order verification methods (extended abstract)
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-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-540-85361-9_21openalex-snapshot
Dynamic Partial Order Reduction Using Probe Sets
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-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-35632-2_16openalex-snapshot
Maximal Causal Models for Sequentially Consistent Systems
inferredcites →https://doi.org/10.1007/978-3-642-40447-4_19openalex-snapshot
On Using Erlang for Parallelization
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/bf01383879openalex-snapshot
Using partial orders for the efficient verification of deadlock freedom and safety properties
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.1016/0004-3702(96)00007-0openalex-snapshot
Artificial intelligence: A modern approach
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/icst.2013.50openalex-snapshot
Systematic Testing for Detecting Concurrency Errors in Erlang Programs
inferredcites →https://doi.org/10.1109/tse.2006.56openalex-snapshot
Reachability testing of concurrent programs
inferredcites →https://doi.org/10.1145/1040305.1040315openalex-snapshot
Dynamic partial-order reduction for model checking software
inferredcites →https://doi.org/10.1145/1047659.1040315openalex-snapshot
Dynamic partial-order reduction for model checking software
inferredcites →https://doi.org/10.1145/1250734.1250785openalex-snapshot
Iterative context bounding for systematic testing of multithreaded programs
inferredcites →https://doi.org/10.1145/2351676.2351698openalex-snapshot
Using unfoldings in automated testing of multithreaded programs
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/3092282.3092287openalex-snapshot
Stateless model checking of the Linux kernel's hierarchical read-copy-update (tree RCU)
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.4230/lipics.concur.2015.456openalex-snapshot
Unfolding-based Partial Order Reduction
inferredcites →https://doi.org/10.5860/choice.33-1577openalex-snapshot
Artificial intelligence: a modern approach
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-11245-5_21openalex-snapshot
Syntactic Partial Order Compression for Probabilistic Reachability
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_11openalex-snapshot
Automated Hypersafety Verification
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-59152-6_21openalex-snapshot
Parallel Graph-Based Stateless Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-98869-2_9openalex-snapshot
Prefix-Based Tracing in Message-Passing Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-08679-3_12openalex-snapshot
Computing Race Variants in Message-Passing Concurrent Programming with Selective Receives
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-37706-8_10openalex-snapshot
Overcoming Memory Weakness with Unified Fairness
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/978-3-031-56222-8_1openalex-snapshot
Fairness and Liveness Under Weak Consistency
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-73751-0_8openalex-snapshot
Trading Space for Simplicity in Stateless Model Checking
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-95497-9_8openalex-snapshot
Towards Efficient Verification of Parallel Applications with Mc SimGrid
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-06847-7_9openalex-snapshot
On-the-Fly Cone-of-Influence Reduction for Model Checking Concurrent Software
inferred← citeshttps://doi.org/10.1007/978-3-319-89963-3_14openalex-snapshot
Optimal Dynamic Partial Order Reduction with Observers
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_22openalex-snapshot
Quasi-Optimal Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_24openalex-snapshot
Constrained Dynamic Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_17openalex-snapshot
Efficiently Adapting Stateless Model Checking for C11/C++11 to Mixed-Size Accesses
inferred← citeshttps://doi.org/10.1007/s10009-019-00514-6openalex-snapshot
Stateless model checking of the Linux kernel’s read–copy update (RCU)
inferred← citeshttps://doi.org/10.1007/s10703-020-00350-4openalex-snapshot
Quasi-optimal partial order reduction
inferred← citeshttps://doi.org/10.1007/s10703-025-00479-0openalex-snapshot
Awaiting for Godot : stateless model checking that avoids executions where nothing happens
inferred← citeshttps://doi.org/10.1007/s11334-020-00358-3openalex-snapshot
Exploiting local persistency for reduced state-space generation
inferred← citeshttps://doi.org/10.1145/3158105openalex-snapshot
Effective stateless model checking for C/C++ concurrency
inferred← citeshttps://doi.org/10.1145/3239332.3242764openalex-snapshot
Modelling distributed Erlang within a single node
inferred← citeshttps://doi.org/10.1145/3293882.3330565openalex-snapshot
Optimal context-sensitive dynamic partial order reduction with observers
inferred← citeshttps://doi.org/10.1145/3293882.3338987openalex-snapshot
Conditional dynamic partial order reduction and optimality results
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/3360606openalex-snapshot
Trace aware random testing for distributed systems
inferred← citeshttps://doi.org/10.1145/3498538openalex-snapshot
BiRD: Race Detection in Software Binaries under Relaxed 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/3656449openalex-snapshot
SPORE: Combining Symmetry and Partial Order Reduction
inferred← citeshttps://doi.org/10.1145/3831368openalex-snapshot
Node-Centric Systematic Testing for Distributed Systems
inferred← citeshttps://doi.org/10.22152/programming-journal.org/2024/8/1openalex-snapshot
McMini: A Programmable DPOR-Based Model Checker for Multithreaded Programs
inferred← citeshttps://doi.org/10.3390/sym15091775openalex-snapshot
Depth-First Net Unfoldings and Equivalent Reduction
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.1905.09242openalex-snapshot
Reductions for Automated Hypersafety Verification
inferred← citeshttps://doi.org/10.48550/arxiv.1910.14619openalex-snapshot
Reductions for Safety Proofs (Extended Version)
inferred← citeshttps://doi.org/10.54337/aau429765826openalex-snapshot
Time For Stubborn Game Reductions
inferred← citeshttps://doi.org/10.70675/f5fc5032zc27dz4fffza3cbzd9a01566f10dopenalex-snapshot
Partial order reduction for timed systems
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.