Efficient Subdomains for Random Testing

Matthew Timothy Patrick; Rob Alexander; Manuel Yves Antoine Oriol; John Andrew Clark

doi:10.1007/978-3-642-39742-4_20

Efficient Subdomains for Random Testing

Matthew Timothy Patrick, Rob Alexander, Manuel Yves Antoine Oriol, John Andrew Clark

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	Search Based Software Engineering
Publisher	Springer
Pages	251-256
Number of pages	6
Volume	8084 LNCS
ISBN (Print)	978-3-642-39742-4
DOIs	https://doi.org/10.1007/978-3-642-39742-4_20
Publication status	Published - 2013
Event	5th International Symposium on Search Based Software Engineering - St. Petersburg, Russian Federation Duration: 24 Aug 2013 → 26 Aug 2013

Publication series

Name	Lecture Notes in Computer Science
Volume	8084
ISSN (Print)	0302-9743

Conference

Conference	5th International Symposium on Search Based Software Engineering
Country/Territory	Russian Federation
City	St. Petersburg
Period	24/08/13 → 26/08/13

Access to Document

10.1007/978-3-642-39742-4_20

http://link.springer.com/chapter/10.1007%2F978-3-642-39742-4_20

Cite this

@inproceedings{25c5970ea17846198f62648a245adb6d,

title = "Efficient Subdomains for Random Testing",

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.",

author = "Patrick, {Matthew Timothy} and Rob Alexander and Oriol, {Manuel Yves Antoine} and Clark, {John Andrew}",

year = "2013",

doi = "10.1007/978-3-642-39742-4_20",

language = "English",

isbn = "978-3-642-39742-4",

volume = "8084 LNCS",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "251--256",

booktitle = "Search Based Software Engineering",

address = "Germany",

note = "5th International Symposium on Search Based Software Engineering ; Conference date: 24-08-2013 Through 26-08-2013",

}

Patrick, MT, Alexander, R , Oriol, MYA & Clark, JA 2013, Efficient Subdomains for Random Testing. in Search Based Software Engineering. vol. 8084 LNCS, Lecture Notes in Computer Science, vol. 8084, Springer, pp. 251-256, 5th International Symposium on Search Based Software Engineering, St. Petersburg, Russian Federation, 24/08/13. https://doi.org/10.1007/978-3-642-39742-4_20

TY - GEN

T1 - Efficient Subdomains for Random Testing

AU - Patrick, Matthew Timothy

AU - Alexander, Rob

AU - Oriol, Manuel Yves Antoine

AU - Clark, John Andrew

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-39742-4_20

DO - 10.1007/978-3-642-39742-4_20

M3 - Conference contribution

SN - 978-3-642-39742-4

VL - 8084 LNCS

T3 - Lecture Notes in Computer Science

SP - 251

EP - 256

BT - Search Based Software Engineering

PB - Springer

T2 - 5th International Symposium on Search Based Software Engineering

Y2 - 24 August 2013 through 26 August 2013

ER -