Issue No. 07 - July (2000 vol. 33)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2.869371
<p>What happens when a computer program runs? The answer can be frustratingly elusive, as anyone who has debugged or tuned a program knows. As it runs, a program overwrites its previous state, which might have provided a clue as to how the program got to the point at which it computed the wrong answer or otherwise failed. This all-too-common experience is symptomatic of a more general problem: the difficulty of accurately and efficiently capturing and analyzing the sequence of events that occur when a program executes. </p> <p>Program paths offer an insight into a program's dynamic behavior that is difficult to achieve any other way. Unlike simpler measures such as program profiles, which aggregate information to reduce the cost of collecting or storing data, paths capture some of the usually invisible dynamic sequencing of statements. </p> <p>This work exploits the insight that program statements do not execute in isolation, but are typically correlated with the behavior of previously executed code. </p>
T. Ball and J. R. Larus, "Using Paths to Measure, Explain, and Enhance Program Behavior," in Computer, vol. 33, no. , pp. 57-65, 2000.