In the proposed method, first, the information of the
control flow graph is hidden by the signal method, and then, the dispatcher of the signal, which reconstructs the original
control flow graph from the hidden one, is added as new information to the file and encrypted to preclude access by hackers.
3 shows an example of a
control flow graph and the result of the transformation.
Once identified, they apply a novel speculative disassembly technique in which they create an over-approximate
control flow graph from all possible branch instructions within a subroutine boundary.
If the second assumption does not hold, the constructed
control flow graph may contain (safe) imprecisions which may cause less effective (size) optimizations.
To construct an execution path for analysis, syntactic structures (listed in Table 1 in the following section) are matched against the
control flow graph. A syntactic structure is a template or sequenced pattern of relevant events - all the events that could logically have caused a failure downstream.
The space complexity to construct the SEG for a procedure is [Theta](E), where E is the number of edges in the
control flow graph [Sreedhar and Gao 1995].
Given a program and its
control flow graph, the program can be put in SSA form by assigning a unique version to each definition of a variable and placing [Phi] operators defining additional versions in basic blocks that are reached by multiple definitions of the same original variable.
An appealing property to determine the loop control vertices in a
control flow graph is that any execution path through a function can be constructed once the loop vertices are known.
The block branch diagram of an object-oriented program contains the
control flow graph of each of the class methods, and presents a static implementation view of the program.
Given a vertex [a.sub.0] in a
control flow graph, consider [a.sub.0]'s ancestors in Havlak's loop nesting forest.