A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Demand interprocedural dataflow analysis
1995
Software engineering notes
An exhaustive dataflow analysis algorithm associates with each point in a program a set of "dataflow facts" that are guaranteed to hold whenever that point is reached during program execution. By contrast, a demand dataflow analysis algorithm determines whether a single given dataflow fact holds at a single given point. This paper presents a new demand algorithm for interprocedural dataflow analysis. The new algorithm has three important properties: q It provides precise (meet over all
doi:10.1145/222132.222146
fatcat:vu2itg6pgzfbbnxt7nnarw2gea