| R. H. Campbell and A. N. Habermann. The specification of process scheduling by path expressions. In Lecture Notes in Computer Science, No. 16. Springer Verlag, 1974. |
....some information in the process. Jerding et al. 11] also focus on class selection. Prof and Gprof [9] kept statistics on function invocations and callercallee pairs respectively. When we try to derive an automaton based on the usage of classes, we are, effectively, discovering path expressions [3]. This kind of result is akin to the work by Ernst and Notkin [6] who are trying to discover data invariants of a program. Sequitur has been used to compress basic block trace data by Larus [12] Neville Manning reports on the work of Gaines [7] that focused on discovering control flow, albeit ....
R. H. Campbell and A. N. Habermann. The specification of process scheduling by path expressions. In Lecture Notes in Computer Science, No. 16. Springer Verlag, 1974.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC