Interprocedural Path Profiling

  • David Melski
  • Thomas Reps
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1575)


In path profiling, a program is instrumented with code that counts the number of times particular path fragments of the program are executed. This paper extends the intraprocedural path-profiling technique of Ball and Larus to collect information about interprocedural paths (i.e., paths that may cross procedure boundaries).


Procedure Call Calling Context Call Graph Call Site Path Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


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

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • David Melski
    • 1
  • Thomas Reps
    • 1
  1. 1.Computer Sciences DepartmentUniversity of Wisconsin 1210 West Dayton StreetMadisonUSA

Personalised recommendations