Abstract
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).
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Ammons, G., Ball, T., Larus, J.: Exploiting hardware performance counters with flow and context sensitive profiling. In: PLDI 1997 (June 1997)
Andersen, L.O.: Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, Univ. of Copenhagen (May 1994) (DIKU report 94/19)
Ball, T., Larus, J.: Efficient path profiling. In: MICRO 1996 (1996)
Melski, D., Reps, T.: 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
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)
Steensgaard, B.: Points-to analysis in almost-linear time. In: Symp. on Princ. Of Prog. Lang., pp. 32–41 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Melski, D., Reps, T. (1999). Interprocedural Path Profiling. In: Jähnichen, S. (eds) Compiler Construction. CC 1999. Lecture Notes in Computer Science, vol 1575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49051-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-49051-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65717-0
Online ISBN: 978-3-540-49051-7
eBook Packages: Springer Book Archive