Interprocedural dataflow analysis via graph reachability:(通过图可达性过程间数据流分析).pdfVIP

  • 29
  • 0
  • 约12.38万字
  • 约 14页
  • 2017-06-30 发布于浙江
  • 举报

Interprocedural dataflow analysis via graph reachability:(通过图可达性过程间数据流分析).pdf

Interprocedural dataflow analysis via graph reachability:(通过图可达性过程间数据流分析)

Precise Interprocedural Dataflow Analysis via Graph Reachability Thomas Reps,† Susan Horwitz,† and Mooly Sagiv†, ‡ University of Wisconsin Abstract kill” problems), which include reaching definitions, The paper shows how a large class of interprocedural available expressions, and live variables [22]. dataflow-analysis problems can be solve

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档