Cases for static code analysis via CFL-reachcability

[gsvgit]

Prepare data and queries from articles. Possible, not from all. Some of the listed articles have a strange evaluation. So, briefly read them all and select articles with reproducible evaluation. Request authors for access to data which used for evaluation if necessary.

• Precise interprocedural dataflow analysis via graph reachability
• T. W. Reps, S. Horwitz, S. Sagiv, and G. Rosay. Speeding up slicing
• T. W. Reps. Shape analysis as a generalized path problem.
• Specification Inference Using Context-Free Language Reachability
• Existential Label Flow Inference via CFL Reachability
• Type-base flow analysis: from polymorphic subtyping to CFL-reachability
• Refinement-based context-sensitive points-to analysis for Java
• Demand-driven context-sensitive alias analysis for Java
• Efficient subcubic alias analysis for C
• Demand-driven alias analysis for C

[gsvgit]

@darthorimar it is for you.