SPLASH 2021
Sun 17 - Fri 22 October 2021 Chicago, Illinois, United States
Wed 20 Oct 2021 17:00 - 19:00 at Zurich A - Posters
Thu 21 Oct 2021 13:54 - 15:10 at Zurich E - Talks

The world of modern web applications is continuously evolving and getting increasingly reliant on web frameworks to support their ever-changing fast-paced needs. This necessitates the realization of efficient static analysis methodologies for the purpose of bug finding and security auditing of such applications. Moreover, the majority of these frameworks are written in JavaScript, which itself is difficult to analyze due to its extremely dynamic nature. The primary goal of this work is to study the effectiveness of the present state-of-the-art call graph approaches for JavaScript and propose techniques to enhance them such that they discover more of the crucial functions and call edges in modern, framework-based JavaScript applications. Ideally, these new techniques must enhance function and call edge discovery without much impact on precision and scalability.

Wed 20 Oct

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

17:00 - 19:00
17:00
2h
Poster
Implementation of an End-to-End Gradual Verification System
Student Research Competition
Hemant Gouni University of Minnesota at Twin Cities, Conrad Zimmerman Brown University
DOI
17:00
2h
Poster
Towards Decidable and Expressive DOT
Student Research Competition
Sophia Roshal Cornell University; Carnegie Mellon University
DOI
17:00
2h
Poster
Programming-by-Example by Programming-by-Example: Synthesis of Looping Programs
Student Research Competition
Shmuel Berman Columbia University
DOI
17:00
2h
Poster
Avoiding Monomorphization Bottlenecks with Phase-Based Splitting
Student Research Competition
Sophie Kaleba University of Kent
DOI
17:00
2h
Poster
A Study of Call Graph Effectiveness for Framework-Based Web Applications
Student Research Competition
Madhurima Chakraborty University of California at Riverside
DOI
17:00
2h
Poster
Run-Time Data Analysis to Drive Compiler Optimizations
Student Research Competition
DOI
17:00
2h
Poster
Edgeworth: Authoring Diagrammatic Math Problems using Program Mutation
Student Research Competition
Hwei-Shin Harriman Olin College of Engineering; Carnegie Mellon University
DOI
17:00
2h
Poster
Source Code Authorship Attribution using File Embeddings
Student Research Competition
Alina Bogdanova Innopolis University
DOI
17:00
2h
Poster
Run-Time Data Analysis in Dynamic Runtimes
Student Research Competition
Lukas Makor JKU Linz
DOI
17:00
2h
Poster
Can Reactive Synthesis and Syntax-Guided Synthesis Be Friends?
Student Research Competition
Wonhyuk Choi Columbia University
DOI

Thu 21 Oct

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

13:50 - 15:10
TalksStudent Research Competition at Zurich E

Talks to be selected in the poster session on Wednesday.

13:50
80m
Poster
Towards Decidable and Expressive DOT
Student Research Competition
Sophia Roshal Cornell University; Carnegie Mellon University
DOI
13:51
79m
Poster
Source Code Authorship Attribution using File Embeddings
Student Research Competition
Alina Bogdanova Innopolis University
DOI
13:52
78m
Poster
Programming-by-Example by Programming-by-Example: Synthesis of Looping Programs
Student Research Competition
Shmuel Berman Columbia University
DOI
13:53
77m
Poster
Edgeworth: Authoring Diagrammatic Math Problems using Program Mutation
Student Research Competition
Hwei-Shin Harriman Olin College of Engineering; Carnegie Mellon University
DOI
13:54
76m
Poster
A Study of Call Graph Effectiveness for Framework-Based Web Applications
Student Research Competition
Madhurima Chakraborty University of California at Riverside
DOI
13:55
75m
Poster
Run-Time Data Analysis to Drive Compiler Optimizations
Student Research Competition
DOI
13:56
74m
Poster
Run-Time Data Analysis in Dynamic Runtimes
Student Research Competition
Lukas Makor JKU Linz
DOI