Call Graph Enhancement Using Stitching Algorithm

A system comprising:

• at least one data processor;
• and
• memory storing instructions which, when executed by the at least one data processor, result in operations comprising:
• parsing a code base to identify methods encapsulated therein;
• generating a call graph based on the parsing using a graph generation technique, the call graph being a directed call graph comprising a plurality of nodes characterizing the identified methods;
• determining, based on one or more design patterns used to generate the code base, that at least a portion of the nodes generated call graph are disconnected nodes, wherein at least a portion of the design patterns are non-standard and are not recognized by the graph generation technique;
• connecting at least two of the disconnected nodes using a stitching algorithm to result in a modified call graph, wherein the stitching algorithm performs operations comprising:
• for each of the one or more design patterns:
• find a set of called method nodes in the call graph to be called in runtime that depend on such design pattern;
• find a set of callee method nodes that are hierarchically associated with the set of called methods that depend on such design pattern;
• and
• add directed edges to the set of callee method nodes from the set of called method nodes if both sets contain at least one node;
• advance to a next design pattern if at least one edge is added between a callee and a called node;
• and
• advance to the next design pattern if the set of called method nodes and the set of callee method nodes are both empty;
• and
• providing data characterizing the modified call graph.

A non-transitory computer program product storing instructions which, when executed by at least one computing device, result in operations comprising:

• parsing a code base to identify methods encapsulated therein;
• generating a call graph based on the parsing using a graph generation technique, the call graph being a directed call graph comprising a plurality of nodes characterizing the identified methods;
• determining, based on one or more design patterns used to generate the code base, that at least a portion of the nodes generated call graph are disconnected nodes, wherein at least a portion of the design patterns are non-standard and are not recognized by the graph generation technique;
• connecting at least two of the disconnected nodes using a stitching algorithm to result in a modified call graph, wherein the stitching algorithm performs operations comprising:
• for each of the one or more design patterns:
• find a set of called method nodes in the call graph to be called in runtime that depend on such design pattern;
• find a set of callee method nodes that are hierarchically associated with the set of called methods that depend on such design pattern;
• and
• add directed edges to the set of callee method nodes from the set of called method nodes if both sets contain at least one node;
• advance to a next design pattern if at least one edge is added between a callee and a called node;
• and
• advance to the next design pattern if the set of called method nodes and the set of callee method nodes are both empty;
• and
• providing data characterizing the modified call graph.