{'fraction_non_alphanumeric': 0.013903743315508022, 'fraction_numerical': 0.0, 'mean_word_length': 5.8321167883211675, '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 Counterexample Analysis Method for Assume-Guarantee Verification of Component-Based Software

This paper presents a method for counterexamples analysis during the assume-guarantee verification process of component-based software. The method helps the process use up all possibilities to reach a conclusive result when verifying large scale software. For this purpose, we improve the equivalence queries answering algorithm on Teacher side to return all possible counterexamples when processing an assumption candidate. The returned counterexamples are analyzed on Learner side to find all possible observation tables which correspond to better assumption candidates for later learning iterations. These observation tables are stored in a list which contains all possibilities for the verification process to reach a conclusive result. Discussions about the importance, correctness, and complexity of the proposed method are included.