Existential context sensitivity in label flow analysis.
We formalized a framework for flow analysis that supports existentially
quantified types. Context sensitivity is achieved efficiently by
encoding of the analysis as a CFL reachability problem.
In proving our system's soundness, we have formalized a "copying" system
that simulates inlining of functions in every calling context.
We proved the copying system sound and reduced our (much more efficient)
CFL-reachability formulation to it.