Solving Demand Versions of Interprocedural Analysis Problems
Source: University of Copenhagen
This paper concerns the solution of demand versions of interprocedural analysis problems. In a demand version of a program-analysis problem, some piece of summary information (e.g., The dataflow facts holding at a given point) is to be reported only for a single program element of interest (Or a small number of elements of interest). Because the summary information at one program point typically depends on summary information from other points, an important issue is to minimize the number of other points for which (Transient) summary information is computed and/or the amount of information computed at those points.