Patent ID: 8762970
Filing Date: 2014-06-24
Classification: G06F

Abstract:
1. A method for grouping algorithms included in a program into groups to assist in analyzing the program, the method comprising the steps of: converting each of the algorithms into a directed graph, the directed graph including a plurality of nodes and one or more edges each connecting two of the nodes; calculating similarity between the directed graph obtained by the conversion and each of a plurality of representative directed graphs corresponding respectively to the groups and stored in a storage unit of a computer system, wherein the calculation of the similarity includes dividing N1 by (N1+N2), where: judging, as to each of the representative directed graphs, that the directed graph obtained by the conversion is similar to the representative directed graph when the calculated similarity exceeds a threshold, wherein the representative directed graph is a directed graph including the smallest number of the nodes among directed graphs belonging to the corresponding group; and determining a group to which the directed graph obtained by the conversion belongs from among the groups stored in the storage unit in accordance with the similarity judgment.