Algorithm complexity identification

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 9/45 (2006.01)

Patent

CA 2684348

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.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Algorithm complexity identification does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Algorithm complexity identification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithm complexity identification will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1729771

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.