Partition Testing Does Not Inspire Confidence (Program Testing)
IEEE Transactions on Software Engineering
Art of Software Testing
IEEE Software
ECSQ '02 Proceedings of the 7th International Conference on Software Quality
Mirror Adaptive Random Testing
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
Lattice-based adaptive random testing
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Generalized symbolic execution for model checking and testing
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
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
Experimental assessment of random testing for object-oriented software
Proceedings of the 2007 international symposium on Software testing and analysis
A genetic approach for random testing of database systems
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
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
Testing criteria for object oriented visual dataflow languages
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
Automatic Testing of Object-Oriented Software
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Distributing test cases more evenly in adaptive random testing
Journal of Systems and Software
Synthesizing intensional behavior models by graph transformation
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
Adaptive random testing based on distribution metrics
Journal of Systems and Software
Clustering test cases to achieve effective test selection
Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India
Automated test scenario selection based on levenshtein distance
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Dependable Systems
How well does test case prioritization integrate with statistical fault localization?
Information and Software Technology
Antirandom Test Vectors for BIST in Hardware/Software Systems
Fundamenta Informaticae
Test data variance as a test quality measure: exemplified for TTCN-3
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
| Hi-index | 0.00 |
Testing with random inputs can give surprisingly good results if the distribution of inputs is spread out evenly over the input domain; this is the intuition behind Adaptive Random Testing, which relies on a notion of "distance" between test values. Such distances have so far been defined for integers and other elementary inputs; extending the idea to the testing of today's object-oriented programs requires a more general notion of distance, applicable to composite programmer-defined types.We define a notion of object distance, with associated algorithms to compute distances between arbitrary objects, and use it to generalize Adaptive Random Testing to such inputs. The resulting testing strategies open the way for effective automated testing of large, realistic object-oriented programs.