Improving Data-flow Analysis with Path Profiles

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 33, Issue 5, 1998, Pages 72-84

  Ammons, Glenn ^a   Larus, James R ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346877099     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/277652.277665     Document Type: Article

References (16)

1. Glenn Ammons, Thomas Ball, and James R. Larus. Exploiting hardware performance counters with flow and context sensitive profiling. In Proceedings of the SIGPLAN '97 Conference on Programming Language Design and Implementation, June 1997.
2. Alfred V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 5, pages 255-300. MIT Press, 1994.
3. Rastislav Bodík and Sadun Anik. Path-sensitive value-flow analysis. In Proceedings of the SIGPLAN '98 Symposium on Principles of Programming Languages (POPL), January 1998.
4. Rastislav Bodík, Rajiv Gupta, and Mary Lou Soffa. Interprocedural conditional branch elimination. In Proceedings of the SIGPLAN '97 Conference on Programming Language Design and Implementation (PLDI), pages 146-158, June 1997.
5. Rastislav Bodík, Rajiv Gupta, and Mary Lou Soffa. Refining data flow information using infeasible paths. In Fifth ACM SIGSOFT Symposium on Foundations of Software Engineering and Sixth European Software Engineering Conference, September 1997.
6. Rastislav Bodík, Rajiv Gupta, and Mary Lou Soffa. Complete removal of redundant computations. In Proceedings of the SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), June 1998. To appear.
7. T. Ball and J. R. Larus. Efficient path profiling. In Proceedings of MICRO 96, pages 46-57, December 1996.
8. Joseph A. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers, C-30(7):478-490, July 1981.
9. David Gries. Describing an algorithm by hopcroft. Acta Informatica, 2:97-109, 1973.
10. Allen Goldberg, T. C. Wang, and David Zimmer-man. Applications of feasible path analysis to program testing. In International Symposium on Software Testing and Analysis. ACM SIGSOFT, August 1994.
11. L. Howard Holley and Barry K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7(1):60-78, January 1981.
12. Frank Mueller and David B. Whalley. Avoiding conditional branches by code replication. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation (PLDI), pages 56-66, June 1995.
13. Wen mei W. Hwu, Scott A. Mahlke, William Y. Chen, Pohua P. Chang, Nancy J. Warter, Roger A. Bringmann, Roland G. Ouellette, Richard E. Hank, Tokuzo Kiyohara, Grant E. Haab, John G. Holm, and Daniel M. Lavery. The superblock: An effective technique for VLIW and superscalar compilation. The Journal of Supercomputing, 7(1-2):229-248, May 1993.
14. G. Ramalingam. Data flow frequency analysis. In Proceedings of the SIGPLAN '96 Conference on Programming Language Design and Implementation, pages 267-277, May 1996.
15. Robert P. Wilson, Robert S. French, Christopher S. Wilson, Saman P. Amarastnghe, Jennifer M. Anderson, Steve W. K. Tjiang, Shih-Wei Liao, Chau-Wen Tseng, Mary W. Hall, Monica S. Lam, and John L. Hennessy. An overview of the SUIF compiler system. Published on the World Wide Web at http://suif.stanford.edu/suif/suif1/suif-overview/suif.html
16. Mark N. Wegman and F. Kenneth Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2):181-210, April 1991.