A Flow-Insensitive-Complete Program Representation
summary
Claims a program transformation that makes a flow‑insensitive analysis as precise as a flow‑sensitive one for assertion failures under pure collecting semantics, by inserting targeted copies to produce a thick form (a refined SSI/SSA). It formalizes two required properties, gives a dominance‑tree algorithm (worst‑case O(h × blocks × variables)) to place copies, and implements a prototype evaluated on Java functions: measured environment sizes (squared variable counts) show thick form often uses less space than a textbook flow‑sensitive scheme and is competitive with optimized flow‑sensitive analyses.
AI-written summary · about
chapters (5)
- 0:00Start
- 6:04Stalic Single Assignment Form
- 11:18Copy Insertion Strategy
- 20:19Experiments
- 23:32Conclusion
related talks
27mPartial Evaluation of Reversible Flowchart Programs
28mType-directed Program Transformation for Constant-Time Enforcement
01h 05mControl Flow Obfuscation for Featherweight Java + Efficient Fair Conjunction
21mFlow-Analysis-Based Closure Optimization
26mSSA Translation Is an Abstract Interpretation
23mAn Abstract Interpretation for SPMD Divergence on Reducible Control Flow Graphs
21mContext Sensitivity without Contexts: A Cut-Shortcut Approach to Fast and Precise(…)
26mSecurePtrs: Proving Secure Compilation with Data-Flow Back-Translation and Turn