SVF: interprocedural static value-flow analysis in LLVM
By Yulei Sui, Jingling Xue. International Conference on Compiler Construction, 2016
515 citations recorded by the source corpus.
This paper presents SVF, a tool that enables scalable and precise interprocedural Static Value-Flow analysis for C programs by leveraging recent advances in sparse analysis. SVF, which is fully implemented in LLVM, allows value-flow construction and pointer analysis to be performed in an iterative manner, thereby providing increasingly improved precision for both. SVF accepts points- to information generated by any pointer analysis (e.g., Andersen’s analysis) and constructs an interprocedural memory SSA form, in which the def-use chains of both top-level and address-taken variables are captured. Such value-flows can be subsequently exploited to support various forms of program analysis or enable more precise pointer analysis (e.g., flow-sensitive analysis) to be performed sparsely. By dividing a pointer analysis into three loosely coupled components: Graph, Rules and Solver, SVF provides an extensible interface for users to write their own solutions easily. SVF is publicly available at http://unsw-corg.github.io/SVF.
Subfields: Hardware and Architecture, Software, Signal Processing
View Paper: https://www.semanticscholar.org/paper/e988198a8b5b7a9835d8f97e108928ed8ad8855c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Software
In Signal Processing
Citations in the corpus
- Hawkeye: Towards a Desired Directed Grey-box Fuzzer (2018, methodology): “As we rely on the lightweight program analysis tools like LLVM and SVF [41] to calculate the distance, possible issues of these tools may affect the final results.”