Method, computer program and computer system for assisting in analyzing program

摘要

A method for grouping algorithms included in a program into groups and thus for assisting in analyzing the program. The method includes the steps of: converting each of the algorithms into a directed graph; judging, as to each representative directed graph stored in a storage unit of a computer system, whether or not the directed graph obtained by the conversion is similar to the representative directed graph; and determining a group to which the directed graph obtained by the conversion belongs from among groups stored in the storage unit in accordance with the similarity judgment. A computer system for performing the above method and a computer program for causing a computer system to perform the above method are also described.

主权项

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:
N1 is at least one of the number of nodes included in both the directed graph obtained by the conversion and the representative directed graph and the number of paths between the nodes corresponding to N1, andN2 is at least one of the number of nodes included in one of the directed graph obtained by the conversion and the representative directed graph and the number of paths each having any one of the nodes corresponding to N2 as a start point or an end point; 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.