Automated test data generation using a scatter search approach |
| |
| Authors: | Raquel Blanco Javier Tuya Belarmino Adenso-Díaz |
| |
| Affiliation: | 1. Department of Computer Science, University of Oviedo, Campus de Viesques, Gijón, Asturias 33204, Spain;2. Department of Management Science, University of Oviedo, Campus de Viesques, Gijón, Asturias 33204, Spain;1. School of Mathematics, China University of Mining and Technology, Xuzhou, Jiangsu, 221116, PR China;2. School of Information and Control, China University of Mining and Technology, Xuzhou, Jiangsu, 221116, PR China;1. Unité de Recherche Synthèse et Structure de Nanomatériaux UR11ES30, Université de Carthage. Faculté des Sciences de Bizerte, 7021 Jarzouna, Bizerte, Tunisie;2. National Institute of Marine Sciences and Technologies, Tabarka, Tunisia;3. Laboratoire matériaux organisation et propriétés (LMOP), Universite´ de Tunis El Manar, Campus Universitaire, 2092 El Manar, Tunis, Tunisia;4. Faculté des Sciences de Bizerte, Laboratoire de Biosurveillance de l’Environnement (LBE), Unité d''Ecotoxicologie et d''Ecologie Côtiere (GREEC), Zarzouna–Bizerte, Tunisia;5. Environmental Research Institute and Department of Biochemistry, University College Cork, Cork, Ireland;6. Department of Arts and Sciences, Khalifa University of Science and Technology, Abu Dhabi, United Arab Emirates;1. Department of Materials Science and Metallurgical Engineering, University of Oviedo, Campus Universitario, 33203 Gijón, Asturias, Spain;2. Department of Construction and Manufacturing Engineering, University of Oviedo, Campus Universitario, 33203 Gijón, Asturias, Spain |
| |
| Abstract: | The techniques for the automatic generation of test cases try to efficiently find a small set of cases that allow a given adequacy criterion to be fulfilled, thus contributing to a reduction in the cost of software testing. In this paper we present and analyze two versions of an approach based on the scatter search metaheuristic technique for the automatic generation of software test cases using a branch coverage adequacy criterion. The first test case generator, called TCSS, uses a diversity property to extend the search of test cases to all branches of the program under test in order to generate test cases that cover these. The second, called TCSS-LS, is an extension of the previous test case generator which combines the diversity property with a local search method that allows the intensification of the search for test cases that cover the difficult branches. We present the results obtained by our generators and carry out a detailed comparison with many other generators, showing a good performance of our approach. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
