TECHNOLOGIES FOR BRIDGING GAPS IN EXECUTION TRACES
First Claim
1. A computing device for program trace analysis, the computing device comprising:
- a trace analysis module to generate, based on an execution trace of a program, a first call stack that corresponds to a first location immediately before a trace gap in the execution trace and a second call stack that corresponds to a second location immediately after the trace gap, wherein the first call stack identifies a first list of functions and the second call stack identifies a second list of functions, and wherein each function corresponds to a source function of the program;
a stack evaluation module to (i) evaluate potential connection pairs between the first call stack and the second call stack to determine whether each connection pair is valid and, for each valid connection pair, a number of matching functions, wherein each connection pair identifies a first function of the first call stack and a second function of the second call stack, and (ii) select a first connection pair that is valid and has a largest number of matching functions of the valid connection pairs; and
a gap connection module to bridge the trace gap of the execution trace with the first connection pair.
3 Assignments
0 Petitions
Accused Products
Abstract
Technologies for bridging trace gaps include a computing device that traces execution of a program to generate an execution trace and identifies a trace gap in the execution trace. The computing device generates a first call stack that corresponds to a location immediately before the trace gap and a second call stack that corresponds to a location immediately after the trace gap. Each call stack identifies a list of functions, and each function corresponds to a source function of the program. The computing device evaluates connection pairs between the first call stack and the second call stack to determine whether each connection pair is valid and, for each valid connection pair, a number of matching functions. The computing device selects a connection pair that is valid and has a largest number of matching functions and bridges the trace gap with the selected connection pair. Other embodiments are described and claimed.
-
Citations
25 Claims
-
1. A computing device for program trace analysis, the computing device comprising:
-
a trace analysis module to generate, based on an execution trace of a program, a first call stack that corresponds to a first location immediately before a trace gap in the execution trace and a second call stack that corresponds to a second location immediately after the trace gap, wherein the first call stack identifies a first list of functions and the second call stack identifies a second list of functions, and wherein each function corresponds to a source function of the program; a stack evaluation module to (i) evaluate potential connection pairs between the first call stack and the second call stack to determine whether each connection pair is valid and, for each valid connection pair, a number of matching functions, wherein each connection pair identifies a first function of the first call stack and a second function of the second call stack, and (ii) select a first connection pair that is valid and has a largest number of matching functions of the valid connection pairs; and a gap connection module to bridge the trace gap of the execution trace with the first connection pair. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A method for program trace analysis, the method comprising:
-
generating, by a computing device, based on an execution trace of a program, a first call stack corresponding to a first location immediately before a trace gap in the execution trace and a second call stack corresponding to a second location immediately after the trace gap, wherein the first call stack identifies a first list of functions and the second call stack identifies a second list of functions, and wherein each function corresponds to a source function of the program; evaluating, by the computing device, potential connection pairs between the first call stack and the second call stack to determine whether each connection pair is valid and, for each valid connection pair, a number of matching functions, wherein each connection pair identifies a first function of the first call stack and a second function of the second call stack; selecting, by the computing device, a first connection pair that is valid and has a largest number of matching functions of the valid connection pairs; and bridging, by the computing device, the trace gap of the execution trace using the first connection pair. - View Dependent Claims (13, 14, 15, 16, 17, 18)
-
-
19. One or more computer-readable storage media comprising a plurality of instructions that in response to being executed cause a computing device to:
-
generate, based on an execution trace of a program, a first call stack corresponding to a first location immediately before a trace gap in the execution trace and a second call stack corresponding to a second location immediately after the trace gap, wherein the first call stack identifies a first list of functions and the second call stack identifies a second list of functions, and wherein each function corresponds to a source function of the program; evaluate potential connection pairs between the first call stack and the second call stack to determine whether each connection pair is valid and, for each valid connection pair, a number of matching functions, wherein each connection pair identifies a first function of the first call stack and a second function of the second call stack; select a first connection pair that is valid and has a largest number of matching functions of the valid connection pairs; and bridge the trace gap of the execution trace using the first connection pair. - View Dependent Claims (20, 21, 22, 23, 24, 25)
-
Specification