Skip to main content
Springer Nature Link
Log in

Test Suite Completeness and Partial Models

  • Conference paper
Software Engineering and Formal Methods (SEFM 2014)

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

Included in the following conference series:

  • 986 Accesses

Abstract

Test suite generation and coverage analysis have been widely studied for FSM-based models. Several studies focused on specific conditions for verifying completeness of test suites. Some have found necessary conditions for test suite completeness, whereas other approaches obtained sufficient, but not necessary, conditions for this problem. Most of these works restricted the specification or the implementation FSM models in several ways. Some works show how to generate specific complete test suites, but they do not deal with the general problem of checking completeness for any given test suite. In this work we describe necessary and sufficient conditions that guarantee test suite completeness even in the presence of partial FSM models, and when test cases are blocking.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bonifacio, A.L., Moura, A.V.: Necessity and sufficiency for checking m-completeness of test suites. Tech. Rep. IC-13-21, Institute of Computing, University of Campinas (September 2013), http://www.ic.unicamp.br/~reltech/2013/13-21.pdf

  2. Bonifacio, A.L., Moura, A.V.: On the Completeness of Test Suites. In: Proceedings of the 29th Annual ACM Symposium on Applied Computing (SAC), Gyeongju, Korea, vol. 2, pp. 1287–1293. ACM (March 2014) ISBN: 978-1-4503-2469-4

    Google Scholar 

  3. Bonifacio, A.L., Moura, A.V., da Silva Simão, A.: Model partitions and compact test case suites. Int. J. Found. Comput. Sci. 23(1), 147–172 (2012)

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  7. Gill, A.: Introduction to the theory of finite-state machines. McGraw-Hill, New York (1962)

    MATH  Google Scholar 

  8. Gonenc, G.: A method for the design of fault detection experiments. IEEE Trans. Comput. 19(6), 551–558 (1970)

    Article  Google Scholar 

  9. Hennie, F.C.: Fault detecting experiments for sequential circuits. In: Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, Princeton, New Jersey, USA, November 11-13, pp. 95–110. IEEE (1964)

    Google Scholar 

  10. Hierons, R.M.: Separating sequence overlap for automated test sequence generation. Automated Software Engg. 13(2), 283–301 (2006)

    Article  Google Scholar 

  11. Hierons, R.M., Ural, H.: Reduced length checking sequences. IEEE Trans. Comput. 51(9), 1111–1117 (2002), http://dx.doi.org/10.1109/TC.2002.1032630

    Article  MathSciNet  Google Scholar 

  12. Hierons, R.M., Ural, H.: Optimizing the length of checking sequences. IEEE Trans. Comput. 55(5), 618–629 (2006), http://dx.doi.org/10.1109/TC.2006.80

    Article  MathSciNet  Google Scholar 

  13. Petrenko, A., Bochmann, G.V.: On fault coverage of tests for finite state specifications. Computer Networks and ISDN Systems 29, 81–106 (1996)

    Article  Google Scholar 

  14. Petrenko, A., Yevtushenko, N.: On test derivation from partial specifications. In: Bolognesi, T., Latella, D. (eds.) FORTE. IFIP AICT, vol. 55, pp. 85–102. Springer, Heidelberg (2000)

    Google Scholar 

  15. Petrenko, A., Yevtushenko, N.: Testing from partial deterministic fsm specifications. IEEE Trans. Comput. 54(9), 1154–1165 (2005), http://dx.doi.org/10.1109/TC.2005.152

    Article  Google Scholar 

  16. Simão, A., Petrenko, A., Yevtushenko, N.: Generating reduced tests for fsms with extra states. In: Núñez, M., Baker, P., Merayo, M.G. (eds.) TESTCOM/FATES 2009. LNCS, vol. 5826, pp. 129–145. Springer, Heidelberg (2009)

    Google Scholar 

  17. Simao, A., Petrenko, A., Yevtushenko, N.: On reducing test length for fsms with extra states. Softw. Test. Verif. Reliab. 22(6), 435–454 (2012), http://dx.doi.org/10.1002/stvr.452

    Article  Google Scholar 

  18. Simao, A.D.S., Petrenko, P.: Checking completeness of tests for finite state machines. IEEE Trans. Computers 59(8), 1023–1032 (2010)

    Article  MathSciNet  Google Scholar 

  19. Sipser, M.: Introduction to the Theory of Computation. International Thomson Publishing (1996)

    Google Scholar 

  20. Ural, H., Wu, X., Zhang, F.: On minimizing the lengths of checking sequences. IEEE Trans. Comput. 46(1), 93–99 (1997), http://dx.doi.org/10.1109/12.559807

    Article  Google Scholar 

  21. Yao, M.Y., Petrenko, A., von Bochmann, G.: Fault coverage analysis in respect to an fsm specification. In: INFOCOM, pp. 768–775 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Department, University of Londrina, Londrina, Brazil

    Adilson Luiz Bonifacio

  2. Computing Institute, University of Campinas, Campinas, Brazil

    Arnaldo Vieira Moura

Authors
  1. Adilson Luiz Bonifacio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arnaldo Vieira Moura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. NASA Ames Research Center, Mail Stop 269-2, Moffett Field, 94035, CA, USA

    Dimitra Giannakopoulou

  2. Inria Grenoble-Rhône-Alpes, 655, Avenue de l’Europe, Montbonnot Saint-Martin, 38330, France

    Gwen Salaün

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bonifacio, A.L., Moura, A.V. (2014). Test Suite Completeness and Partial Models. In: Giannakopoulou, D., Salaün, G. (eds) Software Engineering and Formal Methods. SEFM 2014. Lecture Notes in Computer Science, vol 8702. Springer, Cham. https://doi.org/10.1007/978-3-319-10431-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10431-7_8

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10430-0

  • Online ISBN: 978-3-319-10431-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics