Programs are becoming increasingly complex and typically contain an abundance of unneeded features, which could severely harm performance and security. Recently, we have witnessed a surge of debloating techniques that aim to create a reduced version of a program by eliminating the unneeded features therein. To debloat a program, most existing techniques require a usage profile of the program, typically provided as a set of inputs $I$. Unfortunately, these techniques tend to generate a reduced program that is overfitted to $I$ and thus fails to behave correctly for other inputs. To address this limitation of existing techniques, we propose DomGad, which has two main advantages over existing debloating approaches. First, it produces a reduced program that is guaranteed to work for entire subdomains, rather than for specific inputs. Second, it uses stochastic optimization to generate reduced programs that achieve a close-to-optimal trade-off between size reduction and generality (i.e., extent to which the reduced program is able to correctly handle inputs in its whole domain). To assess the effectiveness of DomGad, we applied our approach to a benchmark of ten Unix utility programs. Our results are promising, as they show that DomGad could produce debloated programs that achieve, on average, a 50% code reduction and 95% generality. Our results also show that DomGad performs well when compared with two state-of-the-art debloating approaches.
Tue 22 Sep Times are displayed in time zone: (UTC) Coordinated Universal Time
16:00 - 17:00: Maintenance and Evolution (3)Research Papers / Tool Demonstrations at Koala Chair(s): Yongjie ZhengCalifornia State University San Marcos | |||
| 16:00 - 16:20 Talk | Subdomain-Based Generality-Aware Debloating Research Papers Qi XinGeorgia Institute of Technology, Myeongsoo KimGeorgia Institute of Technology, Qirun ZhangGeorgia Institute of Technology, USA, Alessandro OrsoGeorgia Tech | ||
| 16:20 - 16:40 Talk | Revisiting the relationship between fault detection, test adequacy criteria, and test set size. Research Papers Yiqun ChenUniversity of Washington, Rahul GopinathCISPA Helmholtz Center for Information Security, Anita TadakamallaGeorge Mason University, USA, Michael D. ErnstUniversity of Washington, USA, Reid HolmesUniversity of British Columbia, Gordon FraserUniversity of Passau, Paul AmmannGeorge Mason University, USA, René JustUniversity of Washington, USA | ||
| 16:40 - 16:50 Talk | WASim: Understanding WebAssembly Applications through Classification Tool Demonstrations | ||
| 16:50 - 17:00 Talk | Sosed: a tool for finding similar software projects Tool Demonstrations Egor BogomolovJetBrains Research, Yaroslav GolubevJetBrains Research, ITMO University, Artyom LobanovJetBrains Research, Vladimir KovalenkoJetBrains Research, JetBrains N.V., Timofey BryksinJetBrains Research, Saint Petersburg State University | ||
