Write a Blog >>
PLDI 2021
Sun 20 - Sat 26 June 2021 Virtual Conference

This program is tentative and subject to change.

Thu 24 Jun 2021 09:05 - 09:10 at PLDI-A - Talks 3A: Analysis and Synthesis
Thu 24 Jun 2021 21:05 - 21:10 at PLDI-A - Talks 3A: Analysis and Synthesis

We consider the problem of making expressive static analyzers interactive. Formal static analysis is seeing increasingly widespread adoption as a tool for verification and bug-finding, but even with powerful cloud infrastructure it can take minutes or hours to get batch analysis results after a code change. While existing techniques offer some demand-driven or incremental aspects for certain classes of analysis, the fundamental challenge we tackle is doing both for arbitrary abstract interpreters.
Our technique, demanded abstract interpretation, lifts program syntax and analysis state to a dynamically evolving graph structure, in which program edits, client-issued queries, and evaluation of abstract semantics are all treated uniformly. The key difficulty addressed by our approach is the application of general incremental computation techniques to the complex, cyclic dependency structure induced by abstract interpretation of loops with widening operators. We prove that desirable abstract interpretation meta-properties, including soundness and termination, are preserved in our approach, and that demanded analysis results are equal to those computed by a batch abstract interpretation. Experimental results suggest promise for a prototype demanded abstract interpretation framework: by combining incremental and demand-driven techniques, our framework consistently delivers analysis results at interactive speeds, answering 95% of queries within 1.2 seconds.

This program is tentative and subject to change.

Conference Day
Thu 24 Jun

Displayed time zone: Eastern Time (US & Canada) change

09:00 - 09:40
Talks 3A: Analysis and SynthesisPLDI at PLDI-A +12h
09:00
5m
Talk
Trace-Based Control-Flow Analysis
PLDI
DOI
09:05
5m
Talk
Demanded Abstract Interpretation
PLDI
Benno SteinUniversity of Colorado at Boulder, Bor-Yuh Evan ChangUniversity of Colorado at Boulder; Amazon, Manu SridharanUniversity of California at Riverside
DOI
09:10
5m
Talk
Unleashing the Hidden Power of Compiler Optimization on Binary Code Difference: An Empirical Study
PLDI
Xiaolei RenUniversity of Texas at Arlington, Michael HoUniversity of Texas at Arlington, Jiang MingUniversity of Texas at Arlington, Jeff Yu LeiUniversity of Texas at Arlington, Li LiMonash University
DOI
09:15
5m
Talk
Chianina: An Evolving Graph System for Flow- and Context-Sensitive Analyses of Million Lines of C Code
PLDI
Zhiqiang ZuoNanjing University, Yiyu ZhangNanjing University, Qiuhong PanNanjing University, Shenming LuNanjing University, Yue LiNanjing University, Linzhang WangNanjing University, Xuandong LiNanjing University, Guoqing Harry XuUniversity of California at Los Angeles
DOI
09:20
5m
Talk
Termination Analysis without the Tears
PLDI
Shaowei ZhuPrinceton University, Zachary KincaidPrinceton University
DOI
09:25
5m
Talk
Reverse Engineering for Reduction Parallelization via Semiring Polynomials
PLDI
Akimasa MorihataUniversity of Tokyo, Shigeyuki SatoUniversity of Tokyo
DOI
09:30
5m
Talk
RbSyn: Type- and Effect-Guided Program Synthesis
PLDI
Sankha Narayan GuriaUniversity of Maryland, Jeffrey S. FosterTufts University, David Van HornUniversity of Maryland
DOI
09:35
5m
Talk
Central Moment Analysis for Cost Accumulators in Probabilistic Programs
PLDI
Di WangCarnegie Mellon University, Jan HoffmannCarnegie Mellon University, Thomas RepsUniversity of Wisconsin
DOI
21:00 - 21:40
Talks 3A: Analysis and SynthesisPLDI at PLDI-A
21:00
5m
Talk
Trace-Based Control-Flow Analysis
PLDI
DOI
21:05
5m
Talk
Demanded Abstract Interpretation
PLDI
Benno SteinUniversity of Colorado at Boulder, Bor-Yuh Evan ChangUniversity of Colorado at Boulder; Amazon, Manu SridharanUniversity of California at Riverside
DOI
21:10
5m
Talk
Unleashing the Hidden Power of Compiler Optimization on Binary Code Difference: An Empirical Study
PLDI
Xiaolei RenUniversity of Texas at Arlington, Michael HoUniversity of Texas at Arlington, Jiang MingUniversity of Texas at Arlington, Jeff Yu LeiUniversity of Texas at Arlington, Li LiMonash University
DOI
21:15
5m
Talk
Chianina: An Evolving Graph System for Flow- and Context-Sensitive Analyses of Million Lines of C Code
PLDI
Zhiqiang ZuoNanjing University, Yiyu ZhangNanjing University, Qiuhong PanNanjing University, Shenming LuNanjing University, Yue LiNanjing University, Linzhang WangNanjing University, Xuandong LiNanjing University, Guoqing Harry XuUniversity of California at Los Angeles
DOI
21:20
5m
Talk
Termination Analysis without the Tears
PLDI
Shaowei ZhuPrinceton University, Zachary KincaidPrinceton University
DOI
21:25
5m
Talk
Reverse Engineering for Reduction Parallelization via Semiring Polynomials
PLDI
Akimasa MorihataUniversity of Tokyo, Shigeyuki SatoUniversity of Tokyo
DOI
21:30
5m
Talk
RbSyn: Type- and Effect-Guided Program Synthesis
PLDI
Sankha Narayan GuriaUniversity of Maryland, Jeffrey S. FosterTufts University, David Van HornUniversity of Maryland
DOI
21:35
5m
Talk
Central Moment Analysis for Cost Accumulators in Probabilistic Programs
PLDI
Di WangCarnegie Mellon University, Jan HoffmannCarnegie Mellon University, Thomas RepsUniversity of Wisconsin
DOI