An algorithm for combinatorial interaction testing: definitions and rigorous evaluations

Authors

  • Juliana M. Balera Laboratório Associado de Computação e Matemática Aplicada, Instituto Nacional de Pesquisas Espaciais (INPE), Av. dos Astronautas, 1758, São José dos Campos, SP, Brazil
  • Valdivino A. de Santiago Júnior Laboratório Associado de Computação e Matemática Aplicada, Instituto Nacional de Pesquisas Espaciais (INPE), Av. dos Astronautas, 1758, São José dos Campos, SP, Brazil

Keywords:

Software testing, Combinatorial interaction testing, Combinatorial testing, Mixed-value covering array, T-Tuple reallocation, Controlled experiment

Abstract

Background

Combinatorial Interaction Testing (CIT) approaches have drawn attention of the software testing community to generate sets of smaller, efficient, and effective test cases where they have been successful in detecting faults due to the interaction of several input parameters. Recent empirical studies show that greedy algorithms are still competitive for CIT. It is thus interesting to investigate new approaches to address CIT test case generation via greedy solutions and to perform rigorous evaluations within the greedy context.;

Methods

We present a new greedy algorithm for unconstrained CIT, T-Tuple;

 

Downloads

Download data is not yet available.

Downloads

Published

2017-11-28

How to Cite

Balera, J. M., & Santiago Júnior, V. A. de. (2017). An algorithm for combinatorial interaction testing: definitions and rigorous evaluations. Journal of Software Engineering Research and Development, 5, 10:1 – 10:41. Retrieved from https://journals-sol.sbc.org.br/index.php/jserd/article/view/430

Issue

Section

Research Article