control-flow graph

A Dictionary of Computing | 2004 | 475 words | Copyright

control-flow graph A directed graph representing the sequence of execution in a program unit, in which nodes represent branching points or subprogram calls in a program, and arcs represent linear sequences of code. From the control-flow graph an analysis can show

the structure of the program,

starts and ends of program segments,

unreachable code and dynamic halts,

branches from within loops,

entry and exit points for loops,

paths through the program.

See also static analysis.

Cite this article
Pick a style below, and copy the text for your bibliography.

MLA
Chicago
APA

JOHN DAINTITH. "control-flow graph." A Dictionary of Computing. 2004. Encyclopedia.com. 27 May. 2012 <http://www.encyclopedia.com>.

JOHN DAINTITH. "control-flow graph." A Dictionary of Computing. 2004. Encyclopedia.com. (May 27, 2012). http://www.encyclopedia.com/doc/1O11-controlflowgraph.html

JOHN DAINTITH. "control-flow graph." A Dictionary of Computing. 2004. Retrieved May 27, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-controlflowgraph.html

Learn more about citation styles