<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Test cases minimization strategy based on optimization approach (MS-OA)</title>
  </titleInfo>
  <name type="personal">
    <namePart>Ho, Chai Har</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource manuscript="yes">text</typeOfResource>
  <genre authority="marc">abstract or summary</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">my</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Kuantan, Pahang</placeTerm>
    </place>
    <publisher>UMP</publisher>
    <dateIssued>2016</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xv, 107 p. : ill. (some col.) ; 30 cm. + 1 CD-ROM</extent>
  </physicalDescription>
  <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.</abstract>
  <targetAudience authority="marctarget">specialized</targetAudience>
  <note type="statement of responsibility">Ho Chai Har</note>
  <note>Faculty of Computer Systems and Software Engineering</note>
  <note>Project paper (Bachelor of Computer Science (Software Engineering) With Honours) -- Universiti Malaysia Pahang – 2016</note>
  <note>Bibliography : p. 102-106</note>
  <subject authority="lcsh">
    <name type="corporate">
      <namePart>Faculty of Computer Systems and Software Engineering</namePart>
    </name>
    <topic>Dissertations</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Universities and Colleges</topic>
    <topic>Dissertations</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Theses</topic>
  </subject>
  <identifier type="isbn">THE0001136(Local)</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">UMP</recordContentSource>
    <recordCreationDate encoding="marc">170419</recordCreationDate>
    <recordChangeDate encoding="iso8601">20251117113335.0</recordChangeDate>
    <recordIdentifier source="KUKTEM">vtls000099192</recordIdentifier>
  </recordInfo>
</mods>
