The aim of the study is to develop static analysis algorithms, to search for all possible sequences of function calls leading to a certain point in the program. To achieve this goal the explicit call graph is analyzed, in which all possible paths between two vertices are searched. The analysis is carried out in two stages: 1) at the preparatory stage, a new graph is constructed based on the call graph, from which excess vertices and arcs are removed; 2) in the second stage, a search is made in the new graph for possible paths from the root node to the given one. Also this paper provides an experimental comparison of the developed algorithms with the closest analogue, the Yen algorithm.
Keywords: static program analysis, call graph, path searching algorithm, Yen's algorithm, call stack