File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Adaptive random test case prioritization

TitleAdaptive random test case prioritization
Authors
KeywordsAdaptive random testing
Test case prioritization
Issue Date2009
PublisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000064
Citation
Ase2009 - 24Th Ieee/Acm International Conference On Automated Software Engineering, 2009, p. 233-244 How to Cite?
AbstractRegression testing assures changed programs against unintended amendments. Rearranging the execution order of test cases is a key idea to improve their effectiveness. Paradoxically, many test case prioritization techniques resolve tie cases using the random selection approach, and yet random ordering of test cases has been considered as ineffective. Existing unit testing research unveils that adaptive random testing (ART) is a promising candidate that may replace random testing (RT). In this paper, we not only propose a new family of coverage-based ART techniques, but also show empirically that they are statistically superior to the RT-based technique in detecting faults. Furthermore, one of the ART prioritization techniques is consistently comparable to some of the best coverage-based prioritization techniques (namely, the "additional" techniques) and yet involves much less time cost. © 2009 IEEE.
DescriptionIEEE / ACM International Conference on Automated Software Engineering
This research is supported in part by the General Research Fund of the Research Grants Council of Hong Kong (project nos. 123207 and 716507) and a discovery grant of the Australian Research Council (project no. DP0984760).
Persistent Identifierhttp://hdl.handle.net/10722/93070
ISSN
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorJiang, Ben_HK
dc.contributor.authorZhang, Zen_HK
dc.contributor.authorChan, WKen_HK
dc.contributor.authorTse, THen_HK
dc.date.accessioned2010-09-25T14:49:59Z-
dc.date.available2010-09-25T14:49:59Z-
dc.date.issued2009en_HK
dc.identifier.citationAse2009 - 24Th Ieee/Acm International Conference On Automated Software Engineering, 2009, p. 233-244en_HK
dc.identifier.issn1938-4300-
dc.identifier.urihttp://hdl.handle.net/10722/93070-
dc.descriptionIEEE / ACM International Conference on Automated Software Engineering-
dc.descriptionThis research is supported in part by the General Research Fund of the Research Grants Council of Hong Kong (project nos. 123207 and 716507) and a discovery grant of the Australian Research Council (project no. DP0984760).-
dc.description.abstractRegression testing assures changed programs against unintended amendments. Rearranging the execution order of test cases is a key idea to improve their effectiveness. Paradoxically, many test case prioritization techniques resolve tie cases using the random selection approach, and yet random ordering of test cases has been considered as ineffective. Existing unit testing research unveils that adaptive random testing (ART) is a promising candidate that may replace random testing (RT). In this paper, we not only propose a new family of coverage-based ART techniques, but also show empirically that they are statistically superior to the RT-based technique in detecting faults. Furthermore, one of the ART prioritization techniques is consistently comparable to some of the best coverage-based prioritization techniques (namely, the "additional" techniques) and yet involves much less time cost. © 2009 IEEE.en_HK
dc.languageengen_HK
dc.publisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000064-
dc.relation.ispartofASE2009 - 24th IEEE/ACM International Conference on Automated Software Engineeringen_HK
dc.rightsIEEE / ACM International Conference on Automated Software Engineering. Copyright © Association for Computing Machinery, Inc.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights© ACM, 2009. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 24th IEEE/ACM International Conference on Automated Software Engineering (ASE 2009), Auckland, New Zealand, 16-20 November 2009 , p. 233-244. http://doi.acm.org/10.1145/1747491.1747523-
dc.subjectAdaptive random testingen_HK
dc.subjectTest case prioritizationen_HK
dc.titleAdaptive random test case prioritizationen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1938-4300&volume=&spage=233&epage=244&date=2009&atitle=Adaptive+random+test+case+prioritization-
dc.identifier.emailTse, TH: thtse@cs.hku.hken_HK
dc.identifier.authorityTse, TH=rp00546en_HK
dc.description.naturepostprint-
dc.identifier.doi10.1109/ASE.2009.77en_HK
dc.identifier.scopuseid_2-s2.0-77952123669en_HK
dc.identifier.hkuros160936en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77952123669&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage233en_HK
dc.identifier.epage244en_HK
dc.identifier.isiWOS:000278137400020-
dc.identifier.scopusauthoridJiang, B=35199818000en_HK
dc.identifier.scopusauthoridZhang, Z=10639502200en_HK
dc.identifier.scopusauthoridChan, WK=23967779900en_HK
dc.identifier.scopusauthoridTse, TH=7005496974en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats