提纲动机程序静态分析.pptVIP

* * * * * * * * * * * * * * * * * * Example Forwards vs. backwards A forwards analysis is one that for each program point computes information about the past behavior. Examples of this are available expressions and reaching definitions. Calculation: predecessors of CFG nodes. A backwards analysis is one that for each program point computes information about the future behavior. Examples of this are liveness and very busy expressions. Calculation: successors of CFG nodes. May vs. Must A may analysis is one that describes information that may possibly be true and, thus, computes an upper appr