An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion / (Record no. 7830)

MARC details
000 -LEADER
fixed length control field 04028ntm a2200361 i 4500
001 - CONTROL NUMBER
control field vtls000104444
003 - CONTROL NUMBER IDENTIFIER
control field KUKTEM
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20251117113404.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 180724s2018 my a f a m 000 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number THE0001130(Local)
039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE]
Level of rules in bibliographic description 201905141125
Level of effort used to assign nonsubject heading access points nazirah
Level of effort used to assign subject headings 201904181611
Level of effort used to assign classification nazri
Level of effort used to assign subject headings 201808131536
Level of effort used to assign classification fateeha
-- 201807241101
-- fateeha
040 ## - CATALOGING SOURCE
Original cataloging agency UMP
Language of cataloging eng
Transcribing agency UMP
Description conventions rda
090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) FSKKP .H37 2018 r Thesis
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Haque, Ariful,
Relator term author.
245 13 - TITLE STATEMENT
Title An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion /
Statement of responsibility, etc. Ariful Haque
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Kuantan, Pahang :
Name of producer, publisher, distributor, manufacturer UMP,
Date of production, publication, distribution, manufacture, or copyright notice 2018
300 ## - PHYSICAL DESCRIPTION
Extent xii, 95 pages :
Other physical details illustrations (some color) ;
Dimensions 30 cm. +
Accompanying material 1 CD ROM
336 ## - CONTENT TYPE
Content type term text
Source rdacontent
336 ## - CONTENT TYPE
Content type term text
Source rdacontent
337 ## - MEDIA TYPE
Media type term unmediated
Source rdamedia
337 ## - MEDIA TYPE
Media type term computer
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term volume
Source rdacarrier
338 ## - CARRIER TYPE
Carrier type term computer disc
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
500 ## - GENERAL NOTE
General note Faculty of Computer Systems and Software Engineering
502 ## - DISSERTATION NOTE
Dissertation note Thesis (Master of Science (Software Engineering)) -- Universiti Malaysia Pahang – 2018
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references
520 3# - SUMMARY, ETC.
Summary, etc. Software testing is an important part of software development as it ensures the proper functionality of software and reduces the risk of failure. In the case when software is being adopted in a mission critical application, failure can lead to loss of life and fortunes. Therefore, it is mandatory to test all possible functional paths of the software exhaustively. Exhaustive testing is costly and time consuming and with the higher number of inputs, the number of test cases increases exponentially. Many researchers suggested the adoption of Modified Condition / Decision Coverage (MC/DC) criterion as a solution to the problem particularly when the inputs involve Boolean variables. Often, MC/DC can reduce the number of test cases dramatically and ensure critical paths are tested. To generate test cases that satisfy MC/DC criterion, many researchers adopt neighborhood based meta-heuristics algorithms (including that of Simulated Annealing and Hill Climbing) as the problem itself is neighborhood based. Although useful, the existing algorithms does not provide any comparative data to select an algorithm based on the problem size and difficulty and the use of other neighborhood algorithms (including Great Deluge and Late Acceptance Hill Climbing) has not been sufficiently explored as well. In order to identify the strength and weakness of these algorithms for MC/DC compliant test cases, this research proposes an experimental study involving four neighborhoods based meta-heuristic algorithms. We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. Late Acceptance Hill Climbing (LAHC) and the Great Deluge Algorithm (GDA) which are our new implementation, Simulated Annealing (SA) and Hill Climbing (HC) are re-implemented to generate test cases satisfying MC/DC criterion for comparative analysis. The algorithms are used to generate test cases for nine different Boolean expressions of different size and complexities. Performance of each algorithm is compared in terms of number of test cases generated as well as the run time required. Our experience indicates that all the algorithms generate nearly similar number of test cases, but in terms of performance, they differ from one another. The elaborated result of the study will help test engineers to choose the algorithm they need to generate test cases efficiently and optimally.
610 20 - SUBJECT ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Faculty of Computer Systems and Software Engineering
General subdivision Dissertations
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Universities and colleges
General subdivision Disertations
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Theses
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
  Not lost Library of Congress Classification   Not for loan UMPLIB PEKAN UMPLIB PEKAN 04/09/2019   FSKKP .H37 2018 r Thesis 0000123618 04/09/2019 1 04/09/2019 Thesis
  Not lost Library of Congress Classification   Not for loan UMPLIB PEKAN UMPLIB PEKAN 04/09/2019   CD 11401 | FSKKP .H37 2018 r Thesis 0000123619 04/09/2019 1 04/09/2019 Thesis

Perpustakaan Universiti Malaysia Pahang Al-Sultan Abdullah
26600 Pekan, Pahang Darul Makmur
Phone: +609 431 5063 (Gambang) / +609 431 5035 (Pekan)
Email: umplibrary@umpsa.edu.my

Connect With Us