One-domain-one-input: adaptive random testing by orthogonal recursive bisection with restriction

Tools

Ackah-Arthur, Hilary, Chen, Jinfu, Towey, Dave, Omari, Michael, Xi, Jiaxiang and Huang, Rubing (2019) One-domain-one-input: adaptive random testing by orthogonal recursive bisection with restriction. IEEE Transactions on Reliability, 68 (4). pp. 1404-1428. ISSN 0018-9529

[img]
Preview
 PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution.
Download (3MB) | Preview

Abstract

One goal of software testing may be the identification

or generation of a series of test cases that can detect a fault with as few test executions as possible. Motivated by insights from research into failure-causing regions of input domains, the even-spreading (even distribution) of tests across the input domain has been identified as a useful heuristic to more quickly find failures. This finding has encouraged a shift in focus from traditional random testing (RT) to its enhancement, adaptive random testing (ART), which retains the randomness of test input selection, but also attempts to maintain a more evenly distributed spread of test inputs across the input domain. Given that there are different ways to achieve the even distribution, several different ART methods and approaches have been proposed. This paper presents a new ART method, called ART-ORB, which explores the advantages of repeated geometric bisection of the input domain, combined with restriction regions, to evenly spread test inputs. Experimental results show a better performance in terms of fewer test executions than RT to find failures. Compared with other ART methods, ART-ORB has comparable performance (in terms of required test executions), but incurs lower test input selection overheads, especially in higher dimensional input space. It is recommended that ART-ORB be used in testing situations involving expensive test input execution.

Item Type: Article
Keywords: Random testing; adaptive random testing,partition testing; orthogonal recursive bisection; restricted random testing.
Schools/Departments: University of Nottingham Ningbo China > Faculty of Science and Engineering > School of Computer Science
Identification Number: https://doi.org/10.1109/TR.2019.2907577
Depositing User: Zhou, Elsie
Date Deposited: 09 Jan 2020 03:12
Last Modified: 09 Jan 2020 03:12
URI: https://eprints.nottingham.ac.uk/id/eprint/59663

Actions (Archive Staff Only)

Edit View Edit View