Eecient Flow-sensitive Interprocedural Computation of Pointer-induced Aliases and Side Eeects
暂无分享,去创建一个
[1] Alfred V. Aho,et al. The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..
[2] Jeffrey D. Ullman,et al. Global Data Flow Analysis and Iterative Algorithms , 1976, J. ACM.
[3] John Banning,et al. : An Efficient , 2022 .
[4] Barry K. Rosen. Data Flow Analysis for Procedural Languages , 1979, JACM.
[5] Eugene W. Myers,et al. A precise inter-procedural data flow algorithm , 1981, POPL '81.
[6] Robert E. Tarjan,et al. Fast Algorithms for Solving Path Problems , 1981, JACM.
[7] Neil D. Jones,et al. A flexible approach to interprocedural data flow analysis and programs with recursive data structures , 1982, POPL '82.
[8] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.
[9] James R. Larus,et al. Detecting conflicts between structure accesses , 1988, PLDI '88.
[10] Ron Cytron,et al. An Overview of the PTRAN Analysis System for Multiprocessing , 1988, J. Parallel Distributed Comput..
[11] Thomas P. Murtagh,et al. Lifetime analysis of dynamically allocated objects , 1988, POPL '88.
[12] Ken Kennedy,et al. Fast interprocedual alias analysis , 1989, POPL '89.
[13] Alexandru Nicolau,et al. Parallelizing Programs with Recursive Data Structures , 1989, IEEE Trans. Parallel Distributed Syst..
[14] Phil Pfeiffer,et al. Dependence analysis for pointer variables , 1989, PLDI '89.
[15] Michael G. Burke. An interval-based approach to exhaustive and incremental interprocedural data-flow analysis , 1990, TOPL.
[16] Jong-Deok Choi,et al. Automatic construction of sparse data flow evaluation graphs , 1991, POPL '91.
[17] Mark N. Wegman,et al. Efficiently computing static single assignment form and the control dependence graph , 1991, TOPL.
[18] Barbara G. Ryder,et al. Pointer-induced aliasing: a problem classification , 1991, POPL '91.