By the same authors

Efficient Subdomains for Random Testing

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

Author(s)

Department/unit(s)

Publication details

Title of host publicationSearch Based Software Engineering
DatePublished - 2013
Pages251-256
Number of pages6
PublisherSpringer
Volume8084 LNCS
Original languageEnglish
ISBN (Print)978-3-642-39742-4

Publication series

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

Abstract

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.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations