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
Download to read the full chapter text
Chapter PDF
References
Aho, A.V., Lee, D.: Efficient algorithms for constructing testing sets, covering paths, and minimum flows. AT&T Bell Laboratories Tech. Memo. CSTR159 (1987)
Ammann, P., Offutt, J.: Introduction to software testing. Cambridge University Press (2008)
Ammann, P., Offutt, J.: W., X., Li, N.: Coverage computation web applications (2008), http://cs.gmu.edu:8080/offutt/coverage/ (online; accessed April 26, 2014)
Ciurea, E., Ciupalâ, L.: Sequential and parallel algorithms for minimum flows. Journal of Applied Mathematics and Computing 15(1-2), 53–75 (2004)
Ford, L., Fulkerson, D.R.: Flows in networks. Princeton University Press (1962)
Kaminski, G.K., Praphamontripong, U., Ammann, P., Offutt, J.: An evaluation of the minimal-mumcut logic criterion and prime path coverage. In: Software Engineering Research and Practice, pp. 205–211 (2010)
Li, N., Li, F., Offutt, J.: Better algorithms to minimize the cost of test paths. In: 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation (ICST), pp. 280–289. IEEE (2012)
Ntafos, S.C., Hakimi, S.L.: On path cover problems in digraphs and applications to program testing. IEEE Transactions on Software Engineering (5), 520–529 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Dwarakanath, A., Jankiti, A. (2014). Minimum Number of Test Paths for Prime Path and Other Structural Coverage Criteria. In: Merayo, M.G., de Oca, E.M. (eds) Testing Software and Systems. ICTSS 2014. Lecture Notes in Computer Science, vol 8763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44857-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-44857-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44856-4
Online ISBN: 978-3-662-44857-1
eBook Packages: Computer ScienceComputer Science (R0)