{'fraction_non_alphanumeric': 0.023835319609967497, 'fraction_numerical': 0.0, 'mean_word_length': 5.553191489361702, '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}}
An efficient algorithm for pairwise test case generation in presence of constraints

Constraints handling problem in combinational testing is an intensive computation process. In this paper, we present an effective algorithm, called IPO SAT (In-Parameter-Order-Satisfiability), for pairwise test case generation in presence of constraints. In our strategy, constraints are denoted as forbidden tuples, which are converted to conjunctive normal form. Then, the combination test cases which meet the constraints are found out by calling Boolean satisfiability(SAT) solvers. Besides, an optimization upon the process is given, in order to improve the performance of IPO SAT by reducing the number of times of calling SAT solver and avoiding checking irrelevant constraints. Finally, experimental results show that the proposed IPO SAT algorithm is efficient and the optimization has obvious improvements on reducing time cost.