1 Ocak 2017 Konferans bildirisi Açık Erişim

Yamuc, Ali; Cingiz, M. Ozgur; Biricik, Goksel; Kalipsiz, Oya

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/98241</identifier>
  <creators>
    <creator>
      <creatorName>Yamuc, Ali</creatorName>
      <givenName>Ali</givenName>
      <familyName>Yamuc</familyName>
      <affiliation>TUBITAK BILGEM, Software Technol Res Inst, Ankara, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Cingiz, M. Ozgur</creatorName>
      <givenName>M. Ozgur</givenName>
      <familyName>Cingiz</familyName>
      <affiliation>Yildiz Tech Univ, Dept Comp Engn, Istanbul, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Biricik, Goksel</creatorName>
      <givenName>Goksel</givenName>
      <familyName>Biricik</familyName>
      <affiliation>Yildiz Tech Univ, Dept Comp Engn, Istanbul, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Kalipsiz, Oya</creatorName>
      <givenName>Oya</givenName>
      <familyName>Kalipsiz</familyName>
      <affiliation>Yildiz Tech Univ, Dept Comp Engn, Istanbul, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Solving Test Suite Reduction Problem Using Greedy And Genetic Algorithms</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2017</publicationYear>
  <dates>
    <date dateType="Issued">2017-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/98241</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.81043/aperta.98240</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.81043/aperta.98241</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">Regression testing is an important process for software quality. Test case reduction is one of the widely used techniques for regression testing, which can dramatically decrease the testing costs. However, it is an NP-complete problem and big test cases cannot be accomplished in reasonable amount of time. For this reason, we propose a test suite reduction approach by using greedy and genetic algorithms. The greedy algorithm found a wide usage in previous studies thanks to its simplicity, but we already know that it sticks to local optima and does not benefit from metaheuristics. Thus, we used genetic algorithm to overcome its weaknesses. Our experimental results prove that metaheuristics and evolutionary algorithms perform better than the greedy approaches.</description>
  </descriptions>
</resource>