About: Control-flow graph

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Control-flow graph Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdfs:label	Control-flow graph (en)
rdfs:comment	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. (en)
dbp:wikiPageUsesTemplate	dbt:Commons_category dbt:Expert_needed dbt:Main dbt:More_citations_needed dbt:Multiple_issues dbt:Reflist dbt:Short_description
Subject	Application-specific graphs Compiler construction Control-flow analysis Modeling languages
Link from a Wikipage to an external page	http://compilers.cs.ucla.edu/avrora/cfg.html http://www.ucw.cz/~hubicka/papers/proj/node6.html%23SECTION02420000000000000000 https://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15745-s02/public/doc/cfg.html https://gcc.gnu.org/onlinedocs/gccint/Control-Flow.html
thumbnail	wiki-commons:Special:FilePath/Some_types_of_control_flow_graphs.svg?width=300
foaf:depiction
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Control-flow_graph?oldid=1072228345&ns=0
Wikipage page ID	43653 (xsd:integer)
page length (characters) of wiki page	11731 (xsd:nonNegativeInteger)
Wikipage revision ID	1072228345 (xsd:integer)
Link from a Wikipage to another Wikipage	Flowchart Frances Allen Program dependence graph Vertex (graph theory) Abstract syntax tree Adjacency matrix Basic block Static program analysis Static single assignment form Unreachable code Branch (computer science) Application-specific graphs Compiler construction Control-flow analysis Glossary of graph theory Jump threading Modeling languages Directed acyclic graph Directed graph Dominator (graph theory) Zdeněk Dvořák Cyclomatic complexity Compiler Computer program Computer science Constant folding Control-flow diagram Control flow Control flow analysis Edge contraction Optimizing compiler Data-flow analysis Goto Graph Depiction Depth-first search Exception handling Execution (computing) Halting problem Infinite loop Intermediate representation Structured programming Loop-invariant code motion Reachability Reese Prosser
has abstract	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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Control-flow_graph
is Wikipage redirect of	Control flow graph Flow control diagrams
is Link from a Wikipage to another Wikipage of	Flow graph Flowchart Abstract syntax tree Activity diagram Basic block Basis path testing CFG CPAchecker Call graph Directed graph Disassembler Dominator (graph theory) Dr. Garbage Community Cyclomatic complexity Decision-to-decision path List of graphical methods List of pioneers in computer science Code coverage Compiler Constant folding Control-flow diagram Control flow Control flow analysis Control flow graph EiffelStudio

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software