SPLASH 2020
Sun 15 - Sat 21 November 2020 Online Conference
Tue 17 Nov 2020 17:20 - 17:40 at SPLASH-I - T-6A Chair(s): Zhefeng Wu, Filip Niksic
Wed 18 Nov 2020 05:20 - 05:40 at SPLASH-I - T-6A Chair(s): Michael Pradel, Konstantinos Kallas

Reachability analysis is a fundamental program analysis with a wide variety of applications. We present FlowCFL, a type-based reachability analysis that accounts for mutable heap data. The underlying semantics of FlowCFL is Context-Free-Language (CFL)-reachability.

We make three contributions. First, we define a dynamic semantics that captures the notion of flow commonly used in reachability analysis. Second, we establish correctness of CFL-reachability over graphs with inverse edges (inverse edges are necessary for the handling of mutable heap data).
Our approach combines CFL-reachability with reference immutability to avoid the addition of certain inverse edges, which results in graph reduction and precision improvement. The key contribution of our work is the formal account of correctness, which extends to the case when inverse edges are removed. Third, we present a type-based reachability analysis and establish equivalence between a certain CFL-reachability analysis and the type-based analysis, thus proving correctness of the type-based analysis.

Tue 17 Nov

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

17:00 - 18:20
T-6AOOPSLA at SPLASH-I +12h
Chair(s): Zhefeng Wu Alibaba Group, Filip Niksic Google
17:00
20m
Talk
Flow2Vec: Value-Flow-Based Precise Code EmbeddingDistinguished Paper
OOPSLA
Yulei Sui University of Technology Sydney, Xiao Cheng Beijing University of Posts and Telecommunications, Guanqin Zhang University of Technology Sydney, Haoyu Wang Beijing University of Posts and Telecommunications
Link to publication DOI Media Attached
17:20
20m
Talk
FlowCFL: Generalized Type-Based Reachability Analysis: Graph Reduction and Equivalence of CFL-Based and Type-Based Reachability
OOPSLA
Ana Milanova Rensselaer Polytechnic Institute
Link to publication DOI Media Attached
17:40
20m
Talk
Hidden Inheritance: An Inline Caching Design for TypeScript Performance
OOPSLA
Zhefeng Wu Alibaba Group, Zhe Sun Alibaba Group, Kai Gong Alibaba Group, Lingyun Chen Alibaba Group, Bin Liao Alibaba Group, Yihua Jin Alibaba Group
Link to publication DOI Media Attached
18:00
20m
Talk
Gradual Verification of Recursive Heap Data Structures
OOPSLA
Jenna Wise Carnegie Mellon University, Johannes Bader Jane Street, Cameron Wong Jane Street, Jonathan Aldrich Carnegie Mellon University, Éric Tanter University of Chile, Joshua Sunshine Carnegie Mellon University
Link to publication DOI Media Attached

Wed 18 Nov

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

05:00 - 06:20
T-6AOOPSLA at SPLASH-I
Chair(s): Michael Pradel University of Stuttgart, Germany, Konstantinos Kallas University of Pennsylvania
05:00
20m
Talk
Flow2Vec: Value-Flow-Based Precise Code EmbeddingDistinguished Paper
OOPSLA
Yulei Sui University of Technology Sydney, Xiao Cheng Beijing University of Posts and Telecommunications, Guanqin Zhang University of Technology Sydney, Haoyu Wang Beijing University of Posts and Telecommunications
Link to publication DOI Media Attached
05:20
20m
Talk
FlowCFL: Generalized Type-Based Reachability Analysis: Graph Reduction and Equivalence of CFL-Based and Type-Based Reachability
OOPSLA
Ana Milanova Rensselaer Polytechnic Institute
Link to publication DOI Media Attached
05:40
20m
Talk
Hidden Inheritance: An Inline Caching Design for TypeScript Performance
OOPSLA
Zhefeng Wu Alibaba Group, Zhe Sun Alibaba Group, Kai Gong Alibaba Group, Lingyun Chen Alibaba Group, Bin Liao Alibaba Group, Yihua Jin Alibaba Group
Link to publication DOI Media Attached
06:00
20m
Talk
Gradual Verification of Recursive Heap Data Structures
OOPSLA
Jenna Wise Carnegie Mellon University, Johannes Bader Jane Street, Cameron Wong Jane Street, Jonathan Aldrich Carnegie Mellon University, Éric Tanter University of Chile, Joshua Sunshine Carnegie Mellon University
Link to publication DOI Media Attached