Selective Context-Sensitivity for k-CFA with CFL-Reachability

on YouTube ↗13m

" summary

Presents a concrete method that uses CFL-reachability pre-analysis to decide which program nodes need k-CFA context-sensitivity, builds a fast verifier that replaces many heuristic checks, and plugs into k-call-site-sensitive pointer analysis; evaluation on 11 Java benchmarks shows analyses run substantially faster with only small precision loss (results plotted between 0 and 1, CI vs 2-callsite baseline) so the tool actually reduces false positives while cutting time and memory.

AI-written summary · about

" chapters (11)

1. 0:00Intro
2. 0:15Context-Sensitive Pointer Analysis
3. 1:13K-Limiting Context Sensitive Pointer Analysis
4. 1:54Selective Context Sensitivity
5. 3:46Condition (original)
6. 6:05Our Solution
7. 6:33Context-Free Language Reachability
8. 7:49Condition* (CFL)
9. 9:52Simplification
10. 10:31Where is the Over-Approximation?
11. 11:25Evaluation