Abstract
Tobias is a combinatorial test generation tool which can efficiently generate a large number of test cases by unfolding a test pattern and computing all combinations of parameters. In this paper, we first propose a model-based testing approach where Tobias test cases are first run on an executable UML/OCL specification. This animation of test cases on a model allows to filter out invalid test sequences produced by blind enumeration, typically the ones which violate the pre-conditions of operations, and to provide an oracle for the valid ones. We then introduce recent extensions of the Tobias tool which support an incremental unfolding and filtering process, and its associated toolset. This allows to address explosive test patterns featuring a large number of invalid test cases, and only a small number of valid ones. For instance, these new constructs could mandate test cases to satisfy a given predicate at some point or to follow a given behavior. The early detection of invalid test cases improves the calculation time of the whole generation and execution process, and helps fighting combinatorial explosion.
Keywords
- Test Suite
- Smart Card
- Test Pattern
- Generate Test Case
- Combinatorial Explosion
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Chapter PDF
References
Abrial, J.-R.: The B Book - Assigning Programs to Meanings. Cambridge University Press (August 1996)
Belhaouari, H., Peschanski, F.: A Constraint Logic Programming Approach to Automated Testing. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 754–758. Springer, Heidelberg (2008)
du Bousquet, L., Ledru, Y., Maury, O., Oriat, C., Lanet, J.L.: Reusing a JML specification dedicated to verification for testing, and vice-versa: case studies. Journal of Automated Reasoning 45(4) (2010)
Cheon, Y., Leavens, G.T.: A Simple and Practical Approach to Unit Testing: The JML and JUnit Way. In: Deng, T. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 231–255. Springer, Heidelberg (2002)
Cohen, D.M., Dalal, S.R., Parelius, J., Patton, G.C.: The combinatorial design approach to automatic test generation. IEEE Softw. 13(5), 83–88 (1996)
Constant, C., Jeannet, B., Jéron, T.: Automatic Test Generation from Interprocedural Specifications. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds.) TestCom/FATES 2007. LNCS, vol. 4581, pp. 41–57. Springer, Heidelberg (2007)
Dadeau, F., Ledru, Y., Bousquet, L.D.: Directed random reduction of combinatorial test suites. In: Random Testing 2007, pp. 18–25. ACM (2007)
Dadeau, F., Tissot, R.: jSynoPSys – a scenario-based testing tool based on the symbolic animation of B machines. In: Finkbeiner, B., Gurevich, Y., Petrenko, A.K. (eds.) MBT 2009 Proceedings. ENTCS, vol. 253-2, pp. 117–132 (2009)
Dupuy-Chessa, S., du Bousquet, L., Bouchet, J., Ledru, Y.: Test of the ICARE Platform Fusion Mechanism. In: Gilroy, S.W., Harrison, M.D. (eds.) DSVIS 2005. LNCS, vol. 3941, pp. 102–113. Springer, Heidelberg (2006)
Ferro, L., Pierre, L., Ledru, Y., du Bousquet, L.: Generation of test programs for the assertion-based verification of TLM models. In: 3rd International Design and Test Workshop, IDT 2008, pp. 237–242. IEEE (December 2008)
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)
Grieskamp, W., Qu, X., Wei, X., Kicillof, N., Cohen, M.B.: Interaction Coverage Meets Path Coverage by SMT Constraint Solving. In: Núñez, M., Baker, P., Merayo, M.G. (eds.) TESTCOM/FATES 2009. LNCS, vol. 5826, pp. 97–112. Springer, Heidelberg (2009)
Harrold, M.J., Gupta, R., Soffa, M.L.: A methodology for controlling the size of a test suite. ACM Trans. Softw. Eng. Methodol. 2(3), 270–285 (1993)
Heimdahl, M., George, D.: On the effect of test-suite reduction on automatically generated model-based tests. Automated Software Engineering 14, 37–57 (2007)
Jagannath, V., Lee, Y.Y., Daniel, B., Marinov, D.: Reducing the Costs of Bounded-Exhaustive Testing. In: Chechik, M., Wirsing, M. (eds.) FASE 2009. LNCS, vol. 5503, pp. 171–185. Springer, Heidelberg (2009)
Lausdahl, K., Lintrup, H.K.A., Larsen, P.G.: Connecting UML and VDM++ with Open Tool Support. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 563–578. Springer, Heidelberg (2009)
Ledru, Y., du Bousquet, L., Maury, O., Bontron, P.: Filtering TOBIAS Combinatorial Test Suites. In: Wermelinger, M., Margaria-Steffen, T. (eds.) FASE 2004. LNCS, vol. 2984, pp. 281–294. Springer, Heidelberg (2004)
Ledru, Y., Dadeau, F., du Bousquet, L., Ville, S., Rose, E.: Mastering combinatorial explosion with the Tobias-2 test generator. In: IEEE/ACM Int. Conf. on Automated Software Engineering, pp. 535–536. ACM (2007); demonstration
Maury, O., Ledru, Y., Bontron, P., du Bousquet, L.: Using Tobias for the automatic generation of VDM test cases. In: 3rd VDM Workshop (in Conjunction with FME 2002) (2002)
Rothermel, G., Harrold, M.J., Ostrin, J., Hong, C.: An empirical study of the effects of minimization on the fault detection capabilities of test suites. In: Int. Conf. on Software Maintenance, pp. 34–43. IEEE (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Triki, T., Ledru, Y., du Bousquet, L., Dadeau, F., Botella, J. (2012). Model-Based Filtering of Combinatorial Test Suites. In: de Lara, J., Zisman, A. (eds) Fundamental Approaches to Software Engineering. FASE 2012. Lecture Notes in Computer Science, vol 7212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28872-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-28872-2_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28871-5
Online ISBN: 978-3-642-28872-2
eBook Packages: Computer ScienceComputer Science (R0)