A New Formal Test Method for Networked Software Integration Testing
This paper considers the integration testing for networked software that is built by assembling several distributed components in an interoperable manner. Using the traditional single automata-based test approaches, we suffer from the state combinatorial explosion problem. Moreover, several generated test cases may not be executable. This paper proposed a test method based on the automata net which is the extension of communication automata. The state/transition path (S/T-Path) is defined to describe the execution of the software under test. The test cases are constructed through combining the atomic S/T-Paths and all executable. The test cases are calculated from the local transition structures and the interaction procedure between components, so the state combinatorial explosion problem will not be encountered. The generation of test cases for certain software and the benefits for the problems are discussed. Results show that our method has better properties.
KeywordsNetworked software integration testing automata net test coverage rule State/Transition-Path
Unable to display preview. Download preview PDF.
- 1.Ghosh, S., Mathur, A.P.: Issues in testing distributed Component-Based Systems. In: Proceedings of the First International ICSE Workshop Testing Distributed Component-based System (1999)Google Scholar
- 2.Cho, I.-H., McGregor, J.D.: Component specification and testing interoperation of components. In: Proc. of the IASTED Int’l Conf., Software Engineering and Applications, pp. 27–31 (1999)Google Scholar
- 3.Cho, I.-H., McGregor, J.D.: A formal approach to specifying and testing the interoperation between components. In: Proceedings of the 38th annual on Southeast regional conference, pp. 161–170 (2000)Google Scholar
- 5.Hong, H.S., Lee, I., Sokolsky, O.: Automatic Test Generation from Statecharts Using Model Checking. In: Proceedings of FATES 2001, Workshop on Formal Approaches to Testing of Software, pp. 15–30 (2001)Google Scholar
- 7.Drusinsky, D.: Model checking of statecharts using automatic white box test generation. In: 48th Midwest Symposium on Circuits and Systems, pp. 327–332 (2005)Google Scholar
- 8.Biehl, M., Klarlund, N., Rauhe, T.: Algorithms for guided tree automata. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol. 1260, pp. 6–25. Springer, Heidelberg (1997)Google Scholar
- 14.Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation, 2nd edn. Pearson Education, London (2000)Google Scholar
- 16.Choi, Y., Kim, D., Kim, J., et al.: Protocol test sequence generation using UIO and BUIO. In: 1995 IEEE International Conference on communications, vol. 1, pp. 362–366 (1995)Google Scholar