control flow graph


Also found in: Acronyms, Wikipedia.

control flow graph

[kən¦trōl ′flō ‚graf]
(computer science)
A graph describing the logic structure of a software module, in which the nodes represent computational statements or expressions, the edges represent transfer of control between nodes, and each possible execution path of the module has a corresponding path from the entry to the exit node of the graph.

control flow graph

A pictorial representation of the logic in a software module. The module must have an entry and exit point and be callable by another program.
Mentioned in ?
References in periodicals archive ?
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.
Since a CFG represents the control flow information of only a single method, the concepts of Inter-procedural Control Flow Graph (ICFG) and Class Control Flow Graph (CCFG) have been introduced to represent control flow of multi-function programs and object-oriented programs respectively.
In squeeze, we construct the interprocedural control flow graph for a program as follows:
To construct an execution path for analysis, syntactic structures (listed in Table 1 in the following section) are matched against the control flow graph.
It is clear that, the union of nodes of this set of dominance paths is the set of all nodes of the program's control flow graph (i.
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].
In this technique, Krinke has extended the control flow graph (CFG) and program dependence graph (PDG) [48] to represent concurrent programs with interference.
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.
A path P in a control flow graph G is a sequence of vertices <V.
This algorithm utilizes the DJ graph, which essentially combines the control flow graph and its dominator tree into one structure.
CNS duplicates nodes of the control flow graph to obtain reducible control flow graphs.