<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01405275</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-21T06:19:49+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Minimum Number of Test Paths for Prime Path and Other Structural Coverage Criteria</title>
            <author role="aut">
              <persName>
                <forename type="first">Anurag</forename>
                <surname>Dwarakanath</surname>
              </persName>
              <email type="md5">2efb3d3b4d7a7d06a9f21c26c8d15244</email>
              <email type="domain">accenture.com</email>
              <idno type="idhal" notation="numeric">994798</idno>
              <idno type="halauthorid" notation="string">1086259-994798</idno>
              <affiliation ref="#struct-474047"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Aruna</forename>
                <surname>Jankiti</surname>
              </persName>
              <email type="md5">6390377c8b76d365baa09fbd0934c9bd</email>
              <email type="domain">accenture.com</email>
              <idno type="idhal" notation="numeric">994799</idno>
              <idno type="halauthorid" notation="string">1086260-994799</idno>
              <affiliation ref="#struct-474047"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-11-29 16:39:33</date>
              <date type="whenModified">2016-11-29 16:48:50</date>
              <date type="whenReleased">2016-11-29 16:48:50</date>
              <date type="whenProduced">2014-09-23</date>
              <date type="whenEndEmbargoed">2017-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01405275v1/document">
                <date notBefore="2017-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01405275v1/file/978-3-662-44857-1_5_Chapter.pdf" id="file-1405275-1492056">
                <date notBefore="2017-01-01"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1809.08446"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01405275</idno>
            <idno type="halUri">https://inria.hal.science/hal-01405275</idno>
            <idno type="halBibtex">dwarakanath:hal-01405275</idno>
            <idno type="halRefHtml">&lt;i&gt;26th IFIP International Conference on Testing Software and Systems (ICTSS)&lt;/i&gt;, Sep 2014, Madrid, Spain. pp.63-79, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-662-44857-1_5"&gt;&amp;#x27E8;10.1007/978-3-662-44857-1_5&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">26th IFIP International Conference on Testing Software and Systems (ICTSS), Sep 2014, Madrid, Spain. pp.63-79, &amp;#x27E8;10.1007/978-3-662-44857-1_5&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1405275-1492056"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-WG" corresp="IFIP">Working Groups</idno>
            <idno type="stamp" n="IFIP-TC6" corresp="IFIP-TC">TC 6: Communication Systems</idno>
            <idno type="stamp" n="IFIP-WG6-1" corresp="IFIP-WG">Architectures and Protocols for Distributed Systems</idno>
            <idno type="stamp" n="IFIP-LNCS-8763" corresp="IFIP-LNCS">Testing Software and Systems</idno>
            <idno type="stamp" n="IFIP-ICTSS">IFIP-ICTSS</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 1: Testing Methodologies</note>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Minimum Number of Test Paths for Prime Path and Other Structural Coverage Criteria</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Anurag</forename>
                    <surname>Dwarakanath</surname>
                  </persName>
                  <email type="md5">2efb3d3b4d7a7d06a9f21c26c8d15244</email>
                  <email type="domain">accenture.com</email>
                  <idno type="idhal" notation="numeric">994798</idno>
                  <idno type="halauthorid" notation="string">1086259-994798</idno>
                  <affiliation ref="#struct-474047"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Aruna</forename>
                    <surname>Jankiti</surname>
                  </persName>
                  <email type="md5">6390377c8b76d365baa09fbd0934c9bd</email>
                  <email type="domain">accenture.com</email>
                  <idno type="idhal" notation="numeric">994799</idno>
                  <idno type="halauthorid" notation="string">1086260-994799</idno>
                  <affiliation ref="#struct-474047"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>26th IFIP International Conference on Testing Software and Systems (ICTSS)</title>
                  <date type="start">2014-09-23</date>
                  <date type="end">2014-09-25</date>
                  <settlement>Madrid</settlement>
                  <country key="ES">Spain</country>
                </meeting>
                <editor>Mercedes G. Merayo</editor>
                <editor>Edgardo Montes Oca</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Testing Software and Systems</biblScope>
                  <biblScope unit="volume">LNCS-8763</biblScope>
                  <biblScope unit="pp">63-79</biblScope>
                  <date type="datePub">2014</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-662-44857-1_5</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Minimum Flow</term>
                <term xml:lang="en">Prime Path Coverage</term>
                <term xml:lang="en">Minimum Number of Test Paths</term>
                <term xml:lang="en">Model Based Testing</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The software system under test can be modeled as a graph comprising of a set of vertices, V and a set of edges, E. Test Cases are Test Paths over the graph meeting a particular test criterion. In this paper, we present a method to achieve the minimum number of Test Paths needed to cover different structural coverage criteria. Our method can accommodate Prime Path, Edge-Pair, Simple &amp; Complete Round Trip, Edge and Node coverage criteria. Our method obtains the optimal solution by transforming the graph into a flow graph and solving the minimum flow problem. We present an algorithm for the minimum flow problem that matches the best known solution complexity of$ O\left(\left\vert{V}\right\vert\left\vert{E}\right\vert\right)$. Our method is evaluated through two sets of tests. In the first, we test against graphs representing actual software. In the second test, we create random graphs of varying complexity. In each test we measure the number of Test Paths, the length of Test Paths, the lower bound on minimum number of Test Paths and the execution time.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 6</org>
              <org type="consortium">WG 6.1</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-474047" status="VALID">
          <orgName>Accenture Technology Labs [Bangalore]</orgName>
          <date type="start">2016-12-01</date>
          <desc>
            <address>
              <country key="IN"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>