On the public citation graph
Indexing the extended Dyck-CFL reachability for context-sensitive program analysis
0 signed · 94 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/11823230_7openalex-snapshot
Existential Label Flow Inference Via CFL Reachability
inferredcites →https://doi.org/10.1007/3-540-16761-7_87openalex-snapshot
An improved algorithm for transitive closure on acyclic digraphs
inferredcites →https://doi.org/10.1007/978-3-030-17465-1_22openalex-snapshot
PhASAR: An Inter-procedural Static Analysis Framework for C/C++
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-02279-1_29openalex-snapshot
Evaluating Reachability Queries over Path Collections
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/0012-365x(93)90164-oopenalex-snapshot
On the calculation of transitive reduction—closure of orders
inferredcites →https://doi.org/10.1016/j.is.2013.10.003openalex-snapshot
Efficient processing of label-constraint reachability queries in large graphs
inferredcites →https://doi.org/10.1016/j.scico.2013.11.010openalex-snapshot
Source-code queries with graph databases—with application to programming language usage and evolution
inferredcites →https://doi.org/10.1016/s0019-9958(67)80007-xopenalex-snapshot
Recognition and parsing of context-free languages in time n3
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.1016/s0950-5849(98)00093-7openalex-snapshot
Program analysis via graph reachability
inferredcites →https://doi.org/10.1017/cbo9780511815034openalex-snapshot
Scientific Method in Practice
inferredcites →https://doi.org/10.1109/2.869367openalex-snapshot
SPEC CPU2000: measuring CPU performance in the New Millennium
inferredcites →https://doi.org/10.1109/icde.2006.53openalex-snapshot
Dual Labeling: Answering Graph Reachability Queries in Constant Time
inferredcites →https://doi.org/10.1109/icde.2008.4497498openalex-snapshot
An Efficient Algorithm for Answering Graph Reachability Queries
inferredcites →https://doi.org/10.1109/icde.2013.6544893openalex-snapshot
FERRARI: Flexible and efficient reachability range assignment for graph indexing
inferredcites →https://doi.org/10.1109/icse.2015.75openalex-snapshot
Database-Backed Program Analysis for Scalable Error Propagation
inferredcites →https://doi.org/10.1109/sp.2014.44openalex-snapshot
Modeling and Discovering Vulnerabilities with Code Property Graphs
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.1109/tse.2018.2869336openalex-snapshot
Value-Flow-Based Demand-Driven Pointer Analysis for C and C++
inferredcites →https://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1137/060650271openalex-snapshot
Improved Dynamic Reachability Algorithms for Directed Graphs
inferredcites →https://doi.org/10.1137/s0097539702403098openalex-snapshot
Reachability and Distance Queries via 2-Hop Labels
inferredcites →https://doi.org/10.1145/1075382.1075387openalex-snapshot
Analysis of recursive state machines
inferredcites →https://doi.org/10.1145/1094811.1094817openalex-snapshot
Demand-driven points-to analysis for Java
inferredcites →https://doi.org/10.1145/1250734.1250789openalex-snapshot
Practical memory leak detection using guarded value-flow analysis
inferredcites →https://doi.org/10.1145/1328438.1328460openalex-snapshot
Subcubic algorithms for recursive state machines
inferredcites →https://doi.org/10.1145/1328438.1328464openalex-snapshot
Demand-driven alias analysis for C
inferredcites →https://doi.org/10.1145/1807167.1807183openalex-snapshot
Computing label-constraint reachability in graph databases
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/2025113.2025160openalex-snapshot
Boosting the performance of flow-sensitive points-to analysis using value flow
inferredcites →https://doi.org/10.1145/215465.215466openalex-snapshot
Shape analysis as a generalized path problem
inferredcites →https://doi.org/10.1145/2213836.2213855openalex-snapshot
Query preserving graph compression
inferredcites →https://doi.org/10.1145/2213977.2214056openalex-snapshot
Multiplying matrices faster than coppersmith-winograd
inferredcites →https://doi.org/10.1145/2259016.2259050openalex-snapshot
On-demand dynamic summary-based points-to analysis
inferredcites →https://doi.org/10.1145/24039.24041openalex-snapshot
The program dependence graph and its use in optimization
inferredcites →https://doi.org/10.1145/2491894.2466483openalex-snapshot
Precise and scalable context-sensitive pointer analysis via value flow graph
inferredcites →https://doi.org/10.1145/2491956.2462191openalex-snapshot
Hybrid context-sensitivity for points-to analysis
inferredcites →https://doi.org/10.1145/2499370.2462159openalex-snapshot
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis
inferredcites →https://doi.org/10.1145/2568225.2568243openalex-snapshot
Reviser: efficiently updating IDE-/IFDS-based data-flow analyses in response to incremental program changes
inferredcites →https://doi.org/10.1145/2588555.2612181openalex-snapshot
Reachability queries on large dynamic graphs
inferredcites →https://doi.org/10.1145/2635868.2635878openalex-snapshot
FlowTwist: efficient context-sensitive inside-out taint analysis for large codebases
inferredcites →https://doi.org/10.1145/2660193.2660213openalex-snapshot
Efficient subcubic alias analysis for C
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/2814270.2814307openalex-snapshot
Giga-scale exhaustive points-to analysis for Java in under a minute
inferredcites →https://doi.org/10.1145/2882903.2882933openalex-snapshot
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs
inferredcites →https://doi.org/10.1145/2892208.2892235openalex-snapshot
SVF: interprocedural static value-flow analysis in LLVM
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/3035918.3035955openalex-snapshot
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries
inferredcites →https://doi.org/10.1145/3158118openalex-snapshot
Optimal Dyck reachability for data-dependence and alias analysis
inferredcites →https://doi.org/10.1145/3192366.3192378openalex-snapshot
Calling-to-reference context translation via constraint-guided CFL-reachability
inferredcites →https://doi.org/10.1145/3192366.3192418openalex-snapshot
Pinpoint: fast and precise sparse value flow analysis for million lines of code
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/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/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/3498673openalex-snapshot
The decidability and complexity of interleaved bidirected Dyck reachability
inferredcites →https://doi.org/10.1145/996841.996867openalex-snapshot
The set constraint/CFL reachability connection in practice
inferredcites →https://doi.org/10.14778/1921071.1921074openalex-snapshot
Graph indexing of road networks for shortest path queries with label restrictions
inferredcites →https://doi.org/10.14778/2180912.2180919openalex-snapshot
Comments on "Stack-based Algorithms for Pattern Matching on DAGs"
inferredcites →https://doi.org/10.14778/3380750.3380753openalex-snapshot
Answering billion-scale label-constrained reachability queries within microsecond
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00074openalex-snapshot
PSPC: Efficient Parallel Shortest Path Counting on Large-Scale Graphs
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/3597503.3639132openalex-snapshot
LibAlchemy: A Two-Layer Persistent Summary Design for Taming Third-Party Libraries in Static Bug-Finding Systems
inferred← citeshttps://doi.org/10.1145/3632743openalex-snapshot
Octopus : Scaling Value-Flow Analysis via Parallel Collection of Realizable Path Conditions
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/3689031.3717487openalex-snapshot
Seal: Towards Diverse Specification Inference for Linux Interfaces from Security Patches
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/3763065openalex-snapshot
Fast Client-Driven CFL-Reachability via Regularization-Based Graph Simplification
inferred← citeshttps://doi.org/10.1145/3798211openalex-snapshot
Hermes: Making Path-Sensitive Pointer Analysis Scalable for Sparse Value-Flow Analysis
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.