On the public citation graph
Recursive State Machine Guided Graph Folding for Context-Free Language Reachability
0 signed · 67 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-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-540-31980-1_5openalex-snapshot
On-the-Fly Reachability and Cycle Detection for Recursive State Machines
inferredcites →https://doi.org/10.1007/978-3-540-74061-2_17openalex-snapshot
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
inferredcites →https://doi.org/10.1007/978-3-540-77050-3_4openalex-snapshot
Program Analysis Using Weighted Pushdown Systems
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(83)90063-7openalex-snapshot
Time complexity of loop-free two-way pushdown automata
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/j.scico.2005.02.009openalex-snapshot
Weighted pushdown systems and their application to interprocedural dataflow analysis
inferredcites →https://doi.org/10.1016/j.tcs.2005.11.017openalex-snapshot
Modular strategies for recursive game graphs
inferredcites →https://doi.org/10.1016/s0019-9958(85)80024-3openalex-snapshot
Fast recognition of pushdown automaton and context-free languages
inferredcites →https://doi.org/10.1016/s0950-5849(98)00093-7openalex-snapshot
Program analysis via graph 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/tse.2018.2869336openalex-snapshot
Value-Flow-Based Demand-Driven Pointer Analysis for C and C++
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1145/1075382.1075387openalex-snapshot
Analysis of recursive state machines
inferredcites →https://doi.org/10.1145/1290520.1290524openalex-snapshot
Efficient field-sensitive pointer analysis of C
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/1449764.1449792openalex-snapshot
Typestate-like analysis of multiple interacting objects
inferredcites →https://doi.org/10.1145/1639949.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/2001420.2001440openalex-snapshot
Demand-driven context-sensitive alias analysis for Java
inferredcites →https://doi.org/10.1145/2338965.2336784openalex-snapshot
Static memory leak detection using full-sparse value-flow 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/258994.259006openalex-snapshot
Interconvertbility of set constraints and context-free language reachability
inferredcites →https://doi.org/10.1145/2608628.2608664openalex-snapshot
Powers of tensors and fast matrix multiplication
inferredcites →https://doi.org/10.1145/2660193.2660213openalex-snapshot
Efficient subcubic alias analysis for C
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/2676726.2676997openalex-snapshot
Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks
inferredcites →https://doi.org/10.1145/2775051.2676977openalex-snapshot
Specification Inference Using Context-Free Language Reachability
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/2950290.2950296openalex-snapshot
On-demand strong update analysis via value-flow refinement
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/3186893openalex-snapshot
Subcubic Equivalences Between Path, Matrix, and Triangle Problems
inferredcites →https://doi.org/10.1145/3291641openalex-snapshot
Artifact for "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/3428301openalex-snapshot
Flow2Vec: value-flow-based precise code embedding
inferredcites →https://doi.org/10.1145/349299.349310openalex-snapshot
Off-line variable substitution for scaling points-to analysis
inferredcites →https://doi.org/10.1145/3563343openalex-snapshot
Taming transitive redundancy for context-free language reachability
inferredcites →https://doi.org/10.1145/780822.781150openalex-snapshot
A practical flow-sensitive and context-sensitive C and C++ memory leak detector
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.7708433openalex-snapshot
Artifact of "Recursive State Machine Guided Graph Folding for Context-Free Language 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-981-99-7584-6_22openalex-snapshot
Vulnerability Detection via Typestate-Guided Code Representation Learning
inferred← citeshttps://doi.org/10.1016/j.jss.2025.112753openalex-snapshot
Clash: Enhancing context-sensitivity in data-flow analysis for mitigating the impact of indirect calls
inferred← citeshttps://doi.org/10.1016/j.polymertesting.2025.108840openalex-snapshot
Optimal formulation design of silicate-modified polymer based grouting material for reinforcing silty fine sand stratum
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/tse.2024.3437684openalex-snapshot
Pearl: A Multi-Derivation Approach to Efficient CFL-Reachability Solving
inferred← citeshttps://doi.org/10.1145/3643749openalex-snapshot
Fast Graph Simplification for Path-Sensitive Typestate Analysis through Tempo-Spatial Multi-Point Slicing
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/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/3744916.3773222openalex-snapshot
No Shot in the Dark: Efficient Context-Free Language Reachability via Context-Aware Tabulation
inferred← citeshttps://doi.org/10.1145/3744916.3787840openalex-snapshot
Fast Flow-Sensitive C Program Partitioning via Iterative Value-Flow Refinement
inferred← citeshttps://doi.org/10.1145/3763065openalex-snapshot
Fast Client-Driven CFL-Reachability via Regularization-Based Graph Simplification
inferred← citeshttps://doi.org/10.1145/3763083openalex-snapshot
Efficient Abstract Interpretation via Selective Widening
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.