Interprocedural path profiling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1575, Issue , 1999, Pages 47-63

  Melski, David ^a   Reps, Thomas ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

INTER-PROCEDURAL; INTRAPROCEDURAL PATHS; PATH PROFILING;

PROGRAM COMPILERS;

EID: 84949225259     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49051-7_4     Document Type: Conference Paper

References (6)

1. G. Ammons, T. Ball, and J. Larus. Exploiting hardware performance counters with flow and context sensitive profiling. In PLDI’97, June 1997.
2. L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, Univ. of Copenhagen, May 1994. (DIKU report 94/19).
3. T. Ball and J. Larus. Efficient path profiling. In MICRO 1996, 1996.
4. D. Melski and T. Reps. Interprocedural path profiling. Tech. Rep. TR-1382, Comp. Sci. Dept., Univ. of Wisconsin, Madison, WI, September 1998. Available at “http://www.cs.wisc.edu/wpis/papers/tr1382.ps”.
5. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189–234. Prentice-Hall, Englewood Cliffs, NJ, 1981.
6. B. Steensgaard. Points-to analysis in almost-linear time. In Symp. on Princ. of Prog. Lang., pages 32–41, 1996.