Elimination algorithms for data flow analysis

• Barbara G. Ryder

  Rutgers Univ., New Brunswick, NJ

• Marvin C. Paull

  Rutgers Univ., New Burnswick, NJ

抄録

A unified model of a family of data flow algorithms, called elimination methods, is presented. The algorithms, which gather information about the definition and use of data in a program or a set of programs, are characterized by the manner in which they solve the systems of equations that describe data flow problems of interest. The unified model provides implementation-independent descriptions of the algorithms to facilitate comparisons among them and illustrate the sources of improvement in worst case complexity bounds. This tutorial provides a study in algorithm design, as well as a new view of these algorithms and their interrelationships.

収録刊行物

• ACM Computing Surveys

  ACM Computing Surveys 18 (3), 277-316, 1986-09

  Association for Computing Machinery (ACM)

キーワード

• General Computer Science
• Theoretical Computer Science

詳細情報

• CRID: 1363951795169200128
• NII論文ID: 30021963037
• DOI: 10.1145/27632.27649
• ISSN: 15577341
• ISSN: 03600300
• Web Site: https://dl.acm.org/doi/pdf/10.1145/27632.27649
• データソース種別:
  • Crossref
  • CiNii Articles