Boosting Path-Sensitive Value Flow Analysis via Removal of Redundant Summaries
Yongchao Wang, Yuandao Cai, Charles Zhang

TL;DR
This paper introduces a novel method to identify and eliminate redundant summaries in path-sensitive value flow analysis, significantly improving scalability and efficiency without sacrificing accuracy.
Contribution
It presents the first approach to effectively remove redundant summaries in value flow analysis, reducing computational overhead and memory usage while maintaining soundness.
Findings
Reduced analysis time by up to 45% and memory by 27%.
Identified nearly 80% of redundant summaries efficiently.
Achieved an average performance gain of over 600 times in large programs.
Abstract
Value flow analysis that tracks the flow of values via data dependence is a widely used technique for detecting a broad spectrum of software bugs. However, the scalability issue often deteriorates when high precision (i.e., path-sensitivity) is required, as the instantiation of function summaries becomes excessively time- and memory-intensive. The primary culprit, as we observe, is the existence of redundant computations resulting from blindly computing summaries for a function, irrespective of whether they are related to bugs being checked. To address this problem, we present the first approach that can effectively identify and eliminate redundant summaries, thereby reducing the size of collected summaries from callee functions without compromising soundness or efficiency. Our evaluation on large programs demonstrates that our identification algorithm can significantly reduce the time…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsManufacturing Process and Optimization
