Issue No.06 - November (1980 vol.6)
null Kuo-Chung Tai , Department of Computer Science, North Carolina State University
This paper explores the testing complexity of several classes of programs, where the testing complexity is measured in terms of the number of test data required for demonstrating program correctness by testing. It is shown that even for very restrictive classes of programs, none of the commonly used test criteria, namely, having every statement, branch, and path executed at least once, is nearly sufficient to guarantee absence of errors.
test data generation, Program testing, testing complexity, test criteria
null Kuo-Chung Tai, "Program Testing Complexity and Test Criteria", IEEE Transactions on Software Engineering, vol.6, no. 6, pp. 531-538, November 1980, doi:10.1109/TSE.1980.234501