Generation of All-Paths Unit Test with Function Calls

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 reliabil-ity. 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 flow graph (CFG). This representation combining functional and structural de-scriptions may be viewed as an extension of the classic CFG and allows us to characterise test selection criteria ensur-ing 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 rep-resentation, including all the paths arising from the func-tional description of the called functions. The second cri-terion covers all the feasible paths of the function under test only. We describe how we automate test-data genera-tion 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.