{'fraction_non_alphanumeric': 0.012355848434925865, 'fraction_numerical': 0.0, 'mean_word_length': 5.428571428571429, '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}}
Incremental Strategy for Applying Mutation Operators Emphasizing Faults Difficult to be Detected by Automated Static Analyser

To ensure software quality, we can use static and dynamic analysis techniques. Both have advantages and disadvantages and should be used together to improve their performance. In this paper, we present a strategy for applying a set of mutation operators for software testing, which represents a dynamic technique, based on the difficulty an automated static analyzer has on detecting their modeled faults. In other words, we investigated which sets of faults, represented by mutation operators, an automated static analyzer was able to recognize and prioritize the mutation testing considering only the set of mutation operators whose set of faults are difficult to be detected by such static analyzer. We compare our set of mutation operators with others, and the statical analysis shows no difference in the mutation score and costs regarding the number of generated and equivalent mutants among the different strategies. Nevertheless, we consider our proposal attractive once it uses operators with lower overlapping with faults detected by the automated static analyzer we have used.