On the public citation graph
Sound Dynamic Deadlock Prediction in Linear Time
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.
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/10722468_15openalex-snapshot
Using Runtime Analysis to Guide Model Checking of Java Programs
inferredcites →https://doi.org/10.1007/11494881_14openalex-snapshot
Detecting Errors in Multithreaded Programs by Generalized Predictive Analysis of Executions
inferredcites →https://doi.org/10.1007/11678779_14openalex-snapshot
Detecting Potential Deadlocks with Static Analysis and Run-Time Monitoring
inferredcites →https://doi.org/10.1007/11678779_15openalex-snapshot
Dynamic Deadlock Analysis of Multi-threaded Programs
inferredcites →https://doi.org/10.1007/978-3-319-23404-5_13openalex-snapshot
PickLock: A Deadlock Prediction Approach under Nested Locking
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-20398-5_23openalex-snapshot
Generating Data Race Witnesses by an SMT-Based Analysis
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/s10664-005-3861-2openalex-snapshot
Supporting Controlled Experimentation with Testing Techniques: An Infrastructure and its Potential Impact
inferredcites →https://doi.org/10.1016/j.jcss.2006.04.007openalex-snapshot
Strong computational lower bounds via parameterized complexity
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.023openalex-snapshot
A new algorithm for optimal 2-constraint satisfaction and its implications
inferredcites →https://doi.org/10.1109/2.84874openalex-snapshot
Logical time in distributed computing systems
inferredcites →https://doi.org/10.1109/ase.2017.8115684openalex-snapshot
UNDEAD: Detecting and preventing deadlocks in production software
inferredcites →https://doi.org/10.1109/icse.2009.5070538openalex-snapshot
Effective static deadlock detection
inferredcites →https://doi.org/10.1109/icse.2012.6227156openalex-snapshot
MagicFuzzer: Scalable deadlock detection for large-scale applications
inferredcites →https://doi.org/10.1109/ipdps.2003.1213511openalex-snapshot
Concurrent bug patterns and how to test them
inferredcites →https://doi.org/10.1109/tse.2014.2301725openalex-snapshot
Magiclock: Scalable Detection of Potential Deadlocks in Large-Scale Multithreaded Programs
inferredcites →https://doi.org/10.1137/0204007openalex-snapshot
Finding All the Elementary Circuits of a Directed Graph
inferredcites →https://doi.org/10.1142/9789813272880_0188openalex-snapshot
ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
inferredcites →https://doi.org/10.1145/1147403.1147412openalex-snapshot
Confirmation of deadlock potentials detected by runtime analysis
inferredcites →https://doi.org/10.1145/1542476.1542489openalex-snapshot
A randomized dynamic program analysis technique for detecting real deadlocks
inferredcites →https://doi.org/10.1145/1882291.1882339openalex-snapshot
An effective dynamic analysis for detecting generalized deadlocks
inferredcites →https://doi.org/10.1145/2103656.2103702openalex-snapshot
Sound predictive race detection in polynomial time
inferredcites →https://doi.org/10.1145/2555243.2555262openalex-snapshot
Trace driven dynamic deadlock detection and reproduction
inferredcites →https://doi.org/10.1145/2594291.2594315openalex-snapshot
Maximal sound predictive race detection with control flow abstraction
inferredcites →https://doi.org/10.1145/2635868.2635918openalex-snapshot
Sherlock: scalable deadlock detection for concurrent programs
inferredcites →https://doi.org/10.1145/2660193.2660238openalex-snapshot
Multithreaded test synthesis for deadlock detection
inferredcites →https://doi.org/10.1145/2892208.2892232openalex-snapshot
Static deadlock detection for concurrent go by global session graph synthesis
inferredcites →https://doi.org/10.1145/3062341.3062350openalex-snapshot
BigFoot: static check placement for dynamic race detection
inferredcites →https://doi.org/10.1145/3062341.3062374openalex-snapshot
Dynamic race prediction in linear time
inferredcites →https://doi.org/10.1145/3297858.3304069openalex-snapshot
Understanding Real-World Concurrency Bugs in Go
inferredcites →https://doi.org/10.1145/3360605openalex-snapshot
Dependence-aware, unbounded sound predictive race detection
inferredcites →https://doi.org/10.1145/3371085openalex-snapshot
Fast, sound, and effectively complete dynamic race prediction
inferredcites →https://doi.org/10.1145/3373376.3378475openalex-snapshot
Atomicity Checking in Linear Time using Vector Clocks
inferredcites →https://doi.org/10.1145/3373718.3394783openalex-snapshot
The Complexity of Dynamic Data Race Prediction
inferredcites →https://doi.org/10.1145/3377811.3380367openalex-snapshot
Low-overhead deadlock 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/3453483.3454073openalex-snapshot
When threads meet events: efficient and precise static race detection with origins
inferredcites →https://doi.org/10.1145/3468264.3468549openalex-snapshot
Sound and efficient concurrency bug prediction
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/582034.582042openalex-snapshot
A parallel java grande benchmark suite
inferredcites →https://doi.org/10.1145/781498.781529openalex-snapshot
Efficient on-the-fly data race detection in multithreaded C++ programs
inferredcites →https://doi.org/10.4230/lipics.concur.2021.16openalex-snapshot
Dynamic Data-Race Detection Through the Fine-Grained Lens
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-65630-9_9openalex-snapshot
Predictive Monitoring with Strong Trace Prefixes
inferred← citeshttps://doi.org/10.1016/j.jss.2025.112473openalex-snapshot
VeriFix: Verifying your fix towards an atomicity violation
inferred← citeshttps://doi.org/10.1109/access.2024.3384489openalex-snapshot
Petri Net Unfolding-Based Detection and Replay of Program Deadlocks
inferred← citeshttps://doi.org/10.1145/3597503.3639099openalex-snapshot
Optimistic Prediction of Synchronization-Reversal Data Races
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/3632873openalex-snapshot
Coarser Equivalences for Causal Concurrency
inferred← citeshttps://doi.org/10.1145/3632915openalex-snapshot
Predictive Monitoring against Pattern Regular Languages
inferred← citeshttps://doi.org/10.1145/3656391openalex-snapshot
IsoPredict: Dynamic Predictive Analysis for Detecting Unserializable Behaviors in Weakly Isolated Data Store Applications
inferred← citeshttps://doi.org/10.1145/3669940.3707214openalex-snapshot
Selectively Uniform Concurrency Testing
inferred← citeshttps://doi.org/10.1145/3720435openalex-snapshot
Soundness of Predictive Concurrency Analyses
inferred← citeshttps://doi.org/10.1145/3729252openalex-snapshot
Efficient Timestamping for Sampling-Based Race Detection
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/3832278openalex-snapshot
Efficient Predictive Monitoring of Message Passing Interface Programs
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.