Construct · 1 fields · 1 citations

control-flow graph: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Software engineering

a directed graph whose nodes are basic blocks of a program and whose edges are possible transfers of control, the base of program analysis.

In software engineering, control-flow graph refers to a directed graph whose nodes are basic blocks of a program and whose edges are possible transfers of control, the base of program analysis. This meaning comes from Allen (1970) in ACM SIGPLAN Notices.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how control-flow graph sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

base3 fields · 4 citationsjingle · one word, three constructs control-flow integrity1 fields · 1 citationsanchor · a standalone construct control4 fields · 5 citationsjingle · one word, four constructs

References

Allen, F. E. (1970). Control flow analysis. ACM SIGPLAN Notices, 5(7), 1-19. https://doi.org/10.1145/390013.808479

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct