Advertisement

A New Formal Test Method for Networked Software Integration Testing

  • Shuai Wang
  • Yindong Ji
  • Wei Dong
  • Shiyuan Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6017)

Abstract

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.

Keywords

Networked software integration testing automata net test coverage rule State/Transition-Path 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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
  4. 4.
    Luo, G., von Bochmann, G., Petrenko, A.: Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method. IEEE Transactions on Software Engineering 20(2), 149–162 (1994)CrossRefGoogle Scholar
  5. 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
  6. 6.
    Chow, T.S.: Testing Software Design Modeled by Finite Machines. IEEE Transaction on Software Engineering 4, 178–187 (1978)CrossRefGoogle Scholar
  7. 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. 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
  9. 9.
    Aho, A.V., Dahbura, A.T., Lee, D., Uyar, M.U.: An optimization technique for protocol conformance test generation based on UIO sequences and Rural Chinese Postman Tours. IEEE Transaction on Communication 39(11), 75–86 (1991)CrossRefGoogle Scholar
  10. 10.
    Luo, G., von Bochmann, G., Petrenko, A.: Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method. IEEE Transactions on software Engineering 20(2), 149–162 (1994)CrossRefGoogle Scholar
  11. 11.
    Hierons, R.M.: Checking States and Transitions of A Set of Communicating finite state machines. Microprocessors and Microsystems 24(9), 443–452 (2001)CrossRefGoogle Scholar
  12. 12.
    Peeva, K.: Equivalence, reduction and minimization of finite automata over semirings. Theoretical Computer Science 88(2), 269–285 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science 78(2), 347–355 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation, 2nd edn. Pearson Education, London (2000)Google Scholar
  15. 15.
    Fujiwara, S., von Bochmann, G., Khendek, F., et al.: Test selection based on finite state models. IEEE Transactions on Software Engineering 17(6), 591–603 (1991)CrossRefGoogle Scholar
  16. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Shuai Wang
    • 1
    • 2
  • Yindong Ji
    • 1
    • 2
  • Wei Dong
    • 2
  • Shiyuan Yang
    • 1
  1. 1.Department of AutomationTsinghua University 
  2. 2.Tsinghua National Laboratory for Information Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations