Normal view MARC view ISBD view

Test cases minimization strategy based on optimization approach (MS-OA) / Ho Chai Har

By:

Ho, Chai Har

Material type: Text

TextPublication details: Kuantan, Pahang : UMP, 2016Description: xv, 107 p. : ill. (some col.) ; 30 cm. + 1 CD-ROMISBN:

THE0001136(Local)

Subject(s):

Dissertation note: Project paper (Bachelor of Computer Science (Software Engineering) With Honours) -- Universiti Malaysia Pahang – 2016 Abstract: 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 (t is the degree of the system parameter combination) such as Genetic Algorithm, Harmony Search Algorithm, Ant Colony Optimization and others have come across. Besides, non-optimization based t-way strategies such as TVG, Jenny, IPOG and WITCH have also been involved. Although, the existence of both t-way strategies is being used and discussed, however, the major objective of this study is to propose a new test case minimization strategy based on optimization approach which is Flower Pollination Algorithm (FPA). The analytical and experimental findings evaluate the performance of the proposed strategy with existing combinatorial testing strategies. The research findings that have been obtained from the evaluation indicated that FPA able to reduce a large number of test cases. On the basis of the findings of this research, it can be concluded that the FPA has the potential to optimize the number of test cases compared to others t-way strategies no matter is optimization based or non-optimization based.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 4 )

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode
Final Year Report	UMPLIB PEKAN	FSKKP .H63 2016 r Bc. (Browse shelf(Opens below))	1	Not for loan		0000117590
Final Year Report	UMPLIB PEKAN	CD 10698 \| FSKKP .H63 2016 r Bc. (Browse shelf(Opens below))	1	Not for loan		0000117591

Faculty of Computer Systems and Software Engineering

Project paper (Bachelor of Computer Science (Software Engineering) With Honours) -- Universiti Malaysia Pahang – 2016

Bibliography : p. 102-106

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 (t is the degree of the system parameter combination) such as Genetic Algorithm, Harmony Search Algorithm, Ant Colony Optimization and others have come across. Besides, non-optimization based t-way strategies such as TVG, Jenny, IPOG and WITCH have also been involved. Although, the existence of both t-way strategies is being used and discussed, however, the major objective of this study is to propose a new test case minimization strategy based on optimization approach which is Flower Pollination Algorithm (FPA). The analytical and experimental findings evaluate the performance of the proposed strategy with existing combinatorial testing strategies. The research findings that have been obtained from the evaluation indicated that FPA able to reduce a large number of test cases. On the basis of the findings of this research, it can be concluded that the FPA has the potential to optimize the number of test cases compared to others t-way strategies no matter is optimization based or non-optimization based.