Mochamad Chandra Saputra1, Tetsuro Katayama1, Yoshihiro Kita2, Hisaaki Yamaba1, Kentaro Aburada1, Naonobu Okazaki1
1Interdisciplinary Graduate School of Agriculture and Engineering, University
of Miyazaki, 1-1 Gakuen-Kibanadai Nishi, Miyazaki, 889-2192 Japan
2Department of Information Security, Faculty of Information Systems, Siebold
Campus, University of Nagasaki, 1-1-1 Manabino, Nagayo-cho, Nishi-Sonogi-gun,
Nagasaki, 851-2195 Japan
pp. 187-192
ABSTRACT
Evaluating the test suite that contains redundant test cases is necessary
to ensure the efficiency of the testing and reducing the cost of testing.
The principle of redundant test cases on this research is any test cases
on a similar path executed with a similar high value of normalized Euclidean
distance. The first, the similarity calculated between the test cases and
path coverage uses Euclidean distance. The value of the Euclidean distance
on the test case with the lowest value of distance indicating highly similar
and possibly executing similar lines of code. The normalized Euclidean
distance is using to normalize the value from Euclidean distance result.
The experiment uses two java programs. Each redundancy score is 0.37 and
0.67, respectively. It means 37% and 67% of the test cases should be avoided
because there are inefficiency test cases on the test suite. The research
confirms redundant test cases can be identified by Euclidean distance and
normalized Euclidean distance to evaluate the test suite.
ARTICLE INFO
Article History
Received 10 November 2019
Accepted 13 November 2020
Keywords
Euclidean distance
Redundant test cases
Test suite evaluation
JAALR1405
Download articcle(PDF)