<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-011-06-0898</article-id>
      <article-id pub-id-type="publisher-id">28417</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>D.2.5 - Testing and Debugging</subject>
          <subject>K.6.3 - Software Management</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Automatic Test Data Generation for Data Flow Testing Using a Genetic Algorithm</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Girgis</surname>
            <given-names>Moheb R.</given-names>
          </name>
          <email xlink:type="simple">moheb_r_g@yahoo.com</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Computer Science Department, Faculty of Science, Minia University, El-Minia, Egypt</addr-line>
        <institution>Computer Science Department, Faculty of Science, Minia University</institution>
        <addr-line content-type="city">El-Minia</addr-line>
        <country>Egypt</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Moheb R. Girgis (<email xlink:type="simple">moheb_r_g@yahoo.com</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2005</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>06</month>
        <year>2005</year>
      </pub-date>
      <volume>11</volume>
      <issue>6</issue>
      <fpage>898</fpage>
      <lpage>915</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/98F346A1-F8AA-5655-A4D0-0F47924DE3F1">98F346A1-F8AA-5655-A4D0-0F47924DE3F1</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/6996775">6996775</uri>
      <permissions>
        <copyright-statement>Moheb R. Girgis</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>One of the major difficulties in software testing is the automatic generation of test data that satisfy a given adequacy criterion. This paper presents an automatic test data generation technique that uses a genetic algorithm (GA), which is guided by the data flow dependencies in the program, to search for test data to cover its def-use associations. The GA conducts its search by constructing new test data from previously generated test data that are evaluated as effective test data. The approach can be used in test data generation for programs with/without loops and procedures. The proposed GA accepts as input an instrumented version of the program to be tested, the list of def-use associations to be covered, the number of input variables, and the domain and precision of each input variable. The algorithm produces a set of test cases, the set of def-use associations covered by each test case, and a list of uncovered def-use associations, if any. In the parent selection process, the GA uses one of two methods: the roulette wheel method or a proposed method, called the random selection method, according to the user choice. Finally, the paper presents the results of the experiments that have been carried out to evaluate the effectiveness of the proposed GA compared to the random testing technique, and to compare the proposed random selection method to the roulette wheel method.</p>
      </abstract>
    </article-meta>
  </front>
</article>
