tap08 Andrea Calvagna Gargantini, Angelo

A Logic-Based Approach to Combinatorial Testing with Constraints

in Tests and Proofs, Second International Conference, TAP, Prato, Italy, April 9-11, 2008. Proceedings (Eds. Bernhard Beckert and Reiner Hähnle) Springer, Lecture Notes in Computer Science, vol. 4966 (2008): 66-83 ISBN 978-3-540-79123-2

Abstract
Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are constructed by combining \it tuples of assignments of the different input parameters, based on some effective combinatorial strategy. The most commonly used strategy is two-way (\emphpairwise) coverage, requiring all combinations of valid assignments for all possible pairs of input parameters to be covered by at least one test case. In this paper a new heuristic strategy developed for the construction of pairwise covering test suites is presented, featuring a new approach to support expressive constraining over the input domain. Moreover, it allows the inclusion or exclusion of ad-hoc combinations of parameter bindings to let the user customize the test suite outcome. Our approach is tightly integrated with formal logic, since it uses test predicates to formalize combinatorial testing as a logic problem, and applies an external model checker tool to solve it. The proposed approach is supported by a prototype tool implementation, and early results of experimental assessment are also presented.


[read the copyright and download the pdf file] [DOI]

My sw links