Control-flow analysis: Difference between revisions

Revision as of 17:38, 28 February 2019

Revision as of 19:45, 30 April 2019

Line 1:

{{Short description|compiler technique}}

{{cleanup-rewrite|date=July 2014}}

In [[computer science]], '''control-flow analysis''' ('''CFA''') is a [[static code analysis|static-code-analysis]] technique for determining the [[control flow]] of a program. The control flow is expressed as a [[control-flow graph]] (CFG). For both [[functional programming language]]s and [[object-oriented programming language]]s, the term CFA, and elaborations such as ''k''-CFA, refer to specific algorithms that compute control flow.{{dubious|date=July 2014}}