On the public citation graph
On the complexity of bidirected interleaved Dyck-reachability
0 signed · 35 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/978-3-540-31980-1_7openalex-snapshot
Context-Bounded Model Checking of Concurrent Software
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.1016/s0950-5849(98)00093-7openalex-snapshot
Program analysis via graph reachability
inferredcites →https://doi.org/10.1089/cmb.2013.0004openalex-snapshot
On the Complexity of Rearrangement Problems under the Breakpoint Distance
inferredcites →https://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
inferredcites →https://doi.org/10.1109/tse.1976.233819openalex-snapshot
On Two Problems in the Generation of Program Test Paths
inferredcites →https://doi.org/10.1145/1094811.1094817openalex-snapshot
Demand-driven points-to analysis for Java
inferredcites →https://doi.org/10.1145/1133981.1134027openalex-snapshot
Refinement-based context-sensitive points-to analysis for Java
inferredcites →https://doi.org/10.1145/1328438.1328460openalex-snapshot
Subcubic algorithms for recursive state machines
inferredcites →https://doi.org/10.1145/1925844.1926419openalex-snapshot
The tree width of auxiliary storage
inferredcites →https://doi.org/10.1145/1926385.1926419openalex-snapshot
The tree width of auxiliary storage
inferredcites →https://doi.org/10.1145/2001420.2001440openalex-snapshot
Demand-driven context-sensitive alias analysis for Java
inferredcites →https://doi.org/10.1145/2771783.2771803openalex-snapshot
Scalable and precise taint analysis for Android
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/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/3385412.3386021openalex-snapshot
Fast graph simplification for 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/349214.349241openalex-snapshot
Context-sensitive synchronization-sensitive analysis is undecidable
inferredcites →https://doi.org/10.1145/349299.349311openalex-snapshot
Modular interprocedural pointer analysis using access paths
inferredcites →https://doi.org/10.1145/996841.996867openalex-snapshot
The set constraint/CFL reachability connection in practice
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-032-26220-2_15openalex-snapshot
EUF-based Solving Dyck-Reachability with Applications to Static Analysis
inferred← citeshttps://doi.org/10.1145/3498673openalex-snapshot
The decidability and complexity of interleaved bidirected 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/3633279openalex-snapshot
Reachability in Continuous Pushdown VASS
inferred← citeshttps://doi.org/10.1145/3651591openalex-snapshot
Evaluating Datalog over Semirings: A Grounding-based Approach
inferred← citeshttps://doi.org/10.1145/3721145.3725762openalex-snapshot
GraCFL: A Holistically Designed Vertex-Centric Graph System for CFL Reachability
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
inferred← citeshttps://doi.org/10.48550/arxiv.2109.01321openalex-snapshot
Indexing Context-Sensitive Reachability
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.