File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A revisit of adaptive random testing by restriction
Title | A revisit of adaptive random testing by restriction |
---|---|
Authors | |
Keywords | Adaptive Random Testing Mirroring Random Testing Restricted Random Testing Software Testing |
Issue Date | 2004 |
Citation | Proceedings - International Computer Software And Applications Conference, 2004, v. 1, p. 78-85 How to Cite? |
Abstract | Adaptive Random Testing is a Black Box testing method based on the intuition that Random Testing failure-finding efficiency can be improved upon, in certain situations, by ensuring a more widespread and evenly distributed spread of test cases in the input domain. One way of achieving this distribution is through the use of exclusion zones and restriction, resulting in a method called Restricted Random Testing (RRT). Recent investigations into the RRT method have revealed several interesting and significant insights. A method of reducing the computational overheads of testing methods by partitioning an input domain, and applying the method to only one of the subdomains, mapping the test cases to other subdomains, has recently been introduced. This method, called Mirroring, in addition to alleviating computational costs, has some properties which fit nicely with the insights into RRT, offering solutions to some possible shortcomings of RRT. . In this paper we discuss the RRT method and additional insights; we explain Mirroring; and we detail applications of Mirroring to RRT. The Mirror RRT method proves to be a very attractive variation of RRT. © 2004 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/93078 |
ISSN | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chan, KP | en_HK |
dc.contributor.author | Chen, TY | en_HK |
dc.contributor.author | Kuo, FC | en_HK |
dc.contributor.author | Towey, D | en_HK |
dc.date.accessioned | 2010-09-25T14:50:14Z | - |
dc.date.available | 2010-09-25T14:50:14Z | - |
dc.date.issued | 2004 | en_HK |
dc.identifier.citation | Proceedings - International Computer Software And Applications Conference, 2004, v. 1, p. 78-85 | en_HK |
dc.identifier.issn | 0730-3157 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/93078 | - |
dc.description.abstract | Adaptive Random Testing is a Black Box testing method based on the intuition that Random Testing failure-finding efficiency can be improved upon, in certain situations, by ensuring a more widespread and evenly distributed spread of test cases in the input domain. One way of achieving this distribution is through the use of exclusion zones and restriction, resulting in a method called Restricted Random Testing (RRT). Recent investigations into the RRT method have revealed several interesting and significant insights. A method of reducing the computational overheads of testing methods by partitioning an input domain, and applying the method to only one of the subdomains, mapping the test cases to other subdomains, has recently been introduced. This method, called Mirroring, in addition to alleviating computational costs, has some properties which fit nicely with the insights into RRT, offering solutions to some possible shortcomings of RRT. . In this paper we discuss the RRT method and additional insights; we explain Mirroring; and we detail applications of Mirroring to RRT. The Mirror RRT method proves to be a very attractive variation of RRT. © 2004 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.relation.ispartof | Proceedings - International Computer Software and Applications Conference | en_HK |
dc.subject | Adaptive Random Testing | en_HK |
dc.subject | Mirroring | en_HK |
dc.subject | Random Testing | en_HK |
dc.subject | Restricted Random Testing | en_HK |
dc.subject | Software Testing | en_HK |
dc.title | A revisit of adaptive random testing by restriction | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Chan, KP:kpchan@cs.hku.hk | en_HK |
dc.identifier.authority | Chan, KP=rp00092 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-18744392258 | en_HK |
dc.identifier.hkuros | 129388 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-18744392258&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 1 | en_HK |
dc.identifier.spage | 78 | en_HK |
dc.identifier.epage | 85 | en_HK |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Chan, KP=7406032820 | en_HK |
dc.identifier.scopusauthorid | Chen, TY=13104290200 | en_HK |
dc.identifier.scopusauthorid | Kuo, FC=7006690410 | en_HK |
dc.identifier.scopusauthorid | Towey, D=8362064600 | en_HK |
dc.identifier.issnl | 0730-3157 | - |