On the public citation graph

Reasoning About Threads Communicating via Locks

0 signed · 132 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-44450-5_10openalex-snapshot
Model Checking CTL Properties of Pushdown Systems
inferredcites →https://doi.org/10.1007/3-540-49727-7_22openalex-snapshot
Program Analysis as Model Checking of Abstract Interpretations
inferredcites →https://doi.org/10.1007/3-540-63141-0openalex-snapshot
CONCUR '97: Concurrency Theory
inferredcites →https://doi.org/10.1007/3-540-63141-0_10openalex-snapshot
Reachability analysis of pushdown automata: Application to model-checking
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_7openalex-snapshot
Context-Bounded Model Checking of Concurrent Software
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_27openalex-snapshot
Thread-Modular Abstraction Refinement
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/s10009-002-0077-2openalex-snapshot
inferredcites →https://doi.org/10.1016/j.tcs.2008.03.013openalex-snapshot
Efficient SAT-based bounded model checking for software verification
inferredcites →https://doi.org/10.1023/a:1022920129859openalex-snapshot
Model Checking Programs
inferredcites →https://doi.org/10.1145/193173.195295openalex-snapshot
Data flow analysis for verifying properties of concurrent programs
inferredcites →https://doi.org/10.1145/199448.199462openalex-snapshot
Precise interprocedural dataflow analysis via graph reachability
inferredcites →https://doi.org/10.1145/263699.263717openalex-snapshot
Model checking for programming languages using VeriSoft
inferredcites →https://doi.org/10.1145/349214.349241openalex-snapshot
Context-sensitive synchronization-sensitive analysis is undecidable
inferredcites →https://doi.org/10.1145/604131.604137openalex-snapshot
A generic approach to the static analysis of concurrent programs with procedures
inferredcites →https://doi.org/10.1145/964001.964022openalex-snapshot
Summarizing procedures in concurrent programs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11691372_22openalex-snapshot
Verifying Concurrent Message-Passing C Programs with Recursive Calls
inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_16openalex-snapshot
Model Checking Dynamic Pushdown Networks with Locks and Priorities
inferred← citeshttps://doi.org/10.1007/978-3-030-88806-0_18openalex-snapshot
Improving Thread-Modular Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-031-01719-3_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_3openalex-snapshot
Model Checking Dynamic Pushdown Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-23404-5_13openalex-snapshot
PickLock: A Deadlock Prediction Approach under Nested Locking
inferred← citeshttps://doi.org/10.1007/978-3-319-47958-3_18openalex-snapshot
Verification of Higher-Order Concurrent Programs with Dynamic Resource Creation
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_2openalex-snapshot
Verifying Parametric Thread Creation
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_23openalex-snapshot
Reachability for Dynamic Parametric Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-53946-1_9openalex-snapshot
Parameterised Verification of Stabilisation Properties via Conditional Spotlight Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_9openalex-snapshot
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-68167-2_15openalex-snapshot
Dealing with Priorities and Locks for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-94460-9_5openalex-snapshot
CARET Analysis of Multithreaded Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_14openalex-snapshot
Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_19openalex-snapshot
Language Strength Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_10openalex-snapshot
Causal Dataflow Analysis for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_26openalex-snapshot
Fast and Accurate Static Data-Race Detection for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_19openalex-snapshot
Symbolic Context-Bounded Analysis of Multithreaded Java Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_29openalex-snapshot
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_27openalex-snapshot
Games on Multi-stack Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_2openalex-snapshot
Model Checking Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_9openalex-snapshot
An Abort-Aware Model of Transactional Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_14openalex-snapshot
The Complexity of Predicting Atomicity Violations
inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_12openalex-snapshot
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_21openalex-snapshot
Meta-analysis for Atomicity Violations under Nested Locking
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_39openalex-snapshot
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_18openalex-snapshot
Verifying Parallel Programs with Dynamic Communication Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_17openalex-snapshot
Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_27openalex-snapshot
Trace-Based Symbolic Analysis for Atomicity Violations
inferred← citeshttps://doi.org/10.1007/978-3-642-13754-9_11openalex-snapshot
An Automata-Theoretic Approach to Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_39openalex-snapshot
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_55openalex-snapshot
Dynamic Cutoff Detection in Parameterized Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_16openalex-snapshot
Compositional Bitvector Analysis for Concurrent Programs with Nested Locks
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_22openalex-snapshot
Thread-Modular Counterexample-Guided Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-16164-3_18openalex-snapshot
One Stack to Run Them All
inferred← citeshttps://doi.org/10.1007/978-3-642-18275-4_15openalex-snapshot
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_23openalex-snapshot
Generating Data Race Witnesses by an SMT-Based Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_30openalex-snapshot
Reasoning about Threads with Bounded Lock Chains
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_25openalex-snapshot
Parameterized Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_30openalex-snapshot
Reachability under Contextual Locking
inferred← citeshttps://doi.org/10.1007/978-3-642-29860-8_2openalex-snapshot
Predicting Concurrency Failures in the Generalized Execution Traces of x86 Executables
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_6openalex-snapshot
Reachability Problem for Weak Multi-Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_5openalex-snapshot
Bounded Context-Switching and Reentrant Locking
inferred← citeshttps://doi.org/10.1007/978-3-642-38856-9_25openalex-snapshot
Contextual Locking for Dynamic Pushdown Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_12openalex-snapshot
Duet: Static Analysis for Unbounded Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_21openalex-snapshot
Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_22openalex-snapshot
Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking
inferred← citeshttps://doi.org/10.1007/s00165-011-0179-2openalex-snapshot
Symbolic predictive analysis for concurrent programs
inferred← citeshttps://doi.org/10.1007/s00165-014-0330-yopenalex-snapshot
Model checking dynamic pushdown networks
inferred← citeshttps://doi.org/10.1007/s10009-010-0159-5openalex-snapshot
A decision procedure for detecting atomicity violations for communicating processes with locks
inferred← citeshttps://doi.org/10.1007/s10009-011-0203-0openalex-snapshot
An abort-aware model of transactional programming
inferred← citeshttps://doi.org/10.1007/s10009-013-0274-1openalex-snapshot
Static analysis for concurrent programs with applications to data race detection
inferred← citeshttps://doi.org/10.1016/j.ic.2017.12.003openalex-snapshot
Analyzing pushdown systems with stack manipulation
inferred← citeshttps://doi.org/10.1016/j.jlap.2011.11.001openalex-snapshot
Deadlock checking by a behavioral effect system for lock handling
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102610openalex-snapshot
RML: Theory and practice of a domain specific language for runtime verification
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.028openalex-snapshot
Verifying parallel programs with dynamic communication structures
inferred← citeshttps://doi.org/10.1080/03081079.2012.757437openalex-snapshot
Automated formal analysis and verification: an overview
inferred← citeshttps://doi.org/10.1109/ase.2013.6693064openalex-snapshot
Efficient data race prediction with incremental reasoning on time-stamped lock history
inferred← citeshttps://doi.org/10.1109/ase51524.2021.9678572openalex-snapshot
A Compositional Deadlock Detector for Android Java
inferred← citeshttps://doi.org/10.1109/fmcad.2006.8openalex-snapshot
Assume-Guarantee Reasoning for Deadlock
inferred← citeshttps://doi.org/10.1109/lics.2006.11openalex-snapshot
An Automata-Theoretic Approach for Model Checking Threads for LTL Propert
inferred← citeshttps://doi.org/10.1109/lics.2007.9openalex-snapshot
A Robust Class of Context-Sensitive Languages
inferred← citeshttps://doi.org/10.1109/lics.2008.37openalex-snapshot
Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs
inferred← citeshttps://doi.org/10.1109/lics.2009.45openalex-snapshot
Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks
inferred← citeshttps://doi.org/10.1109/sc41406.2024.00042openalex-snapshot
HiRace: Accurate and Fast Data Race Checking for GPU Programs
inferred← citeshttps://doi.org/10.1109/tase.2013.10openalex-snapshot
Process Rewrite Systems for Software Model Checking
inferred← citeshttps://doi.org/10.1109/tase.2017.8285633openalex-snapshot
Automatic fine-grained locking generation for shared data structures
inferred← citeshttps://doi.org/10.1109/tse.2016.2537335openalex-snapshot
Dynamic Testing for Deadlocks via Constraints
inferred← citeshttps://doi.org/10.1145/1190215.1190262openalex-snapshot
On the analysis of interacting pushdown systems
inferred← citeshttps://doi.org/10.1145/1190216.1190262openalex-snapshot
On the analysis of interacting pushdown systems
inferred← citeshttps://doi.org/10.1145/1882291.1882300openalex-snapshot
PENELOPE
inferred← citeshttps://doi.org/10.1145/1925844.1926398openalex-snapshot
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
inferred← citeshttps://doi.org/10.1145/1925844.1926443openalex-snapshot
Complexity of pattern-based verification for multithreaded programs
inferred← citeshttps://doi.org/10.1145/1926385.1926398openalex-snapshot
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
inferred← citeshttps://doi.org/10.1145/1926385.1926443openalex-snapshot
Complexity of pattern-based verification for multithreaded programs
inferred← citeshttps://doi.org/10.1145/2103621.2103702openalex-snapshot
Sound predictive race detection in polynomial time
inferred← citeshttps://doi.org/10.1145/2103656.2103702openalex-snapshot
Sound predictive race detection in polynomial time
inferred← citeshttps://doi.org/10.1145/2393596.2393651openalex-snapshot
Predicting null-pointer dereferences in concurrent programs
inferred← citeshttps://doi.org/10.1145/2430536.2430542openalex-snapshot
Scaling predictive analysis of concurrent programs by removing trace redundancy
inferred← citeshttps://doi.org/10.1145/2568225.2568312openalex-snapshot
ConLock: a constraint-based approach to dynamic checking on deadlocks in multithreaded programs
inferred← citeshttps://doi.org/10.1145/2629644openalex-snapshot
Pattern-Based Verification for Multithreaded Programs
inferred← citeshttps://doi.org/10.1145/2635868.2635918openalex-snapshot
Sherlock: scalable deadlock detection for concurrent programs
inferred← citeshttps://doi.org/10.1145/2734118openalex-snapshot
Automated Classification of Data Races Under Both Strong and Weak Memory Models
inferred← citeshttps://doi.org/10.1145/2884781.2884819openalex-snapshot
Fixing deadlocks via lock pre-acquisitions
inferred← citeshttps://doi.org/10.1145/2950290.2950329openalex-snapshot
Parallel data race detection for task parallel programs with locks
inferred← citeshttps://doi.org/10.1145/2970276.2970307openalex-snapshot
Radius aware probabilistic testing of deadlocks with guarantees
inferred← citeshttps://doi.org/10.1145/3062341.3062361openalex-snapshot
Static deadlock detection for asynchronous C# programs
inferred← citeshttps://doi.org/10.1145/3106237.3106239openalex-snapshot
Adaptively generating high quality fixes for atomicity violations
inferred← citeshttps://doi.org/10.1145/3140587.3062361openalex-snapshot
Static deadlock detection for asynchronous C# programs
inferred← citeshttps://doi.org/10.1145/3192366.3192419openalex-snapshot
CUBA: interprocedural Context-UnBounded Analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/3296979.3192419openalex-snapshot
CUBA: interprocedural Context-UnBounded Analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/3371085openalex-snapshot
Fast, sound, and effectively complete dynamic race prediction
inferred← citeshttps://doi.org/10.1145/3418583openalex-snapshot
Interprocedural Context-Unbounded Program Analysis Using Observation Sequences
inferred← citeshttps://doi.org/10.1145/3571238openalex-snapshot
Dynamic Race Detection with O(1) Samples
inferred← citeshttps://doi.org/10.1145/3808339openalex-snapshot
SuperCollider: Scalable and Effective Data Race Detection for CUDA
inferred← citeshttps://doi.org/10.17760/d20328155openalex-snapshot
Resource-aware program analysis using observation sequences
inferred← citeshttps://doi.org/10.2168/lmcs-10(1:12)2014openalex-snapshot
Parameterized Synthesis
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:13)2013openalex-snapshot
Reachability Problem for Weak Multi-Pushdown Automata
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:21)2013openalex-snapshot
Reachability under Contextual Locking
inferred← citeshttps://doi.org/10.26076/5191-9024openalex-snapshot
Code Generation: An Introduction to Typed EBNF
inferred← citeshttps://doi.org/10.3384/diss.diva-173568openalex-snapshot
Parameterized Verification of Synchronized Concurrent Programs
inferred← citeshttps://doi.org/10.3929/ethz-a-006213873openalex-snapshot
Model Checking Boolean Programs
inferred← citeshttps://doi.org/10.4204/eptcs.129.24openalex-snapshot
Iterable Forward Reachability Analysis of Monitor-DPNs
inferred← citeshttps://doi.org/10.4230/lipics.concur.2015.383openalex-snapshot
On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2008.1739openalex-snapshot
Analyzing Asynchronous Programs with Preemption
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2011.457openalex-snapshot
Parameterised Pushdown Systems with Non-Atomic Writes
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.125openalex-snapshot
Distributed Controller Synthesis for Deadlock Avoidance
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2016.17openalex-snapshot
Predicate Detection for Parallel Computations with Locking Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1609.05385openalex-snapshot
Reachability for dynamic parametric processes
inferred← citeshttps://doi.org/10.48550/arxiv.1611.02528openalex-snapshot
LTL Model-Checking for Dynamic Pushdown Networks Communicating via Locks
inferred← citeshttps://doi.org/10.48550/arxiv.1709.09006openalex-snapshot
CARET analysis of multithreaded programs
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04766openalex-snapshot
CUBA: Interprocedural Context-UnBounded Analysis of Concurrent Programs (Extended Manuscript)
inferred← citeshttps://doi.org/10.5555/1946284.1946299openalex-snapshot
Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation
inferred← citeshttps://doi.org/10.5555/1998496.1998546openalex-snapshot
Scalable and precise program analysis at NEC
inferred← citeshttps://doi.org/10.70675/61130ea1zef23z4950z81e1z91b74939ff7copenalex-snapshot
Vers la vérification de propriétés de sûreté pour des systèmes infinis communicants : décidabilité et raffinement des abstractions
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.