Skip to main content
SpringerLink
Log in

Testing, Optimizaton, and Games

  • Conference paper
Automata, Languages and Programming (ICALP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3142))

Included in the following conference series:

Abstract

We discuss algorithmic problems arising in the testing of reactive systems, i.e. systems that interact with their environment. The goal is to design test sequences so that we can deduce desired information about the given system under test, such as whether it conforms to a given specification model, or whether it satisfies given requirement properties. Test generation can be approached from different points of view – as an optimization problem of minimizing cost and maximizing the effectiveness of the tests; as a game between tester and system under test; or as a learning problem. We touch on some of these aspects and related algorithmic questions.

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 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 Trans. on Communication 39(11), 1604–1615 (1991)

    Article  Google Scholar 

  2. Alur, R., Courcoubetis, C., Yannakakis, M.: Distinguishing tests for nondeterministic and probabilistic machines. In: Proc. 27th Ann. ACM Symp. on Theory of Computing, pp. 363–372 (1995)

    Google Scholar 

  3. Alur, R., Yannakakis, M.: Model checking of hierarchical state machines. ACM Trans. on Progr. Languages and Systems 23(3), 273–303 (2001)

    Article  Google Scholar 

  4. Angluin, D.: Learning regular sets from queries and counterexamples. Inform. and Comp. 75, 87–106 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. Apfelbaum, L.: Automated functional test generation. In: Proc. IEEE Autotestcon Conference (1995)

    Google Scholar 

  6. Booch, G., Jacobson, I., Rumbaugh, J.: Unified Modeling Language User Guide. Addison-Wesley, Reading (1997)

    Google Scholar 

  7. Brinksma, E., Tretmans, J.: Testing transition systems: An annotated bibliography. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol. 2067, pp. 187–195. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  9. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)

    Google Scholar 

  10. Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Mathematical Programming 5, 88–124 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  11. Etessami, K., Yannakakis, M.: From Rule-Based to Automata-Based Testing. In: Proc. IFIP Joint Intl. Conf. FORTE XIII-PSTV XX, pp. 53–68. Kluwer, Dordrecht (2000)

    Google Scholar 

  12. Friedman, G., Hartman, A., Nagin, K., Shiran, T.: Projected state machine coverage for software testing. In: Proc. ISSTA (2002)

    Google Scholar 

  13. Frieze, A., Galbiati, G., Maffioli, F.: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12, 23–39 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  14. Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 357–370. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Harel, D.: Statecharts: A visual formalism for complex systems. Science of Computer Programming 8, 231–274 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  16. Hennie, F.C.: Fault detection experiments for sequential circuits. In: Proc. 5th Annual Symp. Switching Circuit Theory and Logical Design, pp. 95–110 (1964)

    Google Scholar 

  17. Holzmann, G., Peled, D.A., Redberg, M.H.: Design tools for requirements engineering. Bell Labs Technical Journal 2, 86–95 (1997)

    Article  Google Scholar 

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

    Chapter  Google Scholar 

  19. Lee, D., Yannakakis, M.: On-line minimization of transition systems. In: Proc. 24th Ann. ACM Symp. on Theory of Computing, pp. 264–274 (1992)

    Google Scholar 

  20. Lee, D., Yannakakis, M.: Testing finite state machines: state identification and verification. IEEE Trans. on Computers 43(3), 306–320 (1994)

    Article  MathSciNet  Google Scholar 

  21. Lee, D., Yannakakis, M.: Optimization problems from feature testing of communication protocols. In: Proc. Intl. Conf. on Network Protocols, pp. 66–75 (1996)

    Google Scholar 

  22. Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines - a survey. Proc. of IEEE 84(8), 1090–1123 (1996)

    Article  Google Scholar 

  23. Moore, E.F.: Gedanken-experiments on sequential machines. Automata Studies, Annals of Mathematics Studies, vol. 34, pp. 129–153. Princeton University Press, Princeton (1956)

    Google Scholar 

  24. Mosk-Aoyama, D., Yannakakis, M.: Testing Hierarchical Systems via Edge Covering (2004) (manuscript)

    Google Scholar 

  25. Naito, S., Tsunoyama, M.: Fault detection for sequential machines by transitions tours. In: Proc. IEEE Fault Tolerant Comput. Symp., pp. 238–243. IEEE Computer Society Press, Los Alamitos (1981)

    Google Scholar 

  26. Peled, D., Vardi, M., Yannakakis, M.: Black box checking. Journal of Automata, Languages and Combinatorics 7(2), 225–246 (2002)

    MATH  MathSciNet  Google Scholar 

  27. Petrenko, A.: Fault model-driven test derivation from finite state models: Annotated bibliography. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol. 2067, pp. 196–205. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  28. Reif, J.: The complexity of two-player games with incomplete information. J. Computer and System Sciences 29, 274–301 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  29. Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. In: Proc. 21st Ann. Symp. on Theory of Computing, pp. 411–420 (1989)

    Google Scholar 

  30. Tretmans, J.: Test generation with inputs, outputs amd repetitive quiescence. Software - Concepts and Tools 17(3), 103–120 (1996)

    MATH  Google Scholar 

  31. http://cm.bell-labs.com/cm/cs/what/ubet

  32. Vasilevskii, M.P.: Failure diagnosis of automata. Kibernetika (4), 98–108 (1973)

    MathSciNet  Google Scholar 

  33. Yannakakis, M., Lee, D.: Testing finite state machines: fault detection. J. of Computer and System Sciences 50(2), 209–227 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Columbia University, New York, NY, 10027, USA

    Mihalis Yannakakis

Authors
  1. Mihalis Yannakakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega, 240 Jordi Girona Salgado, 1-3 E-08034, Barcelona

    Josep Díaz

  2. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. Department of Mathematics, University of Turku, Turku, Finland

    Arto Lepistö

  4. Laboratory for Foundations of Computer Science, University of Edinburgh,  

    Donald Sannella

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yannakakis, M. (2004). Testing, Optimizaton, and Games. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27836-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22849-3

  • Online ISBN: 978-3-540-27836-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation