Control-flow analysis: Difference between revisions

Revision as of 15:14, 30 September 2014

Latest revision as of 22:15, 5 August 2024

(16 intermediate revisions by 14 users not shown)

Line 1:

{{Short description|Compiler technique}}

{{cleanupCleanup-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}}

For many [[imperative programming language]]s, the control flow{{which|date=July 2014}} of a program is explicit in a program's source code.{{dubious|date=July 2014}} As a result, [[interprocedural analysis|interprocedural]] control-flow analysis implicitly usually refers to a [[static analysis]] technique for determining the receiver(s)receivers of function or method calls in computer programs written in a [[higher-order programming language]].{{dubious|date=July 2014}} For example, in a programming language with [[higher-order functionsfunction]]s like [[Scheme (programming language)|Scheme]], the target of a function call may not be explicit: in the isolated expression

<sourcesyntaxhighlight lang="scheme">

(lambda (f) (f x))

</syntaxhighlight>

</source>

it is unclear to which procedure <code>f</code> may refer. To determine the possible targets, a control-flow analysis must consider where this expression could be invoked, and what argument it may receive.

it is unclear to which procedure <code>f</code> may refer. To determine the possible targets, aA control-flow analysis must consider where this expression could be invoked, and what argument it may receive to determine the possible targets.

Techniques such as [[abstract interpretation]], [[constraint solving]] and [[type system]]s may be used to compute control-flow analysis{{which|date=July 2014}}.<ref>Flemming Nielson, Hanne Riis Nielson & Chris Hankin (1999). ''Principles of Program Analysis''. Springer.</ref>{{page needed|date=July 2014}}

Techniques such as [[abstract interpretation]], [[constraint solving]], and [[type system]]s may be used to computefor control-flow analysis{{which|date=July 2014}}.<ref>{{cite book |author-first1=Flemming |author-last1=Nielson, |author-first2=Hanne Riis |author-last2=Nielson &|author2-link=Hanne Riis Nielson|author-first3=Chris |author-last3=Hankin (1999). ''|title=Principles of Program Analysis''. |publisher=[[Springer. Science+Business Media]] |date=2005}}</ref>{{page needed|date=July 2014}}

== See also ==

== See also ==

* [[Control-flow diagram]] (CFD)

* [[Data-flow analysis]]

* [[Cartesian product|Cartesian product algorithm]]

* [[Pointer analysis]]

Line 18 ⟶ 22:

{{reflist}}

== External links ==

{{Commonscat|Control-flow analysis}}

* [https://web.archive.org/web/20140728203154/http://pages.cs.wisc.edu/~cs701-1/NOTES/3.CONTROL-FLOW-ANALYSIS.html for textbook intraprocedural CFA in imperative languages]

* http://cs.au.dk/~jmi/Midtgaard-CSur-final.pdf CFA in functional programs (survey)

*[http://janmidtgaard.dk/papers/Midtgaard-CSur-final.pdf CFA in functional programs (survey)]
*[http://cgi.di.uoa.gr/~smaragd/kcfa-pldi10.pdf for the relationship between CFA analysis in functional languages and points-to analysis in imperative/OOP languages]

{{Compiler optimizations}}

[[Category:Control-flow analysis| ]]