Partition Testing Does Not Inspire Confidence (Program Testing)
IEEE Transactions on Software Engineering
Analyzing Partition Testing Strategies
IEEE Transactions on Software Engineering
On the Relationship Between Partition and Random Testing
IEEE Transactions on Software Engineering
Evaluating Testing Methods by Delivered Reliability
IEEE Transactions on Software Engineering
Art of Software Testing
Proportional sampling strategy: a compendium and some insights
Journal of Systems and Software
Correction to: Evaluating Testing Methods by Delivered Reliability
IEEE Transactions on Software Engineering
ECSQ '02 Proceedings of the 7th International Conference on Software Quality
Adaptive Random Testing Through Dynamic Partitioning
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
A Revisit of Adaptive Random Testing by Restriction
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Comment on "When to Use Random Testing"
IEEE Transactions on Computers
IEEE Transactions on Computers
Normalized restricted random testing
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
Object distance and its application to adaptive random testing of object-oriented programs
Proceedings of the 1st international workshop on Random testing
Adaptive random testing with randomly translated failure region
Proceedings of the 1st international workshop on Random testing
An empirical analysis and comparison of random testing techniques
Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering
Adaptive random testing through iterative partitioning revisited
Proceedings of the 3rd international workshop on Software quality assurance
ARTOO: adaptive random testing for object-oriented software
Proceedings of the 30th international conference on Software engineering
| Hi-index | 0.00 |
Random Testing is a strategy to select test cases based on pure randomness. Adaptive Random Testing (ART), a family of algorithms, improves pure Random Testing by taking common failure pattern into account. The best—in terms of the number of test cases necessary to detect the first failure—ART algorithms, however, are too runtime inefficient. Therefore, a modification of a fast, but not so good ART algorithm, namely ART by Bisection, is presented. This modification requires much less test cases than the original method while retaining its computational efficiency.