{'fraction_non_alphanumeric': 0.020338983050847456, 'fraction_numerical': 0.003389830508474576, 'mean_word_length': 4.851485148514851, '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 mathematical programming method in test selection

The main problem of conformance testing is the time-consuming measurements, the enormous number of possible test suites and the long time it takes to run them all. Therefore, test selection is required. In this paper, we describe a new method of selecting an optimal test suite which can detect the errors with better probability and maximise the number of detected errors. We utilise mathematical programming based on a simplified model of the test-error connection. An application for the protocol ISDN DSS1 Layer 2 (LAPD) is included.