Leveraging a Constraint Solver for Minimizing Test Suites

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2013

Autores

José Campos (Autor) FEUP; Rui Abreu (Autor) FEUP

Ata de Conferência Internacional

Título: 2013 13TH INTERNATIONAL CONFERENCE ON QUALITY SOFTWARE (QSIC)

Páginas: 253-259

13th International Conference on Quality Software (QSIC)

Nanjing, PEOPLES R CHINA, JUL 29-30, 2013

Indexação

ISI Web of Knowledge - 4 Citações

Scopus - 8 Citações

Classificação Científica

FOS: Ciências exactas e naturais > Ciências da computação e da informação

Outras Informações

ID Authenticus: P-008-F5V

DOI: 10.1109/qsic.2013.17

Abstract (EN): Software (regression) testing is performed to detect errors as early as possible and guarantee that changes did not affect the system negatively. As test suites tend to grow over time, (re-)executing the entire suite becomes prohibitive. We propose an approach, RZOLTAR, addressing this issue: it encodes the relation between a test case and its testing requirements (code statements in this paper) in a so-called coverage matrix; maps this matrix into a set of constraints; and computes a collection of optimal minimal sets (maintaining the same coverage as the original suite) by leveraging a fast constraint solver. We show that RZOLTAR efficiently (0.95 seconds on average) finds a collection of test suites that significantly reduce the size (64.88% on average) maintaining the same fault detection (as initial test suite), while the well-known greedy approach needs 11.23 seconds on average to find just one solution.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 7