US 11,995,105 B2
Merging totally ordered sets
Akihiko Tozawa, Minato-ku (JP); Takahide Nogayama, Kawasaki (JP); Ai Yoshino, Kawasaki (JP); and Yasuharu Katsuno, Hodogaya-ku (JP)
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION, Armonk, NY (US)
Filed by INTERNATIONAL BUSINESS MACHINES CORPORATION, Armonk, NY (US)
Filed on Jan. 5, 2022, as Appl. No. 17/568,924.
Prior Publication US 2023/0214409 A1, Jul. 6, 2023
Int. Cl. G06F 16/28 (2019.01); G06F 7/16 (2006.01); G06F 18/23 (2023.01)
CPC G06F 16/285 (2019.01) [G06F 7/16 (2013.01); G06F 18/23 (2023.01)] 16 Claims
OG exemplary drawing
 
1. A computer-implemented method for software analysis, comprising:
determining a similarity score for an ordered input set and at least one ordered cluster set that represents a distance between the ordered input set and the at least one ordered cluster set;
determining that the ordered input set is similar to a first cluster of the at least one ordered cluster set, based on the similarity score;
merging the ordered input set to the first cluster of the at least one cluster set to generate a merged set that preserves an ordering of the ordered input set and the first cluster by generating an edit script to merge the ordered input set and the first cluster and iteratively performing a guided topological sort on a directed acyclic graph that includes elements of the ordered input set and the first cluster, integrating an input total order at each iteration; and
performing software analysis using the merged set.