000			03831ntm a2200349 i 4500
001			vtls000104340
003			KUKTEM
005			20251117113404.0
008			180719s2018 my da f am 000 0 eng d
020			_aTHE0001060(Local)
039		9	_a201905171316 _bnazirah _y201807191555 _zsaini
040			_aUMP _beng _cUMP _erda
090			_aFSKKP .A23 2018 r Thesis
100	1		_aMohammed Abdullah, Abdullah Nasser, _eauthor.
245	1	0	_aSequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm / _cAbdullah Nasser Mohammed Abdullah
264		1	_aKuantan, Pahang : _bUMP, _c2018
300			_axii, 132 pages : _billustrations (some color), chart ; _c30 cm. + _e1 CD-ROM
336			_atext _2rdacontent
337			_aunmediated _2rdamedia
337			_acomputer _2rdamedia
338			_avolume _2rdacarrier
338			_acomputer disc _2rdacarrier
347			_atext file _bPDF _2rda
500			_aFaculty of Computer Systems and Software Engineering
502			_aThesis (Doctor of Philosophy in Computer Science) -- Universiti Malaysia Pahang – 2018
504			_aIncludes bibliographical references
520	3		_aInteraction, or t-way, testing, where 𝑡 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.
610	2	0	_aFaculty of Computer Systems and Software Engineering _xDissertations
650		0	_aUniversities and colleges _xDisertations
650		0	_aTheses
999			_aVIRTUA40 _c7821 _d7827
999			_aVTLSSORT0080*0200*0400*0900*1000*2450*2640*3000*3360*3370*3371*3380*3381*3470*5000*5020*5040*5200*6100*6500*6501*9992