Control-flow graph
id:
control-flow-graph-166-6276961
title:
Control-flow graph
text:
In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a program during its execution. The control-flow graph was discovered by Frances E. Allen, who noted that Reese T. Prosser used boolean connectivity matrices for flow analysis before. The CFG is essential to many compiler optimizations and static-analysis tools.
brand slug:
wiki
category slug:
encyclopedia
description:
Graphical representation of a computer program or algorithm
original url:
https://en.wikipedia.org/wiki/Control-flow_graph
date created:
2002-03-10T20:58:59Z
date modified:
2024-08-29T20:04:23Z
main entity:
{"identifier":"Q1187693","url":"https://www.wikidata.org/entity/Q1187693"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/bd/Rust_MIR_CFG.svg","width":844,"height":1263}
fields total:
13
integrity:
16