Analyzing Binding Extent in 3CPS
summary
3CPS implements a 3CPS factored CPS IR and an abstract‑interpretation analysis that classifies each variable as register/stack/heap extents, mapping extents to machine storage. The implementation includes an instrumented interpreter to validate dynamics and scales like 0CFA rather than exponentially. On a 7,800‑variable SML benchmark the naive syntactic rule leaves 88 variables on the heap; the analysis reclassifies 86 of those 88 as non‑heap (about 97.7%), and across benchmarks it achieves high‑90s heap reduction.
AI-written summary · about
chapters (7)
- 0:00Start
- 2:00Dynamic Lifetime of Environment Structure
- 2:15Environment Structure
- 3:06Create the Closure
- 6:48Register Extent
- 11:28Types of Events
- 12:55Conclusion
related talks
12mOn the metatheory of IRs and the CPS-calculus
14mCoSSJIT: Combining Static Analysis and Speculation in JIT Compilers
39mA Reusable Machine-Calculus for Automated Resource Analyses
31mRange-Analysis-Based Optimization for SML/NJ
21mFlow-Analysis-Based Closure Optimization
15mCompiling with Continuations, Correctly
24mHandling Scope Checks: A Comparative Framework for Dynamic Scope Extrusion Checks
19mFrom Capabilities to Regions: Enabling Efficient Compilation of Lexical Effect ...