On the public citation graph
Taming transitive redundancy for context-free language reachability
0 signed · 54 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/3-540-44585-4_18openalex-snapshot
Analysis of Recursive State Machines
inferredcites →https://doi.org/10.1007/978-3-030-32304-2_3openalex-snapshot
Fast and Precise Handling of Positive Weight Cycles for Field-Sensitive Pointer Analysis
inferredcites →https://doi.org/10.1007/978-3-319-41540-6_23openalex-snapshot
Soufflé: On Synthesis of Program Analyzers
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-54577-5_27openalex-snapshot
Minimization of Visibly Pushdown Automata Using Partial Max-SAT
inferredcites →https://doi.org/10.1016/0020-0190(94)90047-7openalex-snapshot
On finding the strongly connected components in a directed graph
inferredcites →https://doi.org/10.1016/0304-3975(86)90098-8openalex-snapshot
Amortized efficiency of a path retrieval data structure
inferredcites →https://doi.org/10.1016/s0304-3975(00)00049-9openalex-snapshot
Interconvertibility of a class of set constraints and context-free-language reachability
inferredcites →https://doi.org/10.1109/cgo.2009.9openalex-snapshot
Wave Propagation and Deep Propagation for Pointer Analysis
inferredcites →https://doi.org/10.1109/icpp.2014.54openalex-snapshot
Parallel Pointer Analysis with CFL-Reachability
inferredcites →https://doi.org/10.1109/pact.2019.00015openalex-snapshot
Fast Parallel Equivalence Relations in a Datalog Compiler
inferredcites →https://doi.org/10.1109/swat.1971.10openalex-snapshot
Depth-first search and linear graph algorithms
inferredcites →https://doi.org/10.1109/tse.2014.2302311openalex-snapshot
Detecting Memory Leaks Statically with Full-Sparse Value-Flow Analysis
inferredcites →https://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferredcites →https://doi.org/10.1145/1328897.1328460openalex-snapshot
Subcubic algorithms for recursive state machines
inferredcites →https://doi.org/10.1145/1328897.1328464openalex-snapshot
Demand-driven alias analysis for C
inferredcites →https://doi.org/10.1145/1449955.1449792openalex-snapshot
Typestate-like analysis of multiple interacting objects
inferredcites →https://doi.org/10.1145/1640089.1640108openalex-snapshot
Strictly declarative specification of sophisticated points-to analyses
inferredcites →https://doi.org/10.1145/199448.199462openalex-snapshot
Precise interprocedural dataflow analysis via graph reachability
inferredcites →https://doi.org/10.1145/215465.215466openalex-snapshot
Shape analysis as a generalized path problem
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/277652.277667openalex-snapshot
Partial online cycle elimination in inclusion constraint graphs
inferredcites →https://doi.org/10.1145/2892208.2892235openalex-snapshot
SVF: interprocedural static value-flow analysis in LLVM
inferredcites →https://doi.org/10.1145/3158118openalex-snapshot
Optimal Dyck reachability for data-dependence and alias analysis
inferredcites →https://doi.org/10.1145/321526.321534openalex-snapshot
An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
inferredcites →https://doi.org/10.1145/321864.321866openalex-snapshot
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
inferredcites →https://doi.org/10.1145/3377811.3380386openalex-snapshot
Typestate-guided fuzzer for discovering use-after-free vulnerabilities
inferredcites →https://doi.org/10.1145/345099.345137openalex-snapshot
Undecidability of context-sensitive data-dependence analysis
inferredcites →https://doi.org/10.1145/3492428openalex-snapshot
Fast Graph Simplification for Interleaved-Dyck Reachability
inferredcites →https://doi.org/10.1145/358438.349310openalex-snapshot
Off-line variable substitution for scaling points-to analysis
inferredcites →https://doi.org/10.1145/996893.996867openalex-snapshot
The set constraint/CFL reachability connection in practice
inferredcites →https://doi.org/10.48550/arxiv.1907.09563openalex-snapshot
Minimization of visibly pushdown automata is NP-complete
inferredcites →https://doi.org/10.5281/zenodo.7066400openalex-snapshot
Artifact of "Taming Transitive Redundancy for Context-Free 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-44245-2_12openalex-snapshot
Mutual Refinements of Context-Free Language Reachability
inferred← citeshttps://doi.org/10.1007/978-981-99-7584-6_22openalex-snapshot
Vulnerability Detection via Typestate-Guided Code Representation Learning
inferred← citeshttps://doi.org/10.1007/s10009-026-00864-yopenalex-snapshot
FastMatrixCFPQ: an efficient linear-algebra-based approach to CFL-reachability
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00118openalex-snapshot
Two Birds with One Stone: Multi-Derivation for Fast Context-Free Language Reachability Analysis
inferred← citeshttps://doi.org/10.1109/icse55347.2025.00195openalex-snapshot
Boosting Path-Sensitive Value Flow Analysis Via Removal of Redundant Summaries
inferred← citeshttps://doi.org/10.1109/tse.2024.3437684openalex-snapshot
Pearl: A Multi-Derivation Approach to Efficient CFL-Reachability Solving
inferred← citeshttps://doi.org/10.1145/3591233openalex-snapshot
Recursive State Machine Guided Graph Folding for Context-Free Language Reachability
inferred← citeshttps://doi.org/10.1145/3644389openalex-snapshot
Dynamic Transitive Closure-based Static Analysis through the Lens of Quantum Search
inferred← citeshttps://doi.org/10.1145/3649862openalex-snapshot
Iterative-Epoch Online Cycle Elimination for Context-Free Language Reachability
inferred← citeshttps://doi.org/10.1145/3650212.3680346openalex-snapshot
Better Not Together: Staged Solving for Context-Free Language Reachability
inferred← citeshttps://doi.org/10.1145/3656451openalex-snapshot
Context-Free Language Reachability via Skewed Tabulation
inferred← citeshttps://doi.org/10.1145/3689804openalex-snapshot
Boosting the Performance of Alias-Aware IFDS Analysis with CFL-Based Environment Transformers
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/3735544.3735585openalex-snapshot
Universal High-Performance CFL-Reachability via Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/3744916.3773222openalex-snapshot
No Shot in the Dark: Efficient Context-Free Language Reachability via Context-Aware Tabulation
inferred← citeshttps://doi.org/10.1145/3763065openalex-snapshot
Fast Client-Driven CFL-Reachability via Regularization-Based Graph Simplification
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.