Michael Burke, Jong-Deok Choi
ACM Letters on Programming Languages and Systems (LOPLAS)
We present a method that combines a deep analysis of program dependences with a broad analysis of the interaction among procedures. The method is more efficient than existing methods: we reduce many tests, performed separately by existing methods, to a single test. The method is more precise than existing methods with respect to references to multi-dimensional arrays and dependence information hidden by procedure calls. The method is more general than existing methods: we accommodate potentially aliased variables and structures of differing shapes that share storage. We accomplish the above through a unified approach that integrates subscript analysis with aliasing and interprocedural information. © 1986, ACM. All rights reserved.
Michael Burke, Jong-Deok Choi
ACM Letters on Programming Languages and Systems (LOPLAS)
Ron Cytron, Jeanne Ferrante, et al.
PLDI 1990
Peter F. Sweeney, Michael Burke
Software - Practice and Experience
Vugranam C. Sreedhar, Michael Burke, et al.
SIGPLAN Notices (ACM Special Interest Group on Programming Languages)