{'fraction_non_alphanumeric': 0.009554140127388535, 'fraction_numerical': 0.0, 'mean_word_length': 5.203947368421052, '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}}
Experiments determining best paths for testing computer program predicates

Zeil has developed a vector space measure which indicates those paths which best detect errors in a selected program predicate. This measure has to be applied to a set of paths post hoc, and so the problem is to heuristically characterize those paths which will provide maximal test information about the selected predicate; the problem of selecting the optimal set of paths is NP-hard. Experiments have been conducted which utilize the vector space criterion to indicate those characteristics of paths which can best be used to test a given predicate. These characteristics will then provide a selection mechanism for an appropriate set of paths. Other questions involve the selection of those paths which sufficiently test all the program predicates, and to experimentally identify those program properties which lead to an irreducible error space for a predicate.