Abdullah, Nasser and Alsewari, Abdulrahman A. and Kamal Z., Zamli (2015) Adopting search-based algorithms for pairwise testing. In: 4th International Conference on Software Engineering and Computer Systems (ICSECS 2015) , 19-21 August 2015 , Kuantan, Pahang. pp. 124-129.. ISBN 978-146736722-6
![[img]](http://umpir.ump.edu.my/style/images/fileicons/other.png) |
Pdf
07333096.pdf Restricted to Repository staff only Download (873kB) | Request a copy |
Abstract
Owingto an exponential increase in computational time associated with increasing number of components, exhaustive testing is impractical. Here, many researchers opt to adopt pairwise testing to minimize the overall number of tests. Recently, many existing work are focusing on the use of SearchBased algorithms as the basis of the implementation algorithm. This paper presents a critical comparison of Search-Based algorithm for generating the pairwise test suite. An analysis of existing SB pairwise strategies shows the positive and negative points for each strategy thereby highlighting promising future directions in this area.
| Item Type: | Conference or Workshop Item (Speech) |
|---|---|
| Additional Information: | Indexed by Scopus |
| Uncontrolled Keywords: | Pairwise testing; Test suite generator; Software testing; Combinatorial problem; Search based algorithms |
| Subjects: | Q Science > QA Mathematics > QA76 Computer software |
| Faculty/Division: | Faculty of Computer System And Software Engineering |
| Depositing User: | Prof. Dr. Kamal Zuhairi Zamli |
| Date Deposited: | 19 Jul 2018 06:55 |
| Last Modified: | 19 Jul 2018 06:55 |
| URI: | http://umpir.ump.edu.my/id/eprint/18262 |
| Download Statistic: | View Download Statistics |
Actions (login required)
 |
View Item |