{'fraction_non_alphanumeric': 0.012690355329949238, 'fraction_numerical': 0.0, 'mean_word_length': 4.676258992805756, '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}}
Fault-list collapsing for fault-injection experiments

Fault injection is become a popular approach to evaluate and possibly to improve the dependability of computer-based systems. One of the main issues to be solved when setting up a fault injection experiment is the generation of a list of faults to be injected, really representative of the whole set of possible faults. This paper proposes a set of collapsing rules based on the analysis of the assembly code and of the behavior of a fault free run of the system, useful to reduce the fault list length and the fault injection time without decreasing the accuracy of the results. The approach is suitable to be adapted for microprocessor-based systems and is independent on the method used to generate the fault list to be collapsed.