UMP Institutional Repository

Hybrid test redundancy reduction strategy based on global neighborhood algorithm and simulated annealing

Kamal Z., Zamli and Norasyikin, Safieny and Fakhrud, Din (2018) Hybrid test redundancy reduction strategy based on global neighborhood algorithm and simulated annealing. In: Proceedings of the 7th International Conference on Software and Computer Applications (ICSCA 2018), 8-10 February 2018 , Kuantan, Pahang, Malaysia. pp. 87-91.. ISBN 978-145035414-1

[img]
Preview
Pdf
Hybrid Test Redundancy Reduction Strategy1.pdf

Download (48kB) | Preview

Abstract

Software testing is a critical part of software development. Often, test suite sizes grow significantly with subsequent modifications to the software over time resulting into potential redundancies. Test redundancies are undesirable as they incur costs and are not helpful to detect new bugs. Owing to time and resource constraints, test suite minimization strategies are often sought to remove those redundant test cases in an effort to ensure that each test can cover as much requirements as possible. There are already many works in the literature exploiting the greedy computational algorithms as well as the meta-heuristic algorithms, but no single strategy can claim dominance in terms of test data reduction over their counterparts. Furthermore, despite much useful work, existing strategies have not sufficiently explored the hybrid based meta-heuristic strategies. In order to improve the performance of existing strategies, hybridization is seen as the key to exploit the strength of more than one meta-heuristic algorithm. Given such prospects, this research explores a hybrid test redundancy reduction strategy based on Global Neighborhood Algorithm and Simulated Annealing, called GNA_SA. Overall, GNA_SA offers better reduction as compared to the original GNA and many existing works.

Item Type: Conference or Workshop Item (Lecture)
Additional Information: Indexed by Scopus
Uncontrolled Keywords: Test Redundancy Reduction; Simulated Annealing; Global Neighborhood Algorithm
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Noorul Farina Arifin
Date Deposited: 29 Mar 2018 06:36
Last Modified: 07 Aug 2018 06:51
URI: http://umpir.ump.edu.my/id/eprint/20924
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item