{'fraction_non_alphanumeric': 0.015894039735099338, 'fraction_numerical': 0.0026490066225165563, 'mean_word_length': 4.952755905511811, '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}}
Genetic algorithm based approach for segmented testing

Segmented testing, in which a set of test patterns are partitioned into several segments, has been shown to be applicable for on-line testing as it can shorten the mean time to fault detection. One problem that exists for segmented testing is how to partition the set of tests so that the detection latency can be minimized. In this paper, we first propose a method to compute a lower bound of detection latency. Then we present a genetic algorithm (GA) based procedure to partition a given test set into several test segments aiming to reduce the detection latency. Experimental results on ISCAS'89 benchmark circuits demonstrate that the proposed approach can effectively reduce detection latency.