This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
DESSERT: a DividE-and-conquer methodology for identifying categorieS, choiceS, and choicE Relations for Test case generation
July-Aug. 2012 (vol. 38 no. 4)
pp. 794-809
ASCII Text
x 
 
Tsong Yueh Chen, Pak-Lok Poon, Sau-Fun Tang, T. H. Tse, "DESSERT: a DividE-and-conquer methodology for identifying categorieS, choiceS, and choicE Relations for Test case generation," IEEE Transactions on Software Engineering, vol. 38, no. 4, pp. 794-809, July-Aug., 2012.
 
 
BibTex
x
 
@article{ 10.1109/TSE.2011.69,
author = { Tsong Yueh Chen and Pak-Lok Poon and Sau-Fun Tang and T. H. Tse},
title = {DESSERT: a DividE-and-conquer methodology for identifying categorieS, choiceS, and choicE Relations for Test case generation},
journal ={IEEE Transactions on Software Engineering},
volume = {38},
number = {4},
issn = {0098-5589},
year = {2012},
pages = {794-809},
doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.2011.69},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Software Engineering
TI - DESSERT: a DividE-and-conquer methodology for identifying categorieS, choiceS, and choicE Relations for Test case generation
IS - 4
SN - 0098-5589
SP794
EP809
EPD - 794-809
A1 - Tsong Yueh Chen,
A1 - Pak-Lok Poon,
A1 - Sau-Fun Tang,
A1 - T. H. Tse,
PY - 2012
KW - program testing
KW - divide and conquer methods
KW - formal specification
KW - black-box testing
KW - DESSERT
KW - divide-and-conquer methodology
KW - category identification
KW - choice identification
KW - choice relation identification
KW - test case generation
KW - specification components
KW - real-life commercial software systems
KW - software testing
KW - CHOC'LATE
KW - Awards activities
KW - Electronic mail
KW - Software systems
KW - Encoding
KW - Software testing
KW - test case generation
KW - Black-box testing
KW - category-partition method
KW - choice relation framework
KW - choice relation table
KW - software testing
VL - 38
JA - IEEE Transactions on Software Engineering
ER -
 
Tsong Yueh Chen, Fac. of Inf. & Commun. Technol., Swinburne Univ. of Technol., Hawthorn, VIC, Australia
Pak-Lok Poon, Sch. of Accounting & Finance, Hong Kong Polytech. Univ., Kowloon, China
Sau-Fun Tang, Fac. of Inf. & Commun. Technol., Swinburne Univ. of Technol., Hawthorn, VIC, Australia
T. H. Tse, Dept. of Comput. Sci., Univ. of Hong Kong, Hong Kong, China
This 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.

[1] M.J. Balcer, W.M. Hasling, and T.J. Ostrand, "Automatic Generation of Test Scripts from Formal Test Specifications," Proc. ACM SIGSOFT Third Symp. Software Testing, Analysis, and Verification, pp. 210-218, 1989.
[2] B. Beizer, Software Testing Techniques. Van Nostrand Reinhold, 1990.
[3] L.C. Briand, Y. Labiche, and Z. Bawar, "Using Machine Learning to Refine Black-Box Test Specifications and Test Suites," Proc. Eighth Int'l Conf. Quality Software, pp. 135-144, 2008.
[4] T.Y. Chen, P.-L. Poon, S.-F. Tang, and T.H. Tse, "On the Identification of Categories and Choices for Specification-Based Test Case Generation," Information and Software Technology, vol. 46, no. 13, pp. 887-898, 2004.
[5] T.Y. Chen, P.-L. Poon, S.-F. Tang, and T.H. Tse, "Identification of Categories and Choices in Activity Diagrams," Proc. Fifth Int'l Conf. Quality Software, pp. 55-63, 2005.
[6] T.Y. Chen, P.-L. Poon, and T.H. Tse, "An Integrated Classification-tree Methodology for Test Case Generation," Int'l J. Software Eng. and Knowledge Eng., vol. 10, no. 6, pp. 647-679, 2000.
[7] T.Y. Chen, P.-L. Poon, and T.H. Tse, "A Choice Relation Framework for Supporting Category-Partition Test Case Generation," IEEE Trans. Software Eng., vol. 29, no. 7, pp. 577-593, July 2003.
[8] M. Grindal, J. Offutt, and S.F. Andler, "Combination Testing Strategies: A Survey," Software Testing, Verification and Reliability, vol. 15, no. 3, pp. 167-199, 2005.
[9] M. Grindal, J. Offutt, and J. Mellin, "Managing Conflicts When Using Combination Strategies to Test Software," Proc. 18th Australian Software Eng. Conf., pp. 255-264, 2007.
[10] M. Grochtmann and K. Grimm, "Classification Trees for Partition Testing," Software Testing, Verification and Reliability, vol. 3, no. 2, pp. 63-82, 1993.
[11] R.M. Hierons, M. Harman, and H. Singh, "Automatically Generating Information from a Z Specification to Support the Classification Tree Method," Proc. Third Int'l Conf. Formal Specification and Development in Z and B, vol. 2651, pp. 388-407, 2003.
[12] M.F. Lau and Y.T. Yu, "An Extended Fault Class Hierarchy for Specification-Based Testing," ACM Trans. Software Eng. and Methodology, vol. 14, no. 3, pp. 247-276, 2005.
[13] Y. Lei and K.-C. Tai, "In-Parameter-Order: A Test Generation Strategy for Pairwise Testing," Proc. IEEE Third Int'l High-Assurance Systems Eng. Symp., pp. 254-261, 1998.
[14] G.J. Myers, The Art of Software Testing. Wiley, 2004.
[15] T.J. Ostrand and M.J. Balcer, "The Category-partition Method for Specifying and Generating Functional tests," Comm. ACM, vol. 31, no. 6, pp. 676-686, 1988.
[16] P.-L. Poon, S.-F. Tang, T.H. Tse, and T.Y. Chen, "CHOC'LATE: A Framework for Specification-Based Testing," Comm. ACM, vol. 53, no. 4, pp. 113-118, 2010.
[17] H. Singh, M. Conrad, and S. Sadeghipour, "Test Case Design Based on Z and the Classification-Tree Method," Proc. First Int'l Conf. Formal Eng. Methods, pp. 81-90, 1997.
[18] K.-C. Tai and Y. Lei, "A Test Generation Strategy for Pairwise Testing," IEEE Trans. Software Eng., vol. 28, no. 1, pp. 109-111, Jan. 2002.

Index Terms:
program testing,divide and conquer methods,formal specification,black-box testing,DESSERT,divide-and-conquer methodology,category identification,choice identification,choice relation identification,test case generation,specification components,real-life commercial software systems,software testing,CHOC'LATE,Awards activities,Electronic mail,Software systems,Encoding,Software testing,test case generation,Black-box testing,category-partition method,choice relation framework,choice relation table,software testing
Citation:
Tsong Yueh Chen, Pak-Lok Poon, Sau-Fun Tang, T. H. Tse, "DESSERT: a DividE-and-conquer methodology for identifying categorieS, choiceS, and choicE Relations for Test case generation," IEEE Transactions on Software Engineering, vol. 38, no. 4, pp. 794-809, July-Aug. 2012, doi:10.1109/TSE.2011.69
Usage of this product signifies your acceptance of the Terms of Use.