Data Diversity: An Approach to Software Fault Tolerance
IEEE Transactions on Computers - Fault-Tolerant Computing
An empirical study of the reliability of UNIX utilities
Communications of the ACM
Art of Software Testing
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
Adaptive Random Testing Through Dynamic Partitioning
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Adaptive Random Testing by Localization
APSEC '04 Proceedings of the 11th Asia-Pacific Software Engineering Conference
Random testing of interrupt-driven software
Proceedings of the 5th ACM international conference on Embedded software
Lattice-based adaptive random testing
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Object distance and its application to adaptive random testing of object-oriented programs
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
Enhancing adaptive random testing in high dimensional input domains
Proceedings of the 2007 ACM symposium on Applied computing
Enhancing Adaptive Random Testing through Partitioning by Edge and Centre
ASWEC '07 Proceedings of the 2007 Australian Software Engineering Conference
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
A Data Flow Oriented Program Testing Strategy
IEEE Transactions on Software Engineering
A Domain Strategy for Computer Program Testing
IEEE Transactions on Software Engineering
An upper bound on software testing effectiveness
ACM Transactions on Software Engineering and Methodology (TOSEM)
ARTOO: adaptive random testing for object-oriented software
Proceedings of the 30th international conference on Software engineering
Adaptive random testing through iterative partitioning
Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
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: an illusion of effectiveness?
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Hi-index | 0.00 |
Adaptive random testing (ART) has recently been proposed to enhance the failure-detection capability of random testing. In ART, test cases are not only randomly generated, but also evenly spread over the input domain. Various ART algorithms have been developed to evenly spread test cases in different ways. Previous studies have shown that some ART algorithms prefer to select test cases from the edge part of the input domain rather than from the centre part, that is, inputs do not have equal chance to be selected as test cases. Since we do not know where the failure-causing inputs are prior to testing, it is not desirable for inputs to have different chances of being selected as test cases. Therefore, in this paper, we investigate how to enhance some ART algorithms by offsetting the edge preference, and propose a new family of ART algorithms. A series of simulations have been conducted and it is shown that these new algorithms not only select test cases more evenly, but also have better failure detection capabilities.