Adopting search-based algorithms for pairwise testing
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...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2015
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/18262/ http://umpir.ump.edu.my/id/eprint/18262/1/07333096.pdf |
| _version_ | 1848820630236954624 |
|---|---|
| author | Abdullah, Nasser Alsewari, Abdulrahman A. Kamal Z., Zamli |
| author_facet | Abdullah, Nasser Alsewari, Abdulrahman A. Kamal Z., Zamli |
| author_sort | Abdullah, Nasser |
| building | UMP Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T02:12:30Z |
| format | Conference or Workshop Item |
| id | ump-18262 |
| institution | Universiti Malaysia Pahang |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T02:12:30Z |
| publishDate | 2015 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | ump-182622018-07-19T06:55:22Z http://umpir.ump.edu.my/id/eprint/18262/ Adopting search-based algorithms for pairwise testing Abdullah, Nasser Alsewari, Abdulrahman A. Kamal Z., Zamli QA76 Computer software 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. IEEE 2015-11 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/18262/1/07333096.pdf 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 (Published) https://ieeexplore.ieee.org/document/7333096/ |
| spellingShingle | QA76 Computer software Abdullah, Nasser Alsewari, Abdulrahman A. Kamal Z., Zamli Adopting search-based algorithms for pairwise testing |
| title | Adopting search-based algorithms for pairwise testing |
| title_full | Adopting search-based algorithms for pairwise testing |
| title_fullStr | Adopting search-based algorithms for pairwise testing |
| title_full_unstemmed | Adopting search-based algorithms for pairwise testing |
| title_short | Adopting search-based algorithms for pairwise testing |
| title_sort | adopting search-based algorithms for pairwise testing |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/18262/ http://umpir.ump.edu.my/id/eprint/18262/ http://umpir.ump.edu.my/id/eprint/18262/1/07333096.pdf |