NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Towards an Automated Unified Framework to Run Applications for Combinatorial Interaction Testing
Published
Author(s)
Bestoun Ahmed, Amador Pahim, Cleber Rosa, D. Richard Kuhn, Miroslav Bures
Abstract
Combinatorial interaction testing (CIT) is a well-known technique, but industrial experience is needed to determine its effectiveness in different application domains. We present a case study introducing a unified framework for generating, executing and verifying CIT test suites, based on the open-source Avocado test framework. In addition, we present a new industrial case study to demonstrate the effectiveness of the framework. This evaluation showed that the new framework can generate, execute, and verify effective combinatorial interaction test suites for detecting configuration failures (invalid configurations) in a virtualization system.
Conference Dates
April 14-17, 2019
Conference Location
Copenhagen, DK
Conference Title
Evaluation and Assessment in Software Engineering (EASE)
Ahmed, B.
, Pahim, A.
, Rosa, C.
, Kuhn, D.
and Bures, M.
(2019),
Towards an Automated Unified Framework to Run Applications for Combinatorial Interaction Testing, Evaluation and Assessment in Software Engineering (EASE), Copenhagen, DK, [online], https://doi.org/10.1145/3319008.3319348, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=927675
(Accessed October 20, 2025)