公开(公告)号：CA2687672A1

公开(公告)日：2011-06-07

申请号：CA2687672

申请日：2009-12-07

Applicant: IBM CANADA

Inventor： MOSTAFA MOHAMMED ,  TESSIER JOSHUA PETER ,  HILLIS LINDA

IPC: G06F9/44 ,  G06F11/36

Abstract: An illustrative embodiment of a computer-implemented process for intelligent call graph generation receives a request to build a call graph to form a received request, receives a source code associated with the received request, receives configuration options, and determines whether an entry point for the call graph is identified in the source code. Responsive to a determination that the entry point for the call graph is identified, analyzes dependencies in the source code, and identifies exclusions in the source code using the analyzed dependencies to form identified exclusions. The computer-implemented process determines whether analysis required to build a compact call graph is complete and responsive to a determination that analysis required to build a compact call graph is complete, generates the compact call graph without the identified exclusions.

公开(公告)号：CA2684348A1

公开(公告)日：2011-05-04

申请号：CA2684348

申请日：2009-11-04

Applicant: IBM CANADA

Inventor： TESSIER JOSHUA PETER ,  MOSTAFA MOHAMMED ,  GUTZ STEVEN JOHN EARL

IPC: G06F9/45

Abstract: An illustrative embodiment provides a computer-implemented process for algorithm complexity identification through inter-procedural data flow analysis receives a call graph to form a set of received nodes in a static analysis framework, identifies a parent node in the set of received nodes to form an identified parent, traverses the call graph from the identified parent node to a node to identify a function within the node to form an identified function. Each identified function is analyzed to form a complexity value in a set of complexity values. Responsive to a determination that node analysis is complete, and responsive to a determination that path analysis is complete, determines whether path analysis for the identified parent is complete. Responsive to a determination that path analysis for the identified parent is complete, sum the complexity values in the set of complexity values for the identified parent and return the complexity value for the identified parent to a requester.