DLS
Sun 15 - Fri 20 November 2020 Online Conference
co-located with SPLASH 2020
Thu 19 Nov 2020 03:40 - 04:00 at SPLASH-III - 4 Chair(s): Caterina Urban, Shigeru Chiba
Wed 18 Nov 2020 15:40 - 16:00 at SPLASH-III - 4 Chair(s): Jeremy G. Siek, Antoine Miné

Control dependency is a fundamental concept in many program analyses, transformation, parallelization, and compiler optimization techniques. An overwhelming number of definitions of control dependency relations are found in the literature that captures various kinds of program control flow structures. Weak and strong control closure (WCC and SCC) relations capture nontermination insensitive and sensitive control dependencies and subsume all previously defined control dependency relations. In this paper, we have shown that static dependency-based pro-gram slicing requires the repeated computation of WCC and SCC. The state-of-the-art WCC algorithm provided by Danicic et al. has the cubic worst-case complexity in terms of the size of the control flow graph and is a major obstacle to be used in static program slicing. We have provided a simple yet efficient method to compute the minimal WCC which has the quadratic worst-case complexity and proved the correctness of our algorithms. We implemented ours and the state-of-the-art algorithms in the Clang/LLVM compiler framework and run experiments on a number of SPEC CPU 2017 benchmarks. Our method performs a maximum of 23.8 times and on average 10.6 times faster than the state-of-the-art method. The performance curves of our WCC algorithm for practical applications are closer to the NlogN curve in the microsecond scale. Evidently, we improve the practical performance of WCC computation by an order of magnitude.

preprint (sas20.pdf)853KiB

Wed 18 Nov
Times are displayed in time zone: Central Time (US & Canada) change

15:00 - 16:20: 4SAS / DLS 2020 at SPLASH-III +12h
Chair(s): Jeremy G. SiekIndiana University, USA, Antoine MinéSorbonne Université
15:00 - 15:20
Research paper
SAS
Sung Kook KimUniversity of California, Davis, Arnaud J. VenetFacebook, Aditya V. ThakurUniversity of California, Davis
Pre-print Media Attached
15:20 - 15:40
Talk
DLS 2020
Tobias KohnUniversity of Cambridge, UK, Guido van RossumPython Software Foundation, Gary Brandt Bucher, IIResearch Affiliates, LLC, Talin, Ivan LevkivskyiDropbox Ireland
Link to publication DOI Media Attached
15:40 - 16:00
Research paper
SAS
Abu Naser MasudMalardalen University
Media Attached File Attached
16:00 - 16:20
Talk
DLS 2020
Milod KazerounianUniversity of Maryland, College Park, Brianna M. RenUniversity of Maryland, Jeffrey S. FosterTufts University
Link to publication DOI Pre-print Media Attached

Thu 19 Nov
Times are displayed in time zone: Central Time (US & Canada) change

03:00 - 04:20: 4SAS / DLS 2020 at SPLASH-III
Chair(s): Caterina UrbanÉcole normale supérieure, Shigeru ChibaThe University of Tokyo
03:00 - 03:20
Research paper
SAS
Sung Kook KimUniversity of California, Davis, Arnaud J. VenetFacebook, Aditya V. ThakurUniversity of California, Davis
Pre-print Media Attached
03:20 - 03:40
Talk
DLS 2020
Tobias KohnUniversity of Cambridge, UK, Guido van RossumPython Software Foundation, Gary Brandt Bucher, IIResearch Affiliates, LLC, Talin, Ivan LevkivskyiDropbox Ireland
Link to publication DOI Media Attached
03:40 - 04:00
Research paper
SAS
Abu Naser MasudMalardalen University
Media Attached File Attached
04:00 - 04:20
Talk
DLS 2020
Milod KazerounianUniversity of Maryland, College Park, Brianna M. RenUniversity of Maryland, Jeffrey S. FosterTufts University
Link to publication DOI Pre-print Media Attached