On the public citation graph
The decidability and complexity of interleaved bidirected Dyck reachability
0 signed · 69 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/11688839_5openalex-snapshot
Context-Sensitive Points-to Analysis: Is It Worth It?
inferredcites →https://doi.org/10.1007/978-3-030-30806-3_15openalex-snapshot
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets
inferredcites →https://doi.org/10.1007/978-3-319-24537-9_10openalex-snapshot
On Boundedness Problems for Pushdown Vector Addition Systems
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-642-00590-9_13openalex-snapshot
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
inferredcites →https://doi.org/10.1007/978-3-642-03013-0_6openalex-snapshot
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
inferredcites →https://doi.org/10.1007/978-3-662-47666-6_26openalex-snapshot
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_11openalex-snapshot
Faster Algorithms for Weighted Recursive State Machines
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_33openalex-snapshot
Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization
inferredcites →https://doi.org/10.1016/0304-3975(92)90269-lopenalex-snapshot
Rational indexes of generators of the cone of context-free languages
inferredcites →https://doi.org/10.1016/j.ipl.2021.106135openalex-snapshot
Tight bounds for reachability problems on one-counter and pushdown systems
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/ase.2015.9openalex-snapshot
Access-Path Abstraction: Scaling Field-Sensitive Data-Flow Analysis with Unbounded Access Paths (T)
inferredcites →https://doi.org/10.1109/lics.2008.37openalex-snapshot
Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs
inferredcites →https://doi.org/10.1109/uemcon.2017.8249039openalex-snapshot
Efficient exact paths for dyck and semi-dyck labeled path reachability (extended abstract)
inferredcites →https://doi.org/10.1145/1094811.1094817openalex-snapshot
Demand-driven points-to analysis for Java
inferredcites →https://doi.org/10.1145/1133255.1134027openalex-snapshot
Refinement-based context-sensitive points-to analysis for Java
inferredcites →https://doi.org/10.1145/1328438.1328464openalex-snapshot
Demand-driven alias analysis for C
inferredcites →https://doi.org/10.1145/1328897.1328460openalex-snapshot
Subcubic algorithms for recursive state machines
inferredcites →https://doi.org/10.1145/178243.178263openalex-snapshot
Interprocedural may-alias analysis for pointers
inferredcites →https://doi.org/10.1145/1926385.1926419openalex-snapshot
The tree width of auxiliary storage
inferredcites →https://doi.org/10.1145/199448.199462openalex-snapshot
Precise interprocedural dataflow analysis via graph reachability
inferredcites →https://doi.org/10.1145/2001420.2001440openalex-snapshot
Demand-driven context-sensitive alias analysis for Java
inferredcites →https://doi.org/10.1145/215465.215466openalex-snapshot
Shape analysis as a generalized path problem
inferredcites →https://doi.org/10.1145/2259016.2259050openalex-snapshot
On-demand dynamic summary-based points-to analysis
inferredcites →https://doi.org/10.1145/2491956.2462159openalex-snapshot
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis
inferredcites →https://doi.org/10.1145/2676726.2676979openalex-snapshot
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth
inferredcites →https://doi.org/10.1145/2771783.2771803openalex-snapshot
Scalable and precise taint analysis for Android
inferredcites →https://doi.org/10.1145/2933575.2933577openalex-snapshot
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
inferredcites →https://doi.org/10.1145/298514.298576openalex-snapshot
Graph-theoretic methods in database theory
inferredcites →https://doi.org/10.1145/3009837.3009848openalex-snapshot
Context-sensitive data-dependence analysis via linear conjunctive language reachability
inferredcites →https://doi.org/10.1145/3093333.3009848openalex-snapshot
Context-sensitive data-dependence analysis via linear conjunctive language reachability
inferredcites →https://doi.org/10.1145/3158118openalex-snapshot
Optimal Dyck reachability for data-dependence and alias analysis
inferredcites →https://doi.org/10.1145/3290361openalex-snapshot
Context-, flow-, and field-sensitive data-flow analysis using synchronized Pushdown systems
inferredcites →https://doi.org/10.1145/3360574openalex-snapshot
Precision-preserving yet fast object-sensitive pointer analysis with partial context sensitivity
inferredcites →https://doi.org/10.1145/3385412.3386021openalex-snapshot
Fast graph simplification for interleaved Dyck-reachability
inferredcites →https://doi.org/10.1145/3428246openalex-snapshot
FlowCFL: generalized type-based reachability analysis: graph reduction and equivalence of CFL-based and type-based reachability
inferredcites →https://doi.org/10.1145/3434298openalex-snapshot
Verifying correct usage of context-free API protocols
inferredcites →https://doi.org/10.1145/3434315openalex-snapshot
The fine-grained and parallel complexity of andersen’s pointer analysis
inferredcites →https://doi.org/10.1145/3434340openalex-snapshot
On the complexity of bidirected interleaved Dyck-reachability
inferredcites →https://doi.org/10.1145/345099.345137openalex-snapshot
Undecidability of context-sensitive data-dependence analysis
inferredcites →https://doi.org/10.1145/3531130.3533345openalex-snapshot
The Complexity of Bidirected Reachability in Valence Systems
inferredcites →https://doi.org/10.1145/773473.178263openalex-snapshot
Interprocedural may-alias analysis for pointers
inferredcites →https://doi.org/10.13140/rg.2.2.12022.09280openalex-snapshot
Efficient Exact Paths For Dyck and semi-Dyck Labeled Path Reachability
inferredcites →https://doi.org/10.4018/ijssoe.2015040103openalex-snapshot
Software Change Impact Analysis
inferredcites →https://doi.org/10.7551/mitpress/4283.003.0008openalex-snapshot
Program Analysis via Graph Reachability
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-29713-7_21openalex-snapshot
Virtual Machines and Hypergraph Data/Code Models: Graph-Theoretic Representations of Lambda-Style Calculi
inferred← citeshttps://doi.org/10.1007/978-3-031-44245-2_12openalex-snapshot
Mutual Refinements of Context-Free Language Reachability
inferred← citeshttps://doi.org/10.1007/978-3-032-06847-7_3openalex-snapshot
An Efficient and Versatile Approach to Shortest Path Problems in Interprocedural Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_15openalex-snapshot
EUF-based Solving Dyck-Reachability with Applications to Static Analysis
inferred← citeshttps://doi.org/10.1007/s10009-025-00787-0openalex-snapshot
CFL-based methods for approximating interleaved Dyck reachability
inferred← citeshttps://doi.org/10.1145/3531130.3533345openalex-snapshot
The Complexity of Bidirected Reachability in Valence Systems
inferred← citeshttps://doi.org/10.1145/3563339openalex-snapshot
Indexing the extended Dyck-CFL reachability for context-sensitive program analysis
inferred← citeshttps://doi.org/10.1145/3571228openalex-snapshot
Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming
inferred← citeshttps://doi.org/10.1145/3571252openalex-snapshot
The Fine-Grained Complexity of CFL Reachability
inferred← citeshttps://doi.org/10.1145/3632884openalex-snapshot
On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability
inferred← citeshttps://doi.org/10.1145/3633279openalex-snapshot
Reachability in Continuous Pushdown VASS
inferred← citeshttps://doi.org/10.1145/3652588openalex-snapshot
Proceedings of the 13th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis
inferred← citeshttps://doi.org/10.1145/3652588.3663318openalex-snapshot
A Better Approximation for Interleaved Dyck Reachability
inferred← citeshttps://doi.org/10.1145/3729257openalex-snapshot
StacKAT: Infinite State Network Verification
inferred← citeshttps://doi.org/10.1145/3776716openalex-snapshot
Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures
inferred← citeshttps://doi.org/10.19153/cleiej.25.3.2openalex-snapshot
Conformance Checking and Pushdown Reactive 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.