Program Analysis Papers

• Points-to Analysis In Almost Linear Time, by Bjarne Steensgaard, in Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Jan, 1996.
• Parametric shape analysis via 3-valued logic, by Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm, in ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 24, Issue 3, pages 217-298. May, 2002.
• Program Analysis as Model Checking of Abstract Interpretations by David Schmidt in Proceedings of the 5th International Symposium on Static Analysis, 1998.
• Improving Data-flow Analysis with Path Profiles by Glenn Ammons and James R. Larus, in Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, 1998.
• Efficiently computing static single assignment form and the control dependence graph By Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. in ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 13, Issue 4, Pages 451 - 490. October, 1991.
• Data Flow Analysis for Verifying Properties of Concurrent Programs by Matthew Dwyer, in Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering, 1994.
• Data Flow Analysis for Software Prefetching Linked Data Structures in Java by Brendon Cahoon and Kathryn S. McKinley, in Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, 2001.
• Value-based partial redundancy elimination, by Thomas VanDrunen and Antony L. Hosking, in Proceedings of the International Conference on Compiler Construction (CC), 2004.
• Interprocedural side-effect analysis in linear time by K. D. Cooper and K. Kennedy, in Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, 1988.
• Global Data Flow Analysis and Iterative Algorithms by John B. Kam and Jeffrey D. Ullman, in Journal of the ACM, 1976.