# Minimum Number of Test Paths for Prime Path and Other Structural Coverage Criteria

Abstract : 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 & 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.
Keywords :
Document type :
Conference papers
Domain :
Complete list of metadata

Cited literature [7 references]

https://hal.inria.fr/hal-01405275
Contributor : Hal Ifip <>
Submitted on : Tuesday, November 29, 2016 - 4:39:33 PM
Last modification on : Tuesday, November 29, 2016 - 4:48:50 PM
Long-term archiving on: : Monday, March 27, 2017 - 9:10:06 AM

### File

978-3-662-44857-1_5_Chapter.pd...
Files produced by the author(s)

### Citation

Anurag Dwarakanath, Aruna Jankiti. Minimum Number of Test Paths for Prime Path and Other Structural Coverage Criteria. 26th IFIP International Conference on Testing Software and Systems (ICTSS), Sep 2014, Madrid, Spain. pp.63-79, ⟨10.1007/978-3-662-44857-1_5⟩. ⟨hal-01405275⟩

Record views