On Live-Dead Analysis for Global Data Flow Problems
暂无分享,去创建一个
[1] Stephen A. Cook,et al. Linear Time Simulation of Deterministic Two-Way Pushdown Automata , 1971, IFIP Congress.
[2] John Cocke,et al. Programming languages and their compilers , 1969 .
[3] Donald E. Knuth,et al. An empirical study of FORTRAN programs , 1971, Softw. Pract. Exp..
[4] John Cocke,et al. Programming languages and their compilers: Preliminary notes , 1969 .
[5] Frances E. Allen,et al. Control-flow analysis , 2022 .
[6] Ken Kennedy,et al. Node listings applied to data flow analysis , 1975, POPL '75.
[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[8] Alfred V. Aho,et al. Node listings for reducible flow graphs , 1975, J. Comput. Syst. Sci..
[9] Juris Hartmanis,et al. On the Power of Multiplication in Random Access Machines , 1974, SWAT.
[10] Jeffrey D. Ullman,et al. Analysis of a simple algorithm for global data flow problems , 1973, POPL.
[11] Larry J. Stockmeyer,et al. A characterization of the power of vector machines , 1974, STOC '74.
[12] Mark N. Wegman,et al. A Fast and Usually Linear Algorithm for Global Flow Analysis , 1976, J. ACM.
[13] Robert E. Tarjan,et al. Lower bounds on the lengths of node sequences in directed graphs , 1976, Discret. Math..
[14] Gary A. Kildall,et al. A unified approach to global program optimization , 1973, POPL.
[15] Alfred V. Aho,et al. Node listings for reducible flow graphs , 1975, STOC '75.
[16] Ken Kennedy,et al. A global flow analysis algorithm , 1972 .