(redirected from Control flow graph)
Also found in: Encyclopedia, Wikipedia.
Category filter:
CFGConfiguration (File Name Extension)
CFGControl Flow Graph
CFGCertificat de Formation Générale (French: General Education Certificate)
CFGContext-Free Grammar
CFGCharity Finance Group (UK)
CFGClub for Growth
CFGContext Free Grammars
CFGConfiguration File
CFGCienfuegos, Cuba (city/airport code)
CFGCondor Flugdienst GmbH (German airline)
CFGCritical Friends Groups (National School Reform Faculty)
CFGCommunity Financial Group (Marlborough, MA)
CFGClear Float Glass
CFGCertificate for Foreign Government (US FDA)
CFGConsumer Focus Group (various organizations)
CFGCross Florida Greenway
CFGClient Facing Group
CFGCentrex Feature Gateway (Lucent)
CFGCondor Flugdienst, Germany (ICAO code)
CFGCarl-Friedrich-Gauss Schule (German school, Hemmingen, lower Saxony)
CFGCreep-Feed Grinding (material processing)
CFGCowan Financial Group (New York, NY)
CFGComptabilité Finance Gestion (French accounting firm)
CFGCubic Feet Gas (measurement)
CFGConstant Frequency Generator
CFGConseil Formation Gestion (French business consulting firm)
CFGColdFusion Guru
CFGClan Français de la Guerre (French gaming clan)
CFGCarr Financial Group (Worcester, MA)
CFGCenterfold Girl
CFGCustomer-Focused Government
CFGCost Factor Generator
CFGComité Français Géosynthétique (French: French Geosynthetics Committee)
Copyright 1988-2018, All rights reserved.
References in periodicals archive ?
In the usual signal method, the control flow graph of the program is hidden.
Malware variant detection using similarity search over sets of control flow graphs. In: TrustCom, pp: 181e9.
* Our work is the first to update the signatures at the directed edges instead of at the nodes of control flow graph.
Consequently, while this technique can verify the internal consistency of a control flow graph for a portion of the program, it does not necessarily advance the discovery of subroutine entry points.
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.
Unreachable code analysis involves a straightforward depth-first traversal of the control flow graph, and is performed as soon as the control flow graph of the program has been computed.
Execution paths are typically constructed using a directed-graph representation of the program segment called a control flow graph (see [1] for a detailed description).
The proposed technique is based on the concepts of the dominance relations between nodes of the program's control flow graph. This technique aims to cover a subset of statements (nodes of the program's control flow graph) that guarantees the coverage of all statements of the tested program.
--[CFN.sub.p]: the largest number of nodes in a control flow graph in any procedure;
Each WORKBENCH component provides reusable data structures and functions for representing, displaying, and manipulating a particular kind of program information--for example, structure charts, control flow graphs, and coding standards violations.
--B has exactly n predecessors in the control flow graph (one for each operand of the [Phi]),
* A path P in a control flow graph G is a sequence of vertices <V.sub.0,V.sub.1,...,V.sub.j>, such that there is an edge from V.sub.i to V.sub.i + 1 for i = 0,...,j-1.