A modified copy-propagation like analysis.
A generic framework for data flow analysis.
Compute liveness information for local variables.
Program points are locations in the program where we want to assert certain properties through data flow analysis, e.g.
Program points are locations in the program where we want to assert certain properties through data flow analysis, e.g. basic blocks.
Compute reaching definitions.
Compute reaching definitions. We are only interested in reaching definitions for local variables, since values on the stack behave as-if in SSA form: the closest instruction which produces a value on the stack is a reaching definition.
A complete lattice.
A data-flow analysis on types, that works on ICode
.
A modified copy-propagation like analysis. It is augmented with a record-like value which is used to represent closures.