The Community for Technology Leaders
2008 1st International Conference on Software Testing, Verification, and Validation (2008)
Apr. 9, 2008 to Apr. 11, 2008
ISBN: 978-0-7695-3127-4
pp: 32-41
Structural testing is usually restricted to unit tests and based on some clear definition of source code coverage. In particular, the all-paths criterion, which requires at least one test-case per feasible path of the function under test, is recognised as offering a high level of software reliability.??This paper deals with the difficulties of using structural unit testing to test functions which call other functions. To limit the resulting combinatorial explosion in the number of paths, we choose to abstract the called functions by their specification. We incorporate the functional information on the called functions within the structural information on the function under test, given as a control flowgraph (CFG). This representation combining functional and structural descriptions may be viewed as an extension of the classic CFG and allows us to characterise test selection criteria ensuring the coverage of the source code of the function under test. Two new criteria will be proposed. The first criterion corresponds to the coverage of all the paths of this new representation, including all the paths arising from the functional description of the called functions. The second criterion covers all the feasible paths of the function under test only. We describe how we automate test-data generation with respect to such grey-box (combinations of black-box and white-box) test selection strategies, and we apply the resulting extension of our PathCrawler tool to examples coded in the C language.
unit test, structural testing, all-paths unit test, automatic generation, constraint solving, unit test with function calls, testing C programs

P. L. Gall, B. Marre, N. Willams and P. Mouy, "Generation of All-Paths Unit Test with Function Calls," 2008 1st International Conference on Software Testing, Verification, and Validation(ICST), vol. 00, no. , pp. 32-41, 2008.
95 ms
(Ver 3.3 (11022016))