On the public citation graph

FlowCFL: generalized type-based reachability analysis: graph reduction and equivalence of CFL-based and type-based reachability

https://doi.org/10.1145/3428246
0 signed · 53 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11531142_4openalex-snapshot
Efficiently Refactoring Java Applications to Use Generic Libraries
inferredcites →https://doi.org/10.1007/978-3-540-70592-5_26openalex-snapshot
Inference of Reference Immutability
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-642-22655-7_16openalex-snapshot
Tunable Static Inference for Generic Universe Types
inferredcites →https://doi.org/10.1007/978-3-642-31057-7_9openalex-snapshot
Inference and Checking of Object Ownership
inferredcites →https://doi.org/10.1007/978-3-642-54804-8_10openalex-snapshot
Type-Based Taint Analysis for Java Web Applications
inferredcites →https://doi.org/10.1016/s0950-5849(98)00093-7openalex-snapshot
Program analysis via graph reachability
inferredcites →https://doi.org/10.1109/icse.2007.70openalex-snapshot
Refactoring for Parameterizing Java Classes
inferredcites →https://doi.org/10.1145/1094811.1094817openalex-snapshot
Demand-driven points-to analysis for Java
inferredcites →https://doi.org/10.1145/1094811.1094828openalex-snapshot
Javari
inferredcites →https://doi.org/10.1145/1133981.1134027openalex-snapshot
Refinement-based context-sensitive points-to analysis for Java
inferredcites →https://doi.org/10.1145/1961204.1961205openalex-snapshot
Refactoring using type constraints
inferredcites →https://doi.org/10.1145/1993316.1993518openalex-snapshot
EnerJ
inferredcites →https://doi.org/10.1145/1993498.1993518openalex-snapshot
EnerJ
inferredcites →https://doi.org/10.1145/199448.199462openalex-snapshot
Precise interprocedural dataflow analysis via graph reachability
inferredcites →https://doi.org/10.1145/2160910.2160913openalex-snapshot
A data-centric approach to synchronization
inferredcites →https://doi.org/10.1145/2384616.2384680openalex-snapshot
Reim & ReImInfer
inferredcites →https://doi.org/10.1145/2489804.2489809openalex-snapshot
Composing polymorphic information flow systems with reference immutability
inferredcites →https://doi.org/10.1145/2509136.2509546openalex-snapshot
Verifying quantitative reliability for programs that execute on unreliable hardware
inferredcites →https://doi.org/10.1145/2594291.2594299openalex-snapshot
FlowDroid
inferredcites →https://doi.org/10.1145/263699.263714openalex-snapshot
Parameterized types for Java
inferredcites →https://doi.org/10.1145/2647508.2647522openalex-snapshot
CFL-reachability and context-sensitive integrity types
inferredcites →https://doi.org/10.1145/2660267.2660343openalex-snapshot
Collaborative Verification of Information Flow for a High-Assurance App Store
inferredcites →https://doi.org/10.1145/2771783.2771803openalex-snapshot
Scalable and precise taint analysis for Android
inferredcites →https://doi.org/10.1145/292540.292561openalex-snapshot
JFlow
inferredcites →https://doi.org/10.1145/2972206.2972209openalex-snapshot
JCrypt
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/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/345099.345137openalex-snapshot
Undecidability of context-sensitive data-dependence analysis
inferredcites →https://doi.org/10.1145/349299.349332openalex-snapshot
Scalable context-sensitive flow analysis using instantiation constraints
inferredcites →https://doi.org/10.1145/360204.360208openalex-snapshot
Type-base flow analysis
inferredcites →https://doi.org/10.1145/379605.379635openalex-snapshot
Type-based analysis and applications
inferredcites →https://doi.org/10.15479/at:ist-2017-870-v1-1openalex-snapshot
Optimal Dyck Reachability for Data-Dependence and Alias Analysis
inferredcites →https://doi.org/10.3233/jcs-1996-42-304openalex-snapshot
A sound type system for secure flow analysis
inferredcites →https://doi.org/10.4230/lipics.ecoop.2018.25openalex-snapshot
Definite Reference Mutability

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/s10009-025-00787-0openalex-snapshot
CFL-based methods for approximating interleaved Dyck reachability
inferred← citeshttps://doi.org/10.1109/compsac69091.2026.00051openalex-snapshot
Refuting Infeasible Paths for False Alarm Reduction
inferred← citeshttps://doi.org/10.1145/3498673openalex-snapshot
The decidability and complexity of interleaved bidirected Dyck reachability
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/3583660.3583664openalex-snapshot
CFL/Dyck Reachability
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/3632884openalex-snapshot
On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability
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/3656451openalex-snapshot
Context-Free Language Reachability via Skewed Tabulation
inferred← citeshttps://doi.org/10.1145/3704854openalex-snapshot
Program Analysis via Multiple Context Free Language Reachability
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/3839491openalex-snapshot
Transitive, Abstract, and Class Polymorphic Immutability
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.