A Constraint-based Analysis Method to Simplify Control Flow Graph
LI Jin-nu
Abstract
LI Jin-nu
Abstract
A lot of static code analysis methods take control flow graph as basis.This paper uses a constraint-based analysis techniques,including constraint-based 0-CFA,adding data flow analysis method to construct the set of constraints,using fixed-point algorithm to find the smallest solution of the set of constraints,and generates a control flow graph,reduction unreachable branch,generates less redundant control flow graph.The control flow graph,generated in this article as the basis of the static code analysis methods to improve the efficiency of static code analysis,can reduce the rate of false positives.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A lot of static code analysis methods take control flow graph as basis.This paper uses a constraint-based analysis techniques,including constraint-based 0-CFA,adding data flow analysis method to construct the set of constraints,using fixed-point algorithm to find the smallest solution of the set of constraints,and generates a control flow graph,reduction unreachable branch,generates less redundant control flow graph.The control flow graph,generated in this article as the basis of the static code analysis methods to improve the efficiency of static code analysis,can reduce the rate of false positives.
Key concepts: Computer science, Control flow graph, Data-flow analysis, Static analysis, Control flow analysis, Graph, Call graph, Control flow