Revision as of 22:00, 20 July 2014 edit 188.27.81.64 (talk) not it doesn't usually refer to that except in the inter-procedural case ← Previous edit		Revision as of 22:12, 20 July 2014 edit undo 188.27.81.64 (talk) soooo... if this is talking about inter-procedural analysys, aren't you forgetting that you can call stuff through pointers?? Is pointer analysis a trivial problem? Next edit →
Line 18: }}</ref>{{primary source inline}} 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}} For many [[imperative programming language]]s, the control flow{{which}} of a program is explicit in a program's source code.{{dubious}} As a result, [[~~inter-procedural~~interprocedural analysis\|interprocedural]] control-flow analysis implicitly usually refers to a [[static analysis]] technique for determining the receiver(s) of function or method calls in computer programs written in a [[higher-order programming language]]. For example, in a programming language with [[higher-order functions]] like [[Scheme (programming language)\|Scheme]], the target of a function call may not be explicit: in the isolated expression <source lang="scheme"> (lambda (f) (f x))

Control-flow analysis: Difference between revisions