{'fraction_non_alphanumeric': 0.01227830832196453, 'fraction_numerical': 0.0, 'mean_word_length': 5.016393442622951, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Automated Generation of Similar Paths for Localizing Program Faults

Localizing a program fault accurately in debugging is complex and time-consuming. In the process of fault diagnosing, identifying or generating the successful test paths as similar as possible to the failed test is core for the effectiveness of faults localization. A method for calculating the similarity between two test paths based on analyzing difference between program control-flow is defined, and a novel algorithm based on DD- graph for generating similar path set directly from a failed test is proposed. It is experimentally proved that the proposed algorithm can generate a similar path set for a failed path and can help to localize the program faults.