Skip to main content
SpringerLink
Log in

Theory of Test Modeling Based on Regular Expressions

  • Conference paper
  • First Online:
Structured Object-Oriented Formal Language and Method (SOFL+MSVL 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8332))

Abstract

This paper presents a theory of test modeling by using regular expressions for software behaviors. Unlike the earlier modeling theory of regular expression, the proposed theory is used to build a test model which can derive effective test sequences easily. We firstly establish an expression algebraic system by means of transition sequences and a set of operators. And we then give the modeling method for behaviors of software under test based on this algebraic system. Some examples are also given for illustrating our test modeling method. Compared with the finite state machine model, the expression model is more expressive for the concurrent system and can provide the accurate and concise description of software behaviors.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Liu, P., Miao, H.: A new approach to generating high quality test cases. In: 2010 19th IEEE Asian Test Symposium (ATS), pp. 71–76. IEEE (2010)

    Google Scholar 

  2. Bertolino, A.: Software testing research: achievements, challenges, dreams. In: Future of Software Engineering, FOSE’07, pp. 85–103. IEEE (2007)

    Google Scholar 

  3. Dalal, S.R., Jain, A., Karunanithi, N., Leaton, J., Lott, C.M., Patton, G.C., Horowitz, B.M.: Model-based testing in practice. In: Proceedings of the 21st International Conference on Software Engineering, pp. 285–294. ACM (1999)

    Google Scholar 

  4. Utting, M., Legeard, B.: Practical Model-Based Testing: a Tools Approach. Morgan Kaufmann, San Francisco (2010)

    Google Scholar 

  5. Hemmati, H., Arcuri, A., Briand, L.: Achieving scalable model-based testing through test case diversity. ACM Trans. Softw. Eng. Methodol. (TOSEM) 22, 6 (2013)

    Article  Google Scholar 

  6. Belinfante, A., Frantzen, L., Schallhart, C.: 14 tools for test case generation. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 391–438. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Liu, P., Miao, H.-K., Zeng, H.-W., Liu, Y.: FSM-based testing: Theory, method and evaluation. Jisuanji Xuebao(Chinese J. Comput.) 34, 965–984 (2011)

    Google Scholar 

  8. Fujiwara, S., Khendek, F., Amalou, M., Ghedamsi, A.: Test selection based on finite state models. IEEE Trans. Softw. Eng. 17, 591–603 (1991)

    Article  Google Scholar 

  9. Sidhu, D.P., Leung, T.-K.: Formal methods for protocol testing: a detailed study. IEEE Trans. Softw. Eng. 15, 413–426 (1989)

    Article  Google Scholar 

  10. Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. Softw. Eng. 4, 178–187 (1978)

    Article  MATH  Google Scholar 

  11. Lai, R.: A survey of communication protocol testing. J. Syst. Softw. 62, 21–46 (2002)

    Article  Google Scholar 

  12. Wu, N.Q., Zhou, M.: Modeling, analysis and control of dual-arm cluster tools with residency time constraint and activity time variation based on Petri nets. IEEE Trans. Autom. Sci. Eng. 9, 446–454 (2012)

    Article  Google Scholar 

  13. Notomi, M., Murata, T.: Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis. IEEE Trans. Softw. Eng. 20, 325–336 (1994)

    Article  MATH  Google Scholar 

  14. Chu, F., Xie, X.-L.: Deadlock analysis of Petri nets using siphons and mathematical programming. IEEE Trans. Robot. Autom. 13, 793–804 (1997)

    Article  Google Scholar 

  15. Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: VLDB, pp. 361–370 (2001)

    Google Scholar 

  16. Garg, V.K., Ragunath, M.: Concurrent regular expressions and their relationship to Petri nets. Theoret. Comput. Sci. 96, 285–304 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sen, K., Roşu, G.: Generating optimal monitors for extended regular expressions. Electron. Notes Theoret. Comput. Sci. 89, 226–245 (2003)

    Article  Google Scholar 

  18. Garg, V.K.: Modeling of Distributed Systems by Concurrent Regular Expressions. In: FORTE, pp. 313–327 (1989)

    Google Scholar 

  19. Ravi, S., Lakshminarayana, G., Jha, N.K.: TAO: regular expression-based register-transfer level testability analysis and optimization. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 9, 824–832 (2001)

    Article  Google Scholar 

  20. Qian, Z.S.: Model-based approaches to generating test cases for web applications. Ph.D. thesis, Shanghai University (2008)

    Google Scholar 

  21. Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol. 3472. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  22. Hopcroft, J.E.: Introduction to Automata Theory, Languages, and Computation, 3/E. Pearson Education India (2008)

    Google Scholar 

  23. Rosen, K.H., Krithivasan, K.: Discrete Mathematics and Its Applications, 5th edn. McGraw-Hill, New York (2003)

    MATH  Google Scholar 

  24. Miao, H.K., Liu, P., Mei, J., Zeng, H.W.: A new approach to automated redundancy reduction for test sequences. In: 15th IEEE Pacific Rim International Symposium on Dependable Computing, 2009. PRDC’09, pp. 93–98. IEEE (2009)

    Google Scholar 

Download references

Acknowledgments

This work is supported by National Natural Science Foundation of China (NSFC) under grant No. 61170044 and No. 61073050, Shanghai Natural Science Fund (No. 13ZR1429600), Innovation Program of Shanghai Municipal Education Commission (No. 13YZ141), and Young teacher training scheme of Shanghai Universities (No. SXY12014).

Author information

Authors and Affiliations

  1. College of Computer Engineering and Science, Shanghai Business School, Shanghai, 201400, China

    Pan Liu

  2. Shanghai Key Laboratory of Computer Software Testing and Evaluating, Shanghai, 201112, China

    Pan Liu

  3. School of Computer Engineering and Science, Shanghai University, Shanghai, 200072, China

    Huaikou Miao

Authors
  1. Pan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huaikou Miao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pan Liu .

Editor information

Editors and Affiliations

  1. Hosei University, Koganei-shi, Tokyo, Japan

    Shaoying Liu

  2. Technology, Xidian University, Xi’an, China

    Zhenhua Duan

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, P., Miao, H. (2014). Theory of Test Modeling Based on Regular Expressions. In: Liu, S., Duan, Z. (eds) Structured Object-Oriented Formal Language and Method. SOFL+MSVL 2013. Lecture Notes in Computer Science(), vol 8332. Springer, Cham. https://doi.org/10.1007/978-3-319-04915-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04915-1_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04914-4

  • Online ISBN: 978-3-319-04915-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation