Abstract
During the development and maintenance of software, the size of a test suite often increases to such an extent that the costs allocated for its execution are exceeded. In this case, the test suite needs to be reduced. A number of approaches address the problem of test suite reduction. Most of them consider the removal or merging of test cases. However, less attention has been paid to the identification of test cases that are suitable for merging.
In this paper, we present a novel approach to fill this gap. Using this approach allows for the identification of test case pairs that, when merged, have a high potential for test suite reduction. We show that two test suites reduced by our approach are considerably smaller in size than those, whose merged test cases were selected randomly. Additionally, we examine the effect of composite test goals on the reduction ratio.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Black, P.E., Ranville, S.: Winnowing Tests: Getting Quality Coverage from a Model Checker without Quantity. In: Proc. of the 20th Conf. in Digital Avionics Systems, vol. 2, 9B6/1–9B6/4 (2001)
Cichos, H., Heinze, T.: Efficient Reduction of Model-based Generated Test Suites through Test Case Pair Prioritization. In: MoDeVVa 2010: Workshop for Model-Driven Engineering, Verification and Validation (2010)
Fraser, G., Wotawa, F.: Creating Test-Cases Incrementally with Model-Checkers. GI Jahrestagung (2). LNI 110, 381–386 (2007)
Fraser, G., Wotawa, F.: Redundancy Based Test-Suite Reduction. In: Dwyer, M.B., Lopes, A. (eds.) FASE 2007. LNCS, vol. 4422, pp. 291–305. Springer, Heidelberg (2007)
Hamon, G., Moura, L., Rushby, J.: Generating Efficient Test Sets with a Model Checker. In: Proc. of the Software Eng. and Formal Methods, pp. 261–270. IEEE, Los Alamitos (2004)
Harrold, M.J., Gupta, R., Soffa, M.L.: A Methodology for Controlling the Size of a Test Suite. ACM Trans. Software Eng. Methodol. 2(3), 270–285 (1993)
Haschemi, S.: Azmun - The Model-Based Testing Framework, http://www.azmun.de (last checked: 2010-12-28)
Hong, H.S., Cha, S.D., Lee, I., Sokolsky, O., Ural, H.: Data Flow Testing as Model Checking. In: ICSE 2003: Proc. of the 25th Int. Conf. on Software Eng., pp. 232–242. IEEE, Los Alamitos (2003)
Korel, B., Koutsogiannakis, G., Tahat, L.H.: Model-Based Test Prioritization Heuristic Methods and their Evaluation. In: Proc. of the 3rd Int. Workshop on Advances in Model-Based Testing, A-MOST 2007, pp. 34–43. ACM, New York (2007)
Rothermel, G., Harrold, M.J., von Ronne, J., Hong, C.: Empirical Studies of Test-Suite Reduction. Journal of Software Testing, Verification, and Reliability 12, 219–249 (2002)
Smith, T.F., Waterman, M.S.: Identification of Common Molecular Subsequences. Journal of Molecular Biology 147(1), 195–197 (1981)
Utting, M., Legeard, B.: Practical Model-Based Testing: A Tools Approach. Morgan Kaufmann Publishers Inc., San Francisco (2006)
Weißleder, S.: Simulated Satisfaction of Coverage Criteria on UML State Machines. In: ICST 2010: Proc. of the 2010 Int. Conf. on Software Testing Verification and Validation, pp. 117–126. IEEE, Los Alamitos (2010)
Yoo, S., Harman, M.: Regression Testing Minimization, Selection and Prioritization: A Survey. In: Software Testing, Verification and Reliability (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cichos, H., Heinze, T.S. (2011). Efficient Test Suite Reduction by Merging Pairs of Suitable Test Cases. In: Dingel, J., Solberg, A. (eds) Models in Software Engineering. MODELS 2010. Lecture Notes in Computer Science, vol 6627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21210-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-21210-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21209-3
Online ISBN: 978-3-642-21210-9
eBook Packages: Computer ScienceComputer Science (R0)