Patent ID: 9021451
Filing Date: 2015-04-28
Classification: G06F

Abstract:
1. A method comprising: generating a call graph from an executable software system, the call graph comprising a plurality of nodes representing sub-routines, wherein each node is associated with an exclusive value and an inclusive value, wherein the exclusive value of a particular node represents resources consumed by that particular node, and wherein the inclusive value of the particular node represents resources consumed by the particular node and nodes that descend from the particular node; successively eliminating, by a computing device, a first set of nodes in the plurality of nodes based on inclusive values for the plurality of nodes, wherein exclusive values of successively eliminated nodes are summed, and wherein said eliminating stops when the summed exclusive values is greater than or equal to a threshold; and outputting a simplified call graph including a second set of nodes in the plurality of nodes, the second set of nodes not including the eliminated first set of nodes.