{'fraction_non_alphanumeric': 0.01639344262295082, 'fraction_numerical': 0.0, 'mean_word_length': 5.240875912408759, '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}}
Testing decomposition of component specifications based on a rule for formal verification

This paper proposes a general technique for testing decomposition of component specifications based on rules for formal verification. Component specifications are expressed as pairs of two models: a context assumption and a component guarantee. Thereby they capture the contract-like nature between the component to be developed and the context in which it is supposed to work. The paper provides empirical evidence that A/G rules developed for formal methods are highly relevant as patterns for testing decomposition of component specifications. More explicitly, that testing the validity of decomposition based on A/G rules is valid, and moreover, that testing based on A/G rules is more efficient that a conventional approach for the same kind of test-quality.