Control-flow analysis: Difference between revisions

Revision as of 13:05, 6 September 2012

Revision as of 21:09, 24 September 2012

Line 10:

| doi = 10.1007/3-540-10843-2_10

| pages = 114–128

}}</ref> and Olin Shivers.<ref>{{citation

| last = Shivers

| first = Olin

Line 22:

| year = 1988

| doi = 10.1145/53990.54007

}}</ref>.

In a programming language with [[higher-order functions]] like [[Scheme (programming language)|Scheme]], the target of a function call may not be explicit. For example in the isolated expression:

Line 29:

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.

[[Abstract interpretation]], [[constraint solving]] and [[type system]]s may be used to compute control-flow analysis.