The analysis computes an approximation of return continuations of each
known function. We present a very simple linear-time analysis that
uses the term labels to represent abstract continuations. The
analysis uses a simple notion of escaping function - if a function
name is mentioned in a non-application rĂ´le, it is regarded as
escaping and we define its return continuation to be .
We define an abstract domain of return continuations:
Given an expression and its abstract continuation, the analysis
computes a map from variables (in particular, function names)
to abstract continuations:
The analysis itself is defined as follows:
The analysis for a whole program is defined as follows:
So, for our example, we have: