Mercan, Hanefi and Yilmaz, Cemal (2021) Computing sequence covering arrays using unified combinatorial interaction testing. In: IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), Porto de Galinhas, Brazil
PDF
IWCT-21-UCIT-SequenceCA.pdf
Restricted to Registered users only
Download (1MB) | Request a copy
IWCT-21-UCIT-SequenceCA.pdf
Restricted to Registered users only
Download (1MB) | Request a copy
Official URL: http://dx.doi.org/10.1109/ICSTW52544.2021.00024
Abstract
Unified Combinatorial Interaction Testing (U-CIT) aims to reduce the barriers to applying combinatorial interaction testing (CIT) approaches to different testing scenarios by generalizing the construction of the CIT objects, so that the necessity of developing a specialized constructor for each distinct scenario,is avoided. In this work, to demonstrate the flexibility provided by U-CIT, we apply it to compute a well-known combinatorial object for testing, namely sequence covering arrays, together with some practical extensions.
Item Type: | Papers in Conference Proceedings |
---|---|
Uncontrolled Keywords: | Unified combinatorial interaction testing, sequence covering arrays, combinatorial interaction testing, constraint solving |
Subjects: | Q Science > Q Science (General) |
Divisions: | Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng. Faculty of Engineering and Natural Sciences |
Depositing User: | Cemal Yılmaz |
Date Deposited: | 27 Aug 2021 15:28 |
Last Modified: | 02 Sep 2022 11:07 |
URI: | https://research.sabanciuniv.edu/id/eprint/42039 |