Skip to main content

Specifying and Generating Test Cases Using Observer Automata

  • Conference paper
Formal Approaches to Software Testing (FATES 2004)

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

Included in the following conference series:

  • 813 Accesses

Abstract

We present a technique for specifying coverage criteria and a method for generating test suites for systems whose behaviours can be described as extended finite state machines (EFSM). To specify coverage criteria we use observer automata with parameters, which monitor and accept traces that cover a given test criterion of an EFSM. The flexibility of the technique is demonstrated by specifying a number of well-known coverage criteria based on control- and data-flow information using observer automata with parameters. We also develop a method for generating test cases from coverage criteria specified as observers. It is based on transforming a given observer automata into a bitvector analysis problem that can be efficiently implemented as an extension to an existing state-space exploration such as, e.g. SPIN or Uppaal.

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

Access this chapter

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. Bouquet, F., Legeard, B.: Reification of executable test scripts in formal specification-based test generation: The java card transaction mechanism case study. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 778–795. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Clarke, L.A., Podgurski, A., Richardsson, D.J., Zeil, S.J.: A formal evaluation of data flow path delection criteria. IEEE Trans. on Software Engineering SE-15(11), 1318–1332 (1989)

    Article  Google Scholar 

  3. du Bousquet, L., Ramangalahy, S., Simon, S., Viho, C., Belinfante, A., de Vries, R.G.: Formal test automation: The conference protocol with tgv/torx. In: Ural, H., Probert, R.L., von Bochmann, G. (eds.) IFIP 13th Int. Conference on Testing of Communicating Systems(TestCom 2000). Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  4. du Bousquet, L., Zuanon, N.: An overview of Lutess, a specification-based tool for testing synchronous software. In: Proc. 14th IEEE Intl. Conf. on Automated SW Engineering (October 1999)

    Google Scholar 

  5. Fernandez, J.-C., Jard, C., Jéron, T., Viho, C.: An experiment in automatic generation of test suites for protocols with verification technology. Science of Computer Programming 29 (1997)

    Google Scholar 

  6. Friedman, G., Hartman, A., Nagin, K., Shiran, T.: Projected state machine coverage for software testing. In: Proc. ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 134–143 (2002)

    Google Scholar 

  7. Gnesi, S., Latella, D., Massink, M.: Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking. Journal of Logic and Algebraic Programming 51(1), 43–75 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Havelund, K., Rosu, G.: Synthesizing monitors for safety properties. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 324–356. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Hessel, A., Larsen, K.G., Nielsen, B., Pettersson, P., Skou, A.: Time-Optimal Real-Time Test Case Generation using Uppaal. In: Petrenko, A., Ulrich, A. (eds.) FATES 2003. LNCS, vol. 2931, pp. 136–151. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Hessel, A., Pettersson, P.: A test generation algorithm for real-time systems. To appear in Proc. of 4th Int. Conf. on Quality Software (September 2004)

    Google Scholar 

  11. Holzmann, G.J.: The model checker SPIN. IEEE Trans. on Software Engineering SE-23(5), 279–295 (1997)

    Article  Google Scholar 

  12. Hong, H.S., Cha, S.D., Lee, I., Sokolsky, O., Ural, H.: Data flow testing as model checking. In: ICSE 2003: 25th Int. Conf. on Software Enginering, pp. 232–242 (May 2003)

    Google Scholar 

  13. Hong, H.S., Lee, I., Sokolsky, O., Ural, H.: A temporal logic based theory of test coverage. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 327–341. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. ITU, Geneva: ITU-T, Z.100, Specification and Description Language (SDL) (November 1999)

    Google Scholar 

  15. Knoop, J., Steffen, B., Vollmer, J.: Parallelism for free: Efficient and optimal bitvector analyses for parallel programs. ACM Transactions on Programming Languages and Systems 18(3), 268–299 (1996)

    Article  Google Scholar 

  16. Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Software Tools for Technology Transfer. 1(1-2) (1997)

    Google Scholar 

  17. Lugato, D., Bigot, C., Valot, Y.: Validation and automatic test generation on UML models: the AGATHA approach. In: Proc. 7th Int. Workshop on Formal Methods for Industrial Critical Systems (FMICS 2002). Electronic Notes in Theoretical Computer Science, vol. 66 (2002)

    Google Scholar 

  18. Marre, B., Arnould, A.: Test Sequence Generation from Lustre Descriptions: GATEL. In: Proc. 15th IEEE Intl. Conf. on Automated Software Engineering (ASE 2000), Grenoble (2000)

    Google Scholar 

  19. Meudec, C.: ATGen: Automatic test data generation using constraint logic programming and symbolic execution. In: Proc. 1st Intl. Workshop on Automated Program Analysis, Testing, and Verification, Limerick (2000)

    Google Scholar 

  20. Muchnick, S.S.: Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  21. Nielsen, B., Skou, A.: Automated test generation from timed automata. International Journal on Software Tools for Technology Transfer. 5, 59–77 (2003)

    Article  MATH  Google Scholar 

  22. Pretschner, A.: Classical search strategies for test case generation with constraint logic programming. In: Proc. Formal Approaches to Testing of Software, FATES 2001, Aalborg, Denmark, August 2001, pp. 47–60 (2001)

    Google Scholar 

  23. Rusu, V., du Bousquet, L., Jéron, T.: An approach to symbolic test generation. In: Grieskamp, W., Santen, T., Stoddart, B. (eds.) IFM 2000. LNCS, vol. 1945, pp. 338–357. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  24. Schmitt, M., Ek, A., Grabowski, J., Hogrefe, D., Koch, B.: Autolink - putting sdl-based test generation into practice. In: 11th Int. Workshop on Testing of Communicating Systems (IWTCS 1998), Tomsk, Russia (September 1998)

    Google Scholar 

  25. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. LICS 1986, 1st IEEE Int. Symp. on Logic in Computer Science, pp. 332–344 (June 1986)

    Google Scholar 

  26. Wolper, P.: Temporal logic can be more expressive. In: Proc. 22nd Annual Symp. Foundations of Computer Science, pp. 340–348 (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 IFIP International Federation for Information Processing

About this paper

Cite this paper

Blom, J., Hessel, A., Jonsson, B., Pettersson, P. (2005). Specifying and Generating Test Cases Using Observer Automata. In: Grabowski, J., Nielsen, B. (eds) Formal Approaches to Software Testing. FATES 2004. Lecture Notes in Computer Science, vol 3395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31848-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31848-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25109-5

  • Online ISBN: 978-3-540-31848-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics