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

This program is tentative and subject to change.

Incremental static analyses provide up-to-date analysis results in time proportional to the size of a code change, not the entire code base. This promises fast feedback to programmers in IDEs and when checking in commits. However, existing incremental analysis frameworks fail to deliver on this promise for whole-program lattice-based data-flow analyses. In particular, prior Datalog-based frameworks yield good incremental performance only for intra-procedural analyses.

In this paper, we first present a methodology to empirically test if a computation is amenable to incrementalization. Using this methodology, we find that
incremental whole-program analysis may be possible. Second, we present a new incremental Datalog solver called LADDDER to eliminate the shortcomings of prior Datalog-based analysis frameworks. Our Datalog solver uses a non-standard aggregation semantics which allows us to loosen monotonicity requirements on analyses and to improve the performance of lattice aggregators considerably. Our evaluation on real-world Java code confirms that LADDDER provides up-to-date points-to, constant propagation, and interval information in milliseconds.

This program is tentative and subject to change.

Conference Day
Thu 24 Jun

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

13:30 - 14:05
Talks 4B: Concurrency, Compilation, and DebuggingPLDI at PLDI-B +12h
13:30
5m
Talk
Mirror: Making Lock-Free Data Structures Persistent
PLDI
Michal FriedmanTechnion, Erez PetrankTechnion, Pedro RamalheteCisco Systems
DOI
13:35
5m
Talk
Fluid: A Framework for Approximate Concurrency via Controlled Dependency Relaxation
PLDI
Huaipan JiangPennsylvania State University, Haibo ZhangPennsylvania State University, Xulong TangUniversity of Pittsburgh, Vineetha GovindarajPennsylvania State University, Jack SampsonPennsylvania State University, Mahmut Taylan KandemirPennsylvania State University, Danfeng ZhangPennsylvania State University
DOI
13:40
5m
Talk
Frequent Background Polling on a Shared Thread, using Light-Weight Compiler Interrupts
PLDI
Nilanjana BasuUniversity of Illinois at Chicago, Claudio MontanariUniversity of Illinois at Chicago, Jakob ErikssonUniversity of Illinois at Chicago
DOI
13:45
5m
Talk
Alive2: Bounded Translation Validation for LLVM
PLDI
Nuno P. LopesMicrosoft Research, Juneyoung LeeSeoul National University, Chung-Kil HurSeoul National University, Zhengyang LiuUniversity of Utah, John RegehrUniversity of Utah
DOI Pre-print
13:50
5m
Talk
Incremental Whole-Program Analysis in Datalog with Lattices
PLDI
Tamás SzabóJGU Mainz; Workday, Sebastian ErdwegJGU Mainz, Gábor BergmannBudapest University of Technology and Economics; IncQuery Labs
DOI
13:55
5m
Talk
Logical Bytecode Reduction
PLDI
Christian Gram KalhaugeUniversity of California at Los Angeles; Technical University of Denmark, Jens PalsbergUniversity of California at Los Angeles
DOI
14:00
5m
Talk
RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types
PLDI
Michael SammlerMPI-SWS, Rodolphe LepigreMPI-SWS, Robbert KrebbersRadboud University Nijmegen, Kayvan MemarianUniversity of Cambridge, Derek DreyerMPI-SWS, Deepak GargMPI-SWS
DOI

Conference Day
Fri 25 Jun

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

01:30 - 02:05
Talks 4B: Concurrency, Compilation, and DebuggingPLDI at PLDI-B
01:30
5m
Talk
Mirror: Making Lock-Free Data Structures Persistent
PLDI
Michal FriedmanTechnion, Erez PetrankTechnion, Pedro RamalheteCisco Systems
DOI
01:35
5m
Talk
Fluid: A Framework for Approximate Concurrency via Controlled Dependency Relaxation
PLDI
Huaipan JiangPennsylvania State University, Haibo ZhangPennsylvania State University, Xulong TangUniversity of Pittsburgh, Vineetha GovindarajPennsylvania State University, Jack SampsonPennsylvania State University, Mahmut Taylan KandemirPennsylvania State University, Danfeng ZhangPennsylvania State University
DOI
01:40
5m
Talk
Frequent Background Polling on a Shared Thread, using Light-Weight Compiler Interrupts
PLDI
Nilanjana BasuUniversity of Illinois at Chicago, Claudio MontanariUniversity of Illinois at Chicago, Jakob ErikssonUniversity of Illinois at Chicago
DOI
01:45
5m
Talk
Alive2: Bounded Translation Validation for LLVM
PLDI
Nuno P. LopesMicrosoft Research, Juneyoung LeeSeoul National University, Chung-Kil HurSeoul National University, Zhengyang LiuUniversity of Utah, John RegehrUniversity of Utah
DOI Pre-print
01:50
5m
Talk
Incremental Whole-Program Analysis in Datalog with Lattices
PLDI
Tamás SzabóJGU Mainz; Workday, Sebastian ErdwegJGU Mainz, Gábor BergmannBudapest University of Technology and Economics; IncQuery Labs
DOI
01:55
5m
Talk
Logical Bytecode Reduction
PLDI
Christian Gram KalhaugeUniversity of California at Los Angeles; Technical University of Denmark, Jens PalsbergUniversity of California at Los Angeles
DOI
02:00
5m
Talk
RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types
PLDI
Michael SammlerMPI-SWS, Rodolphe LepigreMPI-SWS, Robbert KrebbersRadboud University Nijmegen, Kayvan MemarianUniversity of Cambridge, Derek DreyerMPI-SWS, Deepak GargMPI-SWS
DOI