Back to results
US 12,182,202 B2Granted
System, devices and/or processes for updating call graphs
AssigneeInsitro, Inc.
InventorMatthew Rasmussen
Life of this patent
Estimating the term…
Abstract
Example methods, apparatuses, and/or articles of manufacture are disclosed that may be implemented, in whole or in part, using one or more computing devices to: compare first nodes of a first call graph to second nodes of a second call graph based, at least in part, on hash values associated with the first and second nodes to identify one or more of the second nodes that are absent from the first nodes.
Claims22
A computer-implemented method comprising, at a processor:
- fetching executable instructions;
- and
- executing the fetched executable instructions to:
- compare first signals and states stored in a memory expressing computed cryptographic hash values labeling a first plurality of nodes of a first call graph, the first call graph expressing features of a first previously executed invocation of a computing program, to second signals and states stored in the memory expressing computed cryptographic hash values labeling a second plurality of nodes of a second call graph, the second call graph expressing features of a second previously executed invocation of the computing program, the first signals and states stored in the memory expressing cryptographic hash values comprising a computed cryptographic hash of source code for one or more tasks executed in the first previously executed invocation, of an identifier of the source code, of one or more arguments of the one or more tasks executed in the first previously executed invocation or of one or more results of the one or more tasks executed in the first previously executed invocation, or a combination thereof;
- and
- incorporate at least a portion of the second plurality of nodes of the second call graph into the first call graph based, at least in part, on comparison of the first signals and states stored in the memory expressing computed cryptographic hash values to the second signals and states stored in the memory expressing computed cryptographic hash values to at least partially synchronize the first and second call graphs, the incorporated at least a portion of the second plurality of nodes to express or represent locators or pointers to thereby enable access to results of the second previously executed invocation via the first call graph.
3 more elements
A computing device comprising:
- a non-transitory memory storage device;
- and
- one or more processors coupled to the non-transitory memory storage device to:
- fetch executable instructions;
- and
- execute the fetched executable instructions to:
- compare first signals and states stored in the non-transitory memory storage device expressing computed cryptographic hash values labeling a first plurality of nodes of a first call graph, the first call graph to express features of a first previously executed invocation of a computing program, to second signals and states stored in the non-transitory memory storage device expressing computed cryptographic hash values stored in the non-transitory memory storage device labeling a second plurality of nodes of a second call graph, the second call graph to express features of a second previously executed invocation of the computing program, at least one of the computed cryptographic hash values expressed by the first signals and states stored in the non-transitory memory storage device comprising a computed cryptographic hash of source code for one or more tasks executed in the first previously executed invocation, of an identifier of the source code, of one or more arguments of the one or more tasks executed in the first previously executed invocation or of one or more results of the one or more tasks executed in the first previously executed invocation, or a combination thereof;
- and
- incorporate at least a portion of the second plurality of nodes of the second call graph into the first call graph based, at least in part, on the comparison of the first signals and states stored in the non-transitory memory storage device expressing computed cryptographic hash values to the second signals and states stored in the non-transitory memory storage device expressing computed cryptographic hash values to at least partially synchronize the first and second call graphs, the incorporated at least a portion of the second plurality of nodes to express or represent locators or pointers to thereby enable access to results of the second previously executed invocation via the first call graph.
6 more elements
An article comprising:
- a non-transitory storage medium comprising computer-readable instructions stored thereon which are executable by one or more processors of a computing device to:
- compare first signals and states stored in a memory expressing computed cryptographic hash values labeling a first plurality of nodes of a first call graph, the first call graph to express features of a first previously executed invocation of a computing program, to second signals and states stored in the memory expressing computed cryptographic hash values labeling a second plurality of nodes of a second call graph, the second call graph to express features of a second previously executed invocation of the computing program, at least one of the computed cryptographic hash values expressed by the first signals and states stored in the memory comprising a computed cryptographic hash of source code for one or more tasks executed in the first previously executed invocation, of an identifier of the source code, of one or more arguments of the one or more tasks executed in the first previously executed invocation or of one or more results of the one or more tasks executed in the first previously executed invocation, or a combination thereof;
- and
- incorporate at least a portion of the second plurality of nodes of the second call graph into the first call graph based, at least in part, on comparison of the first signals and states stored in the memory expressing computed cryptographic hash values to the second signals and states stored in the memory expressing computed cryptographic hash values to at least partially synchronize the first and second call graphs, the incorporated at least a portion of the second plurality of nodes to express or represent locators or pointers to thereby enable access to results of the second previously executed invocation via the first call graph.
1 more element
Dependencies are inferred from the claim text.