TY - GEN
T1 - A Heuristic Approach to Break Cycles for the Class Integration Test Order Generation
AU - Zhang, Miao
AU - Keung, Jacky
AU - Xiao, Yan
AU - Kabir, Md Alamgir
AU - Feng, Shuo
PY - 2019/7
Y1 - 2019/7
N2 - It is a general objective to minimize overall stubbing cost when performing class integration test order generation. Existing approaches are unable to obtain a cost-optimal class test order, this is largely due to the lack of a comprehensive analysis on the factors that affect overall stubbing cost, i.e., the number of required test stubs and the corresponding stubbing complexity. To address this issue, we propose an approach called HBCITO (Heuristic approach to Break Cycles for the class Integration Test Order generation). Given a set of removed dependencies, a heuristic algorithm is employed to search for a near ideal set of class dependencies. Such dependencies break the same or greater number of cycles as the initialized dependencies but attract less stubbing cost. The experimental results show that HBCITO is capable of generating class test orders with significantly lower stubbing cost compared with other approaches.
AB - It is a general objective to minimize overall stubbing cost when performing class integration test order generation. Existing approaches are unable to obtain a cost-optimal class test order, this is largely due to the lack of a comprehensive analysis on the factors that affect overall stubbing cost, i.e., the number of required test stubs and the corresponding stubbing complexity. To address this issue, we propose an approach called HBCITO (Heuristic approach to Break Cycles for the class Integration Test Order generation). Given a set of removed dependencies, a heuristic algorithm is employed to search for a near ideal set of class dependencies. Such dependencies break the same or greater number of cycles as the initialized dependencies but attract less stubbing cost. The experimental results show that HBCITO is capable of generating class test orders with significantly lower stubbing cost compared with other approaches.
KW - Break cycles
KW - Class integration test order generation
KW - Integration testing
KW - Stubbing complexity
UR - http://www.scopus.com/inward/record.url?scp=85072708882&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85072708882&origin=recordpage
U2 - 10.1109/COMPSAC.2019.00016
DO - 10.1109/COMPSAC.2019.00016
M3 - 32_Refereed conference paper (with ISBN/ISSN)
AN - SCOPUS:85072708882
SN - 9781728126074
VL - 1
T3 - Proceedings - International Computer Software and Applications Conference
SP - 47
EP - 52
BT - 2019 IEEE 43rd Annual Computer Software and Applications Conference, COMPSAC 2019
A2 - Getov, Vladimir
A2 - Gaudiot, Jean-Luc
A2 - Yamai, Nariyoshi
A2 - Cimato, Stelvio
A2 - Chang, Morris
A2 - Teranishi, Yuuichi
A2 - Yang, Ji-Jiang
A2 - Leong, Hong Va
A2 - Shahriar, Hossian
A2 - Takemoto, Michiharu
A2 - Towey, Dave
A2 - Takakura, Hiroki
A2 - Elci, Atilla
A2 - Takeuchi, Susumu
A2 - Puri, Satish
PB - IEEE
T2 - 43rd IEEE Annual Computer Software and Applications Conference, COMPSAC 2019
Y2 - 15 July 2019 through 19 July 2019
ER -