Finding Cuts in Static Analysis Graphs to Debloat Software
This program is tentative and subject to change.
As software projects grow increasingly more complex, debloating gains traction. While static analyses yield a coarse over-approximation of reachable code, approaches based on dynamic execution traces risk program correctness. By allowing the developer to reconsider only a few methods and still achieve a significant reduction in code size, cut-based debloating could minimize the risk. In this paper, we therefore propose the idea of finding small cuts in rule graphs of static analyses. After introducing an analysis with suitable semantics, we discuss how to encode its rules into a directed hypergraph. We then present an algorithm for efficiently finding the most effective single cut in the graph. The execution time of the proposed operations allows for the deployment in interactive tools. Finally, we show that our graph model is able to expose heavy methods worthwhile to reconsider.
This program is tentative and subject to change.
Thu 19 SepDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
13:30 - 14:50 | |||
13:30 20mTalk | Precise Compositional Buffer Overflow Detection via Heap Disjointness Technical Papers Yiyuan Guo The Hong Kong University of Science and Technology, Peisen Yao Zhejiang University, Charles Zhang The Hong Kong University of Science and Technology DOI Pre-print | ||
13:50 20mTalk | Finding Cuts in Static Analysis Graphs to Debloat Software Technical Papers Christoph Blumschein Hasso Plattner Institute, University of Potsdam, Germany, Fabio Niephaus Oracle Labs, Potsdam, Codrut Stancu Oracle Labs, Christian Wimmer Oracle Labs, Jens Lincke University of Potsdam; Hasso Plattner Institute, Robert Hirschfeld University of Potsdam; Hasso Plattner Institute DOI Pre-print | ||
14:10 20mTalk | Scalable, Sound and Accurate Jump Table Analysis Technical Papers Huan Nguyen Stony Brook University, Soumyakant Priyadarshan Stony Brook University, R. Sekar Stony Brook University | ||
14:30 20mTalk | Synthesis of Sound and Precise Storage Cost Bounds via Unsound Resource Analysis and Max-SMT Technical Papers Elvira Albert Complutense University of Madrid, Jesús Correas Complutense University of Madrid, Pablo Gordillo Universidad Complutense de Madrid, Guillermo Román-Díez Universidad Politécnica de Madrid, Albert Rubio Complutense University of Madrid |