Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs
IEEE Transactions on Software Engineering
Software unit test coverage and adequacy
ACM Computing Surveys (CSUR)
The causes and effects of infeasible paths in computer programs
ICSE '85 Proceedings of the 8th international conference on Software engineering
Symbolic execution and program testing
Communications of the ACM
Structured testing: analysis and extensions
Structured testing: analysis and extensions
The Automatic Generation of Basis Set of Path for Path Testing
ATS '05 Proceedings of the 14th Asian Test Symposium on Asian Test Symposium
A Test Data Generation Tool for Unit Testing of C Programs
QSIC '06 Proceedings of the Sixth International Conference on Quality Software
IEEE Transactions on Software Engineering
PathCrawler: automatic generation of path tests by combining static and dynamic analysis
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Improving the testing and testability of software product lines
SPLC'10 Proceedings of the 14th international conference on Software product lines: going beyond
An efficient bitwise algorithm for intra-procedural data-flow testing coverage
Information Processing Letters
Automatic generation of basis test paths using variable length genetic algorithm
Information Processing Letters
| Hi-index | 0.89 |
Basis path testing is a very powerful structural testing criterion. The number of test paths equals to the cyclomatic complexity of program defined by McCabe. Traditional test generation methods select the paths either without consideration of the constraints of variables or interactively. In this note, an efficient method is presented to generate a set of feasible basis paths. The experiments show that this method can generate feasible basis paths for real-world C programs automatically in acceptable time.