Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/28244
Title: Identifying failure-inducing combinations with tuple relationship tree
Authors: Niu, XT
Nie, CH
Chan, A
Keywords: Candidate tuple relationship tree
Combinatorial testing
Fault localize
Overlapped interaction
Selecting strategy
Software testing
Issue Date: 2014
Publisher: 科学出版社
Source: 計算機學報 (Chinese journal of computers), 2014, v. 37, no. 12, p. 2505-2518 How to cite?
Journal: 計算機學報 (Chinese journal of computers) 
Abstract: Combinatorial testing using covering array composed by parameter values as test suite, it is good at detecting whether there exist bug caused by interactions among these parameters. A test case in covering array contains many parameter interactions (called tuples), some of them may cause the test case fail, it is an important problem to find which one or some caused this failure. There are some methods proposed in recent years trying to solve this problem. However, in these studies, the relationships among candidate tuple didn't raise enough attention. Furthermore, they are not efficient enough or even completed. In this paper, we constructed a candidate tuple relationship tree (TRT) to describe the relationships among all the candidate tuples. TRT facilitate our localizing progress by reducing additional test cases generated and providing a clear view of all possible candidate tuples so that any fault interaction, such as overlapped interaction, would not be missed. And based on TRT, we proposed four search methods to realize fault-localizing progress. Experiment shows that our method can get a more completed result than existing methods, and also very efficient.
URI: http://hdl.handle.net/10397/28244
ISSN: 0254-4164
DOI: 10.3724/SP.J.1016.2014.02505
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

45
Last Week
3
Last month
Checked on Sep 24, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.