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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

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.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
Mentioned in ?
References in periodicals archive ?
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.
Therefore, an extended control flow model called Concurrent Control Flow Graph (CCFG) has been introduced in [32].
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.
This new fitness function depends on the concepts of the dominance relations between nodes of the program's control flow graph. The algorithm uses this new fitness function to evaluate each test case by executing the program with it as input, and recording the traversed nodes in the program that are covered by this test case.
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.