Optimization of program recursive function calls analysis method

Аннотация

Static analysis can be classified into intra-procedural analysis and inter-procedural analysis-by-analysis objects. Inter-procedural analysis need to analyze the whole program adopting bottom-up parsing algorithms. Inter-procedural analysis can be converted to intra-procedural analysis by logging the context of follower’s function call in bottom-up analysis. However, the existence of recursive function calls in program increases the difficulty of inter-procedural analysis, which affects the detection accuracy of static analysis to some extent. An optimal method for analyzing the recursive function calls of program is presented in this paper. This method can lift the recursive function calls in function call graph of the program to be analyzed on the premise that vital function calls will be preserved. In this way, the false negative rate and false positive rate of program static analysis can be reduced and the accuracy of program security check can be improved.