Remark on “Algorithm 424: Clenshaw-Curtis Quadrature [O1]”
ACM Transactions on Mathematical Software (TOMS)
Remark on algorithm 408: a sparse matrix package (part 1) [F4]
ACM Transactions on Mathematical Software (TOMS)
Art of Software Testing
The Elements of Programming Style
The Elements of Programming Style
SELECT—a formal system for testing and debugging programs by symbolic execution
Proceedings of the international conference on Reliable software
An experimental analysis of program verification methods.
An experimental analysis of program verification methods.
A Cost Model for Determining the Optimal Number of Software Test Cases
IEEE Transactions on Software Engineering
Reliability, sampling, and algorithmic randomness
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Software trustability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Analyzing the test process using structural coverage
ICSE '85 Proceedings of the 8th international conference on Software engineering
A heuristic approach for test case generation
CSC '91 Proceedings of the 19th annual conference on Computer Science
Proceedings of the 22nd international conference on Software engineering
Validation, Verification, and Testing of Computer Software
ACM Computing Surveys (CSUR)
Assessing Test Data Adequacy through Program Inference
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Rule-Based Software Test Data Generator
IEEE Transactions on Knowledge and Data Engineering
An evaluation of required element testing strategies
ICSE '84 Proceedings of the 7th international conference on Software engineering
On the Use of Uniform Random Generation of Automata for Testing
Electronic Notes in Theoretical Computer Science (ENTCS)
A random testing approach using pushdown automata
TAP'11 Proceedings of the 5th international conference on Tests and proofs
| Hi-index | 0.00 |
Random testing of programs is usually (but not always) viewed as a worst case of program testing. Test case generation that takes into account the program structure is usually preferred. Path testing is an often proposed ideal for structural testing. Path testing is treated here as an instance of partition testing. (Partition testing is any testing scheme which forces execution of at least one test case from each subset of a partition of the input domain.) Simulation results are presented which treat path and partition testing in a reasonably favorable way, and yet still suggest that random testing may often be more cost effective. Results of actual random testing experiments are presented which tend to confirm the viability of random testing as a useful validation tool.