File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: DESSERT: a DividE-and-conquer methodology for identifying categorieS, choiceS, and choicE relations for test case generation

TitleDESSERT: a DividE-and-conquer methodology for identifying categorieS, choiceS, and choicE relations for test case generation
Authors
KeywordsBlack-box testing
Category-partition method
Choice relation framework
Choice relation table
Software testing
Issue Date2012
PublisherIEEE. The Journal's web site is located at http://www.computer.org/tse
Citation
IEEE Transactions on Software Engineering, 2012, v. 38 n. 4, p. 794-809 How to Cite?
AbstractThis paper extends the choce relation framework, abbreviated as choc'late, which assists software testers in the application of category/choice methods to testing. choc'late assumes that the tester is able to construct a single choice relation table from the entire specification; this table then forms the basis for test case generation using the associated algorithms. This assumption, however, may not hold true when the specification is complex and contains many specification components. For such a specification, the tester may construct a preliminary choice relation table from each specification component, and then consolidate all the preliminary tables into a final table to be processed by choc'late for test case generation. However, it is often difficult to merge these preliminary tables because such merging may give rise to inconsistencies among choice relations or overlaps among choices. To alleviate this problem, we introduce a DividE-and-conquer methodology for identifying categorieS, choiceS, and choicE Relations for Test case generation, abbreviated as dessert. The theoretical framework and the associated algorithms are discussed. To demonstrate the viability and effectiveness of our methodology, we describe case studies using the specifications of three real-life commercial software systems.
Persistent Identifierhttp://hdl.handle.net/10722/140787
ISSN
2020 Impact Factor: 6.226
2015 SCImago Journal Rankings: 1.543
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChen, TY-
dc.contributor.authorPoon, PL-
dc.contributor.authorTang, SF-
dc.contributor.authorTse, TH-
dc.date.accessioned2011-09-23T06:19:18Z-
dc.date.available2011-09-23T06:19:18Z-
dc.date.issued2012-
dc.identifier.citationIEEE Transactions on Software Engineering, 2012, v. 38 n. 4, p. 794-809-
dc.identifier.issn0098-5589-
dc.identifier.urihttp://hdl.handle.net/10722/140787-
dc.description.abstractThis paper extends the choce relation framework, abbreviated as choc'late, which assists software testers in the application of category/choice methods to testing. choc'late assumes that the tester is able to construct a single choice relation table from the entire specification; this table then forms the basis for test case generation using the associated algorithms. This assumption, however, may not hold true when the specification is complex and contains many specification components. For such a specification, the tester may construct a preliminary choice relation table from each specification component, and then consolidate all the preliminary tables into a final table to be processed by choc'late for test case generation. However, it is often difficult to merge these preliminary tables because such merging may give rise to inconsistencies among choice relations or overlaps among choices. To alleviate this problem, we introduce a DividE-and-conquer methodology for identifying categorieS, choiceS, and choicE Relations for Test case generation, abbreviated as dessert. The theoretical framework and the associated algorithms are discussed. To demonstrate the viability and effectiveness of our methodology, we describe case studies using the specifications of three real-life commercial software systems.-
dc.languageeng-
dc.publisherIEEE. The Journal's web site is located at http://www.computer.org/tse-
dc.relation.ispartofIEEE Transactions on Software Engineering-
dc.rightsIEEE Transactions on Software Engineering. Copyright © IEEE.-
dc.rights©2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.-
dc.subjectBlack-box testing-
dc.subjectCategory-partition method-
dc.subjectChoice relation framework-
dc.subjectChoice relation table-
dc.subjectSoftware testing-
dc.titleDESSERT: a DividE-and-conquer methodology for identifying categorieS, choiceS, and choicE relations for test case generation-
dc.typeArticle-
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0098-5589&volume=&spage=&epage=&date=2011&atitle=DESSERT:+a+divide-and-conquer+methodology+for+identifying+categories,+choices,+and+choice+relations+for+test+case+generationen_US
dc.identifier.emailTse, TH: thtse@cs.hku.hk-
dc.identifier.authorityTse, TH=rp00546-
dc.description.naturepostprint-
dc.identifier.doi10.1109/TSE.2011.69-
dc.identifier.scopuseid_2-s2.0-84862503159en_HK
dc.identifier.hkuros205744-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84862503159&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume38-
dc.identifier.issue4-
dc.identifier.spage794-
dc.identifier.epage809-
dc.identifier.isiWOS:000307120000004-
dc.publisher.placeUnited States-
dc.identifier.scopusauthoridChen, TY=13104290200en_HK
dc.identifier.scopusauthoridPoon, PL=7101925990en_HK
dc.identifier.scopusauthoridTang, SF=7403437100en_HK
dc.identifier.scopusauthoridTse, TH=7005496974en_HK
dc.identifier.citeulike11169284-
dc.identifier.issnl0098-5589-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats