Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ACCESS.2020.2977777
- Scopus: eid_2-s2.0-85082526533
- WOS: WOS:000524748500109
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Exploiting the largest available zone: A proactive approach to adaptive random testing by exclusion
Title | Exploiting the largest available zone: A proactive approach to adaptive random testing by exclusion |
---|---|
Authors | |
Keywords | Subspace constraints Software Strips Time complexity Software testing |
Issue Date | 2020 |
Publisher | Institute of Electrical and Electronics Engineers: Open Access Journals. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6287639 |
Citation | IEEE Access, 2020, v. 8, p. 52475-52488 How to Cite? |
Abstract | Adaptive random testing (ART) has been proposed to enhance the effectiveness of random testing (RT) through more even spreading of the test cases. In particular, restricted random testing (RRT) is an ART algorithm based on the intuition of skipping all the candidate test cases that are within the neighborhoods (or zones) of previously executed test cases. RRT has higher effectiveness than RT in terms of failure detection but incurs a higher time cost. In this paper, we aim to further reduce the time costs for RRT and improve the effectiveness for RT and ART methods. We propose a proactive technique known as “RRT by largest available zone” (RRT-LAZ). Like RRT, RRT-LAZ first defines an exclusion zone around every executed test case in order to determine the available zones. Unlike the original RRT, RRT-LAZ then compares all the available zones to proactively pick the largest one, from which the next test case is randomly generated. Both simulation analyses and empirical studies have been employed to investigate the efficiency and effectiveness of RRT-LAZ in relation to RT and related ART algorithms. The results show that RRT-LAZ has significantly lower time costs than RRT. Furthermore, RRT-LAZ is more effective than RT and related ART methods for block failure patterns in low-dimensional input spaces. In general, since RRT-LAZ employs a proactive technique instead of a passive one in generating next cases, it is much more cost-effective than RRT. RRT-LAZ is also more cost-effective than RT and other ART methods that we have studied. |
Description | eid_2-s2.0-85082526533 |
Persistent Identifier | http://hdl.handle.net/10722/286499 |
ISSN | 2023 Impact Factor: 3.4 2023 SCImago Journal Rankings: 0.960 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, J | - |
dc.contributor.author | Bao, Q | - |
dc.contributor.author | Tse, TH | - |
dc.contributor.author | Chen, TY | - |
dc.contributor.author | Xi, J | - |
dc.contributor.author | Mao, C | - |
dc.contributor.author | Yu, M | - |
dc.contributor.author | Huang, R | - |
dc.date.accessioned | 2020-08-31T07:04:43Z | - |
dc.date.available | 2020-08-31T07:04:43Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | IEEE Access, 2020, v. 8, p. 52475-52488 | - |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.uri | http://hdl.handle.net/10722/286499 | - |
dc.description | eid_2-s2.0-85082526533 | - |
dc.description.abstract | Adaptive random testing (ART) has been proposed to enhance the effectiveness of random testing (RT) through more even spreading of the test cases. In particular, restricted random testing (RRT) is an ART algorithm based on the intuition of skipping all the candidate test cases that are within the neighborhoods (or zones) of previously executed test cases. RRT has higher effectiveness than RT in terms of failure detection but incurs a higher time cost. In this paper, we aim to further reduce the time costs for RRT and improve the effectiveness for RT and ART methods. We propose a proactive technique known as “RRT by largest available zone” (RRT-LAZ). Like RRT, RRT-LAZ first defines an exclusion zone around every executed test case in order to determine the available zones. Unlike the original RRT, RRT-LAZ then compares all the available zones to proactively pick the largest one, from which the next test case is randomly generated. Both simulation analyses and empirical studies have been employed to investigate the efficiency and effectiveness of RRT-LAZ in relation to RT and related ART algorithms. The results show that RRT-LAZ has significantly lower time costs than RRT. Furthermore, RRT-LAZ is more effective than RT and related ART methods for block failure patterns in low-dimensional input spaces. In general, since RRT-LAZ employs a proactive technique instead of a passive one in generating next cases, it is much more cost-effective than RRT. RRT-LAZ is also more cost-effective than RT and other ART methods that we have studied. | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers: Open Access Journals. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6287639 | - |
dc.relation.ispartof | IEEE Access | - |
dc.rights | IEEE Access. Copyright © Institute of Electrical and Electronics Engineers (IEEE): OAJ. | - |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.subject | Subspace constraints | - |
dc.subject | Software | - |
dc.subject | Strips | - |
dc.subject | Time complexity | - |
dc.subject | Software testing | - |
dc.title | Exploiting the largest available zone: A proactive approach to adaptive random testing by exclusion | - |
dc.type | Article | - |
dc.identifier.email | Tse, TH: thtse@cs.hku.hk | - |
dc.identifier.authority | Tse, TH=rp00546 | - |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/ACCESS.2020.2977777 | - |
dc.identifier.scopus | eid_2-s2.0-85082526533 | - |
dc.identifier.hkuros | 313730 | - |
dc.identifier.volume | 8 | - |
dc.identifier.spage | 52475 | - |
dc.identifier.epage | 52488 | - |
dc.identifier.isi | WOS:000524748500109 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 2169-3536 | - |