Lattice-based adaptive random testing

Authors:
Johannes Mayer
Affiliations:
University of Ulm, Ulm, Germany
Venue:
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Year:
2005

Citing 9
Cited 17

Evaluating Testing Methods by Delivered Reliability

IEEE Transactions on Software Engineering
Art of Software Testing

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
Restricted Random Testing

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
Normalized restricted random testing

Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
Adaptive random testing

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

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
Enhancing adaptive random testing in high dimensional input domains

Proceedings of the 2007 ACM symposium on Applied computing
Random testing: from the classical approach to a global view and full test automation

Proceedings of the 2nd international workshop on Random testing: co-located with the 22nd IEEE/ACM International Conference on Automated Software Engineering (ASE 2007)
Automatic test data generation using particle systems

Proceedings of the 2008 ACM symposium on Applied computing
ARTOO: adaptive random testing for object-oriented software

Proceedings of the 30th international conference on Software engineering
Enhancing adaptive random testing for programs with high dimensional input domains or failure-unrelated parameters

Software Quality Control
Distributing test cases more evenly in adaptive random testing

Journal of Systems and Software
Enhanced lattice-based adaptive random testing

Proceedings of the 2009 ACM symposium on Applied Computing
Adaptive random testing based on distribution metrics

Journal of Systems and Software
Adaptive Random Testing: The ART of test case diversity

Journal of Systems and Software
Adaptive random testing: an illusion of effectiveness?

Proceedings of the 2011 International Symposium on Software Testing and Analysis
Comparison of adaptive random testing and random testing under various testing and debugging scenarios

Software—Practice & Experience
An orchestrated survey of methodologies for automated software test case generation

Journal of Systems and Software
Diversity oriented test data generation using metaheuristic search techniques

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adaptive Random Testing (ART) denotes a family of testing algorithms that have a better performance compared to pure random testing with respect to the number of test cases necessary to detect the first failure. Many of these algorithms, however, are not very efficient regarding runtime. A new ART algorithm is presented that has a better performance than all other ART methods for the block failure pattern. Its runtime is linear in the number of test cases selected, which is nearly as efficient as pure random testing, as opposed to most other ART methods. This new ART algorithm selects the test cases based on a lattice.