Abstract
Generating test data does require a great amount of effort. The estimation of this effort beforehand is difficult and unclear when generating test data for exercising certain program structural characteristics. Methods that try to generate test data based on a minimum number of paths fail to estimate a lower bound in advance. When some of the paths they generate are infeasible, this situation is worsened. Thus, the generation of the test paths is important due to the presence of infeasible paths. Knowing the effort involved in deriving the appropriate test paths is a very useful exercise. This effort is linked directly to the estimation of the effort involved in achieving a high level of reliability. In this paper methods that do suggest a lower bound and an experimental upper bound are presented. Their ability of circumventing the incidence of infeasible paths is discussed and the lower and upper bounds of the cost and effort for test data generation analysed.
Chapter PDF
Similar content being viewed by others
References
Bertolino, A. and Marre, M. (1994) Automatic generation of path covers based on the control flow analysis of computer programs, IEEE Trans. Soft. Engin., 20, 885–99.
Hedley, D. and Hennell, M.A. (1985) The causes and effects of infeasible paths in computer programs, in Proceedings of the 8th International Conference on Software Engineering, London, UK, 259–66.
Hennell M.A. (1991) Testing for the achievement of software reliability, Reliab. Engin. and System Safety, Elsevier Scien. Pub. Ltd Eng., 32, 119–34.
Malevris, N. (1995) A path generation method for testing LCSAJs that restrains infeasible paths, Information and Software Technology, 37, 435–41.
Ntafos, S.C. (1988) A comparison of some structural testing strategies, IEEE Trans. Soft. Eng., 14, 868–74.
Ntafos, S.C. and Hakimi, S.L. (1979) On path cover problems in digraphs and applications to program testing, IEEE Trans. Soft. Eng., 5, 520–9.
Veevers, A. (1991) Some issues in software reliability assessment, Journal of Soft. Testing Verif. and Reliab., 1, 17–22.
Wang H.S., Hsu S.R. and Lin J.C. (1989) A generalized optimal path selection model for structural program testing, J. Syst. and Software, 10, 55–63.
Weyuker, E.J. (1979) The applicability of program schema results to programs, International Journal of Computing and Information Science, 8, 387–403.
Woodward M.R. (1984) An investigation into program paths and their representation, Technique et Science Informatiques, 3, 273–9.
Yates, D.F. and Hennell, M.A. (1985) An approach to branch testing, Proc. 11 th Workshop on Graph Theoretic Techniques in Comp. Science, Wurtzburg, West Germany, 421–33.
Yates, D.F. and Malevris, N. (1989) Reducing the effects of infeasible paths in branch testing, in Proceedings of the 3rd Symposium on Software Testing, Analysis and Verification (TAV3), Key West, Florida, USA, 48–56.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Malevris, N. (1997). An assessment of the number of paths needed for control flow testing. In: Gritzalis, D. (eds) Reliability, Quality and Safety of Software-Intensive Systems. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35097-4_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-35097-4_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6399-7
Online ISBN: 978-0-387-35097-4
eBook Packages: Springer Book Archive