On the public citation graph
Reachability Analysis of Multithreaded Software with Asynchronous Communication
0 signed · 23 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/10722167_20openalex-snapshot
Efficient Algorithms for Model Checking Pushdown Systems
inferredcites →https://doi.org/10.1007/11539452_36openalex-snapshot
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
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-31980-1_7openalex-snapshot
Context-Bounded Model Checking of Concurrent Software
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
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-540-74407-8_10openalex-snapshot
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_21openalex-snapshot
Context-Bounded Analysis of Concurrent Queue Systems
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-642-00768-2_11openalex-snapshot
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
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-11266-9_17openalex-snapshot
Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_31openalex-snapshot
Weighted Dynamic Pushdown Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_19openalex-snapshot
Reachability Analysis of Communicating Pushdown Systems
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.1016/j.entcs.2009.05.029openalex-snapshot
Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.003openalex-snapshot
Compositional verification of sequential programs with procedures
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.17760/d20328155openalex-snapshot
Resource-aware program analysis using observation sequences
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:13)2013openalex-snapshot
Reachability Problem for Weak Multi-Pushdown Automata
inferred← citeshttps://doi.org/10.5287/ora-7rg81n5vyopenalex-snapshot
Saturation methods for global model-checking pushdown 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.