Efficient Subdomains for Random Testing

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Opinion is divided over the effectiveness of random testing. It produces test cases cheaply, but struggles with boundary conditions and is labour intensive without an automated oracle. We have created a search-based testing technique that evolves multiple sets of efficient subdomains, from which small but effective test suites can be randomly sampled. The new technique handles boundary conditions by targeting different mutants with each set of subdomains. It achieves an average 230% improvement in mutation score over conventional random testing.
Original languageEnglish
Title of host publicationSearch Based Software Engineering
Number of pages6
Volume8084 LNCS
ISBN (Print)978-3-642-39742-4
Publication statusPublished - 2013
Event5th International Symposium on Search Based Software Engineering - St. Petersburg, Russian Federation
Duration: 24 Aug 201326 Aug 2013

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Conference5th International Symposium on Search Based Software Engineering
Country/TerritoryRussian Federation
CitySt. Petersburg

Cite this