Control flow analysis utilizing function dominator trees

A method for control flow analysis, the method comprising:nacquiring an original function call tree of a program, wherein nodes of the original function call tree represent functions and a parent/child relation between the nodes represents a calling relation;generating a corresponding function dominator tree from the calling relation, wherein nodes of the function dominator tree represent the functions and a parent/child relation between the nodes represents a dominator relation, wherein a first function dominates a second function if all the invocations to the second function are originated by the first function; andsimplifying the original function call tree according to the function dominator tree so as to obtain a simplified function call tree, wherein the simplifying comprises:nidentifying an entry function of a basic function package according to the function dominator tree; andremoving children nodes of a node corresponding to the entry function from the original function call tree so as to obtain the simplified function call tree, wherein the removing comprises deleting the children nodes.

A computer system for control flow analysis, the computer system comprising:na memory; anda processor in communications with the memory, wherein the computer system is configured to perform a method, the method comprising:nacquiring an original function call tree of a program, wherein nodes of the original function call tree represent functions and a parent/child relation between the nodes represents a calling relation;generating a corresponding function dominator tree from the calling relation, wherein nodes of the function dominator tree represent the functions and a parent/child relation between the nodes represents a dominator relation, wherein a first function dominates a second function if all the invocations to the second function are originated by the first function; andsimplifying the original function call tree according to the function dominator tree so as to obtain a simplified function call tree, wherein the simplifying comprises:nidentifying an entry function of a basic function package according to the function dominator tree; andremoving children nodes of a node corresponding to the entry function from the original function call tree so as to obtain the simplified function call tree, wherein the removing comprises deleting the children nodes.

A computer program product for control flow analysis, the computer program product comprising:na non-transitory computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising:nacquiring an original function call tree of a program, wherein nodes of the original function call tree represent functions and a parent/child relation between the nodes represents a calling relation;generating a corresponding function dominator tree from the calling relation, wherein nodes of the function dominator tree represent the functions and a parent/child relation between the nodes represents a dominator relation, wherein a first function dominates a second function if all the invocations to the second function are originated by the first function; andsimplifying the original function call tree according to the function dominator tree so as to obtain a simplified function call tree, wherein the simplifying comprises:nidentifying an entry function of a basic function package according to the function dominator tree; andremoving children nodes of a node corresponding to the entry function from the original function call tree so as to obtain the simplified function call tree, wherein the removing comprises deleting the children nodes.