flow graph

flow graph

[′flō ‚graf]
(computer science)
A directed graph that represents a computer program, wherein a node in the graph corresponds to a block of sequential code and branches correspond to decisions taken in the program.
(system engineering)
signal-low graph
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
SSAPRE chooses a computationally optimal placement, i.e., no safe placement can result in fewer evaluations of the expression along any path from entry to exit in the control flow graph.
The standard ground rules for eliminating go to's require that we preserve the flow graph of the program, but they allow us to completely rewrite the control structures that glue together the program's atomic tests and actions.
And so, compared to the later 3.7 releases, nothing has fundamentally modified the way one develops signal processing systems with GNU Radio: You write blocks, and you combine blocks to be part of a larger signal processing flow graph.'
The signal method is an obfuscation method in which control flow graph opcodes (operation codes) are hidden [8-10].
In particular, taint propagation flow graph has been established to backtrack taint data and locate its specific offset within taint source file.
Caption: Figure 6: GRC flow graph for SDR card to receive two signals at two ports.
The GNU radio based transmitter flow graph shown in Figure 5 is designed to transmit a real time video signal which is acting as a PU.
Composite Flow Graph Technique for the Solution of Multiloop, Multisampler, Sampled Systems IRE Trans.
"Neural networks are a series of predetermined operations; it's not like a user interacting with a system, it's a set of instructions that can be described as a data flow graph," Khosrowshahi told ZDNet.
In [3], authors have analyzed the effects of compiler optimization (in three levels), removing symbol information and applying basic binary obfuscation methods (such as instruction replacement and control flow graph obfuscation) on several features mainly obtained from disassembling and decompiling the executable binaries (e.g.
Among their topics are finding an optimal set of breakpoint locations in a control flow graph, evaluating an auxiliary tone-based medium access control scheme for wireless and ad hoc networks with directional antennas, watermarking three-dimensional triangular mesh models using ordered ring facets, and the tool-supported specification of a wind turbine.
Data flow analysis is applied on the flow graph obtained from the source code that is used to identify the interactions.