Skip to main content
SpringerLink
Log in

Using an SMT Solver for Checking the Completeness of FSM-Based Tests

  • Conference paper
  • First Online:
Book cover Testing Software and Systems (ICTSS 2020)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 12543))

Included in the following conference series:

  • 744 Accesses

Abstract

Deriving tests with guaranteed fault coverage by FSM-based test methods is rather complex for systems with a large number of states. At the same time, formal verification methods allow to effectively process large transition systems; in particular, SMT solvers are widely used to solve analysis problems for finite transition systems. In this paper, we describe the known necessary and sufficient conditions of completeness of test suites derived by FSM-based test methods via the first-order logic formulas and use an SMT solver in order to check them. In addition, we suggest a new sufficient condition for test suite completeness and check the corresponding first-order logic formula via the SMT solver. The results of computer experiments with randomly generated finite state machines confirm the correctness and efficiency of a proposed approach.

This work is partly supported by RFBR project No 18-01-00854.

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. Test generation for finite state machine. http://www.fsmtestonline.ru/

  2. Chow, T.S.: Test design modeled by finite-state machines. IEEE Trans. SE 4(3), 178–187 (1978)

    Article  Google Scholar 

  3. Dorofeeva, R., El-Fakih, K., Yevtushenko, N.: An improved conformance testing method. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 204–218. Springer, Heidelberg (2005). https://doi.org/10.1007/11562436_16

    Chapter  Google Scholar 

  4. Fujiwara, S., Bochmann, G., Khendek, F., Amalou, M., Ghedamsi, A.: Test selection based on finite state models. IEEE Trans. Softw. Eng. 17, 591–603 (1991). https://doi.org/10.1109/32.87284

    Article  Google Scholar 

  5. Gill, A.: Introduction to the Theory of Finite-State Machines. McGraw-Hill, New York (1962)

    MATH  Google Scholar 

  6. Huth, M., Ryan, M.: Logic in Computer Science: Modelling and Reasoning About Systems. Cambridge University Press, Cambridge (2004)

    Book  Google Scholar 

  7. Koufareva, I., Dorofeeva, M.: A novel modification of W-method. Joint Bull. Novosibirsk Comput. 18, 69–81 (2002)

    Google Scholar 

  8. Laputenko, A., Vinarskii, E.: Python scripts for z3 solver (2020). https://github.com/vinevg1996/ictss_2020

  9. Petrenko, A., Yevtushenko, N., Lebedev, A., Das, A.: Nondeterministic state machines in protocol conformance testing, pp. 363–378 (1993)

    Google Scholar 

  10. Vasilevskii, M.P.: Failure diagnosis of automata, pp. 98–108. No. 4 (1973)

    Google Scholar 

  11. Yevtushenko, N., Petrenko, A.: Failure diagnosis of automata. No. 5 (1990)

    Google Scholar 

  12. Yurichev, D.: SAT/SMT by Example (2020)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lomonosov Moscow State University, 1 Leninskiye Gory Street, 119991, Moscow, Russia

    Evgenii Vinarskii

  2. National Research Tomsk State University, 36 Lenin Ave., 634050, Tomsk, Russia

    Andrey Laputenko

  3. Ivannikov Institute for System Programming of the Russian Academy of Sciences, 25 Alexander Solzhenitsyn Street, 109004, Moscow, Russia

    Nina Yevtushenko

Authors
  1. Evgenii Vinarskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrey Laputenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nina Yevtushenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Evgenii Vinarskii .

Editor information

Editors and Affiliations

  1. University of Naples Federico II, Naples, Italy

    Valentina Casola

  2. University of Naples Federico II, Naples, Italy

    Alessandra De Benedictis

  3. University of Campania "Luigi Vanvitelli", Aversa, Italy

    Massimiliano Rak

Rights and permissions

Reprints and permissions

Copyright information

© 2020 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Vinarskii, E., Laputenko, A., Yevtushenko, N. (2020). Using an SMT Solver for Checking the Completeness of FSM-Based Tests. In: Casola, V., De Benedictis, A., Rak, M. (eds) Testing Software and Systems. ICTSS 2020. Lecture Notes in Computer Science(), vol 12543. Springer, Cham. https://doi.org/10.1007/978-3-030-64881-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-64881-7_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-64880-0

  • Online ISBN: 978-3-030-64881-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation