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 ?
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.
A C# Interclass Graph (CIG) is a control flow graph that captures all the affected methods in an ACD.
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.
So, our goal of covering all nodes of the program's control flow graph can be reduced to covering only the set of leaves of the dominator tree.
In this technique, Krinke has extended the control flow graph (CFG) and program dependence graph (PDG) [48] to represent concurrent programs with interference.