Unified combinatorial interaction testing

Mercan, Hanefi (2021) Unified combinatorial interaction testing. [Thesis]

[thumbnail of 10403247.pdf] PDF

Download (2MB)


We present Unified Combinatorial Interaction Testing (U-CIT), which aims to improve the flexibility of combinatorial interaction testing (CIT) by eliminating the necessity of developing specialized constructors for CIT problems that cannot be efficiently and effectively addressed by the existing CIT constructors. U-CIT expresses the entities to be covered and the space of valid test cases, from which the samples are drawn to obtain full coverage, as constraints. Computing a U-CIT object (i.e., a set of test cases obtaining full coverage under a given coverage criterion) then turns into an interesting constraint solving problem, which we call cov-CSP. cov-CSP aims to divide the constraints, each representing an entity to be covered, into a minimum number of satisfiable clusters, such that a solution for a cluster represents a test case and the collection of all the test cases generated (one per cluster) constitutes a U-CIT object, covering each required entity at least once. To solve the cov-CSP problem, thus to compute U-CIT objects, we first present two constructors. One of these constructors attempts to cover as many entities as possible in a cluster before generating a test case, whereas the other constructor generates a test case first and then marks all the entities accommodated by this test case as covered. We then use these constructors to evaluate U-CIT in three studies, each of which addresses a different CIT problem. In the first study, we develop structure-based U-CIT objects to obtain decision coverage-adequate test suites. In the second study, we develop order-based U-CIT objects, which enhance a number of existing order-based coverage criteria by taking the reachability constraints imposed by graph-based models directly into account when computing interaction test suites. In the third study, we develop usage-based U-CIT objects to address the scenarios, in which standard covering arrays are not desirable due to their sizes, by choosing the entities to be covered based on their usage statistics collected from the field. Then, we empirically demonstrated that the performance (i.e., the construction times) of U-CIT constructors can be significantly improved by using hints. We also carry out user studies to further evaluate U-CIT. The results of these studies suggest that U-CIT is more flexible than the existing CIT approaches.
Item Type: Thesis
Uncontrolled Keywords: Combinatorial interaction testing. -- covering arrays. -- sequence covering arrays. -- constraint solving. -- structural coverage. -- coverage criteria. -- Kombinezon etkilesim sınaması. -- kapsayan diziler. -- sıralı kapsayan diziler. -- kısıt çözümü. --yapısal kapsama. -- kapsama kriteri.
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK7800-8360 Electronics > TK7885-7895 Computer engineering. Computer hardware
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: IC-Cataloging
Date Deposited: 19 Oct 2021 11:27
Last Modified: 26 Apr 2022 10:39
URI: https://research.sabanciuniv.edu/id/eprint/42496

Actions (login required)

View Item
View Item