Boosting Path-Sensitive Value Flow Analysis Via Removal of Redundant Summaries

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 be...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings / International Conference on Software Engineering s. 1781 - 1792
Hlavní autori: Wang, Yongchao, Cai, Yuandao, Zhang, Charles
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 26.04.2025
Predmet:
Boosting
Computer bugs
inter-procedural analysis
Performance gain
Scalability
Software
Software engineering
value flow analysis
ISSN:1558-1225
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 and memory overhead of the state-of-the-art value flow analysis by \mathbf{4 5 \%} and \mathbf{2 7 \%} , respectively. Furthermore, the identification algorithm demonstrates remarkable efficiency by identifying nearly 80 % of redundant summaries while incurring a minimal additional overhead. In the largest mysqld project, the identification algorithm reduces the time by 8107 seconds ( \mathbf{2. 2 5} hours) with a mere \mathbf{1 7. 3 1} seconds of additional overhead, leading to a ratio of time savings to paid overhead (i.e., performance gain) of \mathbf{4 6 8. 4 8} \times . In total, our method attains an average performance gain of 632.1 \times .
ISSN:1558-1225
DOI:10.1109/ICSE55347.2025.00195