Partition Testing Does Not Inspire Confidence (Program Testing)
IEEE Transactions on Software Engineering
Analyzing Partition Testing Strategies
IEEE Transactions on Software Engineering
A Fortran language system for mutation-based software testing
Software—Practice & Experience
Investigations of the software testing coupling effect
ACM Transactions on Software Engineering and Methodology (TOSEM)
On the Relationship Between Partition and Random Testing
IEEE Transactions on Software Engineering
On the Expected Number of Failures Detected by Subdomain Testing and Random Testing
IEEE Transactions on Software Engineering
Partition Testing vs. Random Testing: The Influence of Uncertainty
IEEE Transactions on Software Engineering
Art of Software Testing
Proportional sampling strategy: a compendium and some insights
Journal of Systems and Software
Introduction to Algorithms
ECSQ '02 Proceedings of the 7th International Conference on Software Quality
Massive Stochastic Testing of SQL
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Random Program Generator for Java JIT Compiler Test System
QSIC '03 Proceedings of the Third International Conference on Quality Software
Mirror Adaptive Random Testing
QSIC '03 Proceedings of the Third International Conference on Quality Software
On the analytical comparison of testing techniques
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Adaptive Random Testing Through Dynamic Partitioning
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
On the Statistical Properties of the F-measure
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
An experimental mutation system for Java
ACM SIGSOFT Software Engineering Notes
A Revisit of Adaptive Random Testing by Restriction
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Adaptive Random Testing by Localization
APSEC '04 Proceedings of the 11th Asia-Pacific Software Engineering Conference
Is mutation an appropriate tool for testing experiments?
Proceedings of the 27th international conference on Software engineering
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Lattice-based adaptive random testing
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Efficient and Effective Random Testing Using the Voronoi Diagram
ASWEC '06 Proceedings of the Australian Software Engineering Conference
On the statistical properties of testing effectiveness measures
Journal of Systems and Software - Special issue: Quality software
An empirical study of the robustness of Windows NT applications using random testing
WSS'00 Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4
Normalized restricted random testing
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
Adaptive random testing through iterative partitioning
Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
Adaptive random testing by bisection with restriction
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Adaptive random testing by bisection and localization
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Adaptive random testing through iterative partitioning revisited
Proceedings of the 3rd international workshop on Software quality assurance
Towards the determination of typical failure patterns
Fourth international workshop on Software quality assurance: in conjunction with the 6th ESEC/FSE joint meeting
Sufficient mutation operators for measuring test effectiveness
Proceedings of the 30th international conference on Software engineering
Distributing test cases more evenly in adaptive random testing
Journal of Systems and Software
Adaptive random testing based on distribution metrics
Journal of Systems and Software
Is operator-based mutant selection superior to random mutant selection?
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
An experimental assessment of module documentation-based testing
Information and Software Technology
Fuzzing the out-of-memory killer on embedded Linux: an adaptive random approach
Proceedings of the 2011 ACM Symposium on Applied Computing
Adaptive random testing: an illusion of effectiveness?
Proceedings of the 2011 International Symposium on Software Testing and Analysis
The use of mutation in testing experiments and its sensitivity to external threats
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Prioritizing test cases with string distances
Automated Software Engineering
GUI testing assisted by human knowledge: Random vs. functional
Journal of Systems and Software
An empirical study on the use of mutant traces for diagnosis of faults in deployed systems
Journal of Systems and Software
Hi-index | 0.00 |
Testing with randomly generated test inputs, namely Random Testing, is a strategy that has been applied succefully in a lot of cases. Recently, some new adaptive approaches to the random generation of test cases have been proposed. Whereas there are many comparisons of Random Testing with Partition Testing, a systematic comparison of random testing techniques is still missing. This paper presents an empirical analysis and comparison of all random testing techniques from the field of Adaptive Random Testing (ART). The ART algorithms are compared for effectiveness using the mean F-measure, obtained through simulation and mutation analysis, and the P-measure. An interesting connection between the testing effectiveness measures F-measure and P-measure is described. The spatial distribution of test cases is determined to explain the behavior of the methods and identify possible shortcomings. Besides this, both the theoretical asymptotic runtime and the empirical runtime for each method are given.