A fine-grained data-flow analysis framework

被引：5

作者：

Hsieh, CS

机构：

[1] Computer Science Department, Southwestern Oklahoma Stt. Univ., Weatherford

来源：

ACTA INFORMATICA | 1997年 / 34卷 / 09期

关键词：

D O I：

10.1007/s002360050101

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A fine-grained data-flow analysis framework (L, F) where the elements of the semilattice L are mappings from a set of items I to a semilattice of values V is introduced, and an algorithm is presented to solve this framework by considering the elements of I and V individually, rather than regarding the elements of L as atomic values. It is shown that a variety of useful data-flow problems fit into the fine-grained data-flow analysis framework, and can be solved in O(\I\ x \N\) time.

引用

页码：653 / 665

页数：13

共 15 条

[1] NODE LISTINGS FOR REDUCIBLE FLOW GRAPHS
AHO, AV
ULLMAN, JD
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 286 - 299
[2] Allen F. E., 1970, APPL COMPUTATIONAL M, P1, DOI DOI 10.1145/390013.808479
[3] FAST AND USUALLY LINEAR ALGORITHM FOR GLOBAL FLOW ANALYSIS
GRAHAM, SL
WEGMAN, M
[J]. JOURNAL OF THE ACM, 1976, 23 (01) : 172 - 202
[4] Hecht M. S., 1975, SIAM Journal on Computing, V4, P519, DOI 10.1137/0204044
[5] HECHT MS, 1973, 1ST P ACM S PRINC PR, P207
[6] HORWITZ S, 1987, ACTA INFORM, V24, P679, DOI 10.1007/BF00282621
[7] MONOTONE DATA FLOW ANALYSIS FRAMEWORKS
KAM, JB
ULLMAN, JD
[J]. ACTA INFORMATICA, 1977, 7 (03) : 305 - 317
[8] GLOBAL DATA FLOW ANALYSIS AND ITERATIVE ALGORITHMS
KAM, JB
ULLMAN, JD
[J]. JOURNAL OF THE ACM, 1976, 23 (01) : 158 - 171
[9] KENNEDY K, 2 ACM S PRINC PROGR, P10
[10] KUO LT, 1977, J ACM, V24, P473

← 1 2 →