{'fraction_non_alphanumeric': 0.012389380530973451, 'fraction_numerical': 0.0, 'mean_word_length': 5.048128342245989, '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}}
A Heuristic Algorithm for Automatic Generation of March Tests

March test is one of the most popular memory test algorithms for its good fault coverage and linear complexity. However, designing an efficient March test for a complex memory fault set is a tedious task. This work designs a two-phase heuristic algorithm for automatic generation of March tests with two new observations. One observation is that some operations can be deleted from the march element, if other operations are inserted to sensitize the Loop-Sens fault, wherein the required initial state is equal to the expected faulty state. The other observation is that there exist chances to reduce the length of march sequence after some operation segments between march elements are exchanged, if the expected states of the operation segments in the different march elements match each other. Experimental results show that the proposed algorithm is effective and efficient. The generated March tests cover the target fault sets, and the complexities approach to those of the minimal March tests generated from the exhaustive methods for the specific fault sets.