Test Cases Minimization Strategy Based On Flower Pollination Algorithm

The phenomenon of exhaustive testing in software testing is hard to implement due to a huge number of test cases and time-consuming in order to find bugs. Hence, a test cases minimization strategy is an essential to obtain an optimize test cases and consequently, time will also be reducing. An...

Full description

Bibliographic Details
Main Authors: Ho, Chai Har, Al-Sewari, Abdul Rahman Ahmed Mohammed
Format: Conference or Workshop Item
Language:English
Published: 2016
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/17326/
http://umpir.ump.edu.my/id/eprint/17326/1/403_408.pdf
_version_ 1848820402034311168
author Ho, Chai Har
Al-Sewari, Abdul Rahman Ahmed Mohammed
author_facet Ho, Chai Har
Al-Sewari, Abdul Rahman Ahmed Mohammed
author_sort Ho, Chai Har
building UMP Institutional Repository
collection Online Access
description The phenomenon of exhaustive testing in software testing is hard to implement due to a huge number of test cases and time-consuming in order to find bugs. Hence, a test cases minimization strategy is an essential to obtain an optimize test cases and consequently, time will also be reducing. An adoption of optimization based t-way strategies and nonoptimization based t-way strategies have come across. This paper describes the adoption of Flower Pollination Algorithm (FPA) in order to minimize the test cases. The FPA inspired from the reproduction of flowers to find the best optimum results when compared to other methods. This strategy will be evaluated by several published benchmarking.
first_indexed 2025-11-15T02:08:53Z
format Conference or Workshop Item
id ump-17326
institution Universiti Malaysia Pahang
institution_category Local University
language English
last_indexed 2025-11-15T02:08:53Z
publishDate 2016
recordtype eprints
repository_type Digital Repository
spelling ump-173262018-04-23T07:58:24Z http://umpir.ump.edu.my/id/eprint/17326/ Test Cases Minimization Strategy Based On Flower Pollination Algorithm Ho, Chai Har Al-Sewari, Abdul Rahman Ahmed Mohammed QA75 Electronic computers. Computer science The phenomenon of exhaustive testing in software testing is hard to implement due to a huge number of test cases and time-consuming in order to find bugs. Hence, a test cases minimization strategy is an essential to obtain an optimize test cases and consequently, time will also be reducing. An adoption of optimization based t-way strategies and nonoptimization based t-way strategies have come across. This paper describes the adoption of Flower Pollination Algorithm (FPA) in order to minimize the test cases. The FPA inspired from the reproduction of flowers to find the best optimum results when compared to other methods. This strategy will be evaluated by several published benchmarking. 2016 Conference or Workshop Item PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/17326/1/403_408.pdf Ho, Chai Har and Al-Sewari, Abdul Rahman Ahmed Mohammed (2016) Test Cases Minimization Strategy Based On Flower Pollination Algorithm. In: Proceeding of International Competition and Exhibition on Computing Innovation 2016 , 6-8 December 2016 , University Sports Complex, Universiti Malaysia Pahang. pp. 403-408.. ISBN 978-967-2054-04-7 (Published) http://icecinno.ump.edu.my/index.php/en/documents/pdf-files/proceeding-2016/194-403-408
spellingShingle QA75 Electronic computers. Computer science
Ho, Chai Har
Al-Sewari, Abdul Rahman Ahmed Mohammed
Test Cases Minimization Strategy Based On Flower Pollination Algorithm
title Test Cases Minimization Strategy Based On Flower Pollination Algorithm
title_full Test Cases Minimization Strategy Based On Flower Pollination Algorithm
title_fullStr Test Cases Minimization Strategy Based On Flower Pollination Algorithm
title_full_unstemmed Test Cases Minimization Strategy Based On Flower Pollination Algorithm
title_short Test Cases Minimization Strategy Based On Flower Pollination Algorithm
title_sort test cases minimization strategy based on flower pollination algorithm
topic QA75 Electronic computers. Computer science
url http://umpir.ump.edu.my/id/eprint/17326/
http://umpir.ump.edu.my/id/eprint/17326/
http://umpir.ump.edu.my/id/eprint/17326/1/403_408.pdf