Enumerator: an efficient approach for enumerating all valid t-tuples

Mercan, Hanefi and Kaya, Kamer and Yılmaz, Cemal (2018) Enumerator: an efficient approach for enumerating all valid t-tuples. In: 11th IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW 2018), Vasteras, Sweden

This is the latest version of this item.

PDF
tuplecount.pdf
Download (71kB)

Official URL: http://dx.doi.org/10.1109/ICSTW.2018.00064

Abstract

In this paper, we present an efficient approach for enumerating all valid t-tuples for a given configuration space model, which is an important task in computing covering arrays. The results of our experiments suggest that the proposed approach scales better than existing approaches.

Item Type:	Papers in Conference Proceedings
Uncontrolled Keywords:	Combinatorial interaction testing; Covering arrays; Sketches; T-tuples
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:	01 Aug 2019 10:50
Last Modified:	03 Jun 2023 20:59
URI:	https://research.sabanciuniv.edu/id/eprint/38246

Available Versions of this Item

Enumerator: an efficient approach for enumerating all valid t-tuples. (deposited 14 May 2018 16:21)
- Enumerator: an efficient approach for enumerating all valid t-tuples. (deposited 01 Aug 2019 10:50) [Currently Displayed]

Actions (login required)

: View Item