Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm
Interaction, or t-way, testing, where t indicates the interaction strength, is an approach to generate test suite for detecting fault due to interaction. In line with the emerging field called Search based Software Engineering, many recently developed t-way strategies have adopted meta-heuristic alg...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/24713/1/Sequence%20and%20sequence-less%20t-way%20test%20suite%20generation%20strategy%20based%20on%20the%20elitist%20flower%20pollination%20algorithm.pdf |
| _version_ | 1796993333065678848 |
|---|---|
| author | Mohammed Abdullah, Abdullah Nasser |
| author_facet | Mohammed Abdullah, Abdullah Nasser |
| author_sort | Mohammed Abdullah, Abdullah Nasser |
| collection | UMP |
| description | Interaction, or t-way, testing, where t indicates the interaction strength, is an approach to generate test suite for detecting fault due to interaction. In line with the emerging field called Search based Software Engineering, many recently developed t-way strategies have adopted meta-heuristic algorithms as the basis of their implementations such as Simulated Annealing, Genetic Algorithm, Ant Colony Optimization Algorithm, Particle Swarm Optimization, Harmony Search and Cuckoo Search, owing their superior performance in term of test size reduction as compared to general computational based strategies, such as General t-way, Test Vector Generator, In Parameter Order General, Jenny, and Automatic Efficient Test Generator. Although useful, all aforementioned t-way strategies have assumed sequence-less interactions amongst input parameters. In the case of reactive systems, such an assumption is invalid as some parameter operations, or events, occur in sequence and hence, creating a possibility of bugs or faults triggered by the order, or sequence, of input parameters. If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. Addressing these aforementioned issues and complementing the existing sequence based strategies such as t-SEQ, Sequence Covering Array Generator and Bee Algorithm, this thesis presents a unified strategy based on the new meta-heuristic algorithm, called the Elitist Flower Pollination Algorithm (eFPA). Unlike existing work, eFPA presents the novel approach of integrating both sequence and sequence-less t-way test suite generation within a single strategy. Concerning the sequence benchmark experiments, eFPA has superior performance when compared with the existing sequence based strategies (with 100% rejection of the null hypothesis). As for sequence-less benchmark experiments, eFPA outperforms most existing strategies (with 92.85% rejection of the null hypothesis). Additionally, we also conclude that eFPA generates better results as compared to the original FPA owing to its enhanced exploration capability through the additional elitism mechanism. In fact, the design of eFPA adds new value into the domain software testing as it is the first t-way strategy that adopts elitism-FPA as its core implementation. |
| first_indexed | 2024-03-06T12:32:27Z |
| format | Thesis |
| id | UMPir24713 |
| institution | Universiti Malaysia Pahang |
| language | English |
| last_indexed | 2024-03-06T12:32:27Z |
| publishDate | 2018 |
| record_format | dspace |
| spelling | UMPir247132021-11-10T00:15:06Z http://umpir.ump.edu.my/id/eprint/24713/ Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm Mohammed Abdullah, Abdullah Nasser QA76 Computer software Interaction, or t-way, testing, where t indicates the interaction strength, is an approach to generate test suite for detecting fault due to interaction. In line with the emerging field called Search based Software Engineering, many recently developed t-way strategies have adopted meta-heuristic algorithms as the basis of their implementations such as Simulated Annealing, Genetic Algorithm, Ant Colony Optimization Algorithm, Particle Swarm Optimization, Harmony Search and Cuckoo Search, owing their superior performance in term of test size reduction as compared to general computational based strategies, such as General t-way, Test Vector Generator, In Parameter Order General, Jenny, and Automatic Efficient Test Generator. Although useful, all aforementioned t-way strategies have assumed sequence-less interactions amongst input parameters. In the case of reactive systems, such an assumption is invalid as some parameter operations, or events, occur in sequence and hence, creating a possibility of bugs or faults triggered by the order, or sequence, of input parameters. If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. Addressing these aforementioned issues and complementing the existing sequence based strategies such as t-SEQ, Sequence Covering Array Generator and Bee Algorithm, this thesis presents a unified strategy based on the new meta-heuristic algorithm, called the Elitist Flower Pollination Algorithm (eFPA). Unlike existing work, eFPA presents the novel approach of integrating both sequence and sequence-less t-way test suite generation within a single strategy. Concerning the sequence benchmark experiments, eFPA has superior performance when compared with the existing sequence based strategies (with 100% rejection of the null hypothesis). As for sequence-less benchmark experiments, eFPA outperforms most existing strategies (with 92.85% rejection of the null hypothesis). Additionally, we also conclude that eFPA generates better results as compared to the original FPA owing to its enhanced exploration capability through the additional elitism mechanism. In fact, the design of eFPA adds new value into the domain software testing as it is the first t-way strategy that adopts elitism-FPA as its core implementation. 2018-03 Thesis NonPeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/24713/1/Sequence%20and%20sequence-less%20t-way%20test%20suite%20generation%20strategy%20based%20on%20the%20elitist%20flower%20pollination%20algorithm.pdf Mohammed Abdullah, Abdullah Nasser (2018) Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm. PhD thesis, Universiti Malaysia Pahang (Contributors, UNSPECIFIED: UNSPECIFIED). |
| spellingShingle | QA76 Computer software Mohammed Abdullah, Abdullah Nasser Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm |
| title | Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm |
| title_full | Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm |
| title_fullStr | Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm |
| title_full_unstemmed | Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm |
| title_short | Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm |
| title_sort | sequence and sequence less t way test suite generation strategy based on the elitist flower pollination algorithm |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/24713/1/Sequence%20and%20sequence-less%20t-way%20test%20suite%20generation%20strategy%20based%20on%20the%20elitist%20flower%20pollination%20algorithm.pdf |
| work_keys_str_mv | AT mohammedabdullahabdullahnasser sequenceandsequencelesstwaytestsuitegenerationstrategybasedontheelitistflowerpollinationalgorithm |