Skip to main content

Test Generation from Recursive Tiles Systems

  • Conference paper
Tests and Proofs (TAP 2012)

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

Included in the following conference series:

Abstract

In this paper we explore test generation for Recursive Tiles Systems (RTS) in the framework of the classical ioco testing theory. The RTS model allows the description of reactive systems with recursion, and is very similar to other models like Pushdown Automata, Hyperedge Replacement Grammars or Recursive State Machines. We first present an off-line test generation algorithm for Weighted RTS, a determinizable sub-class of RTS, and second, an on-line test generation algorithm for the full RTS model. Both algorithms use test purposes to guide test selection through targeted behaviours.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Etessami, K., Yannakakis, M.: Analysis of Recursive State Machines. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 207–220. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 202–211. ACM (2004)

    Google Scholar 

  3. Caucal, D.: Deterministic graph grammars. Texts in Logics and Games, vol. 2, pp. 169–250 (2007)

    Google Scholar 

  4. Caucal, D.: Synchronization of Regular Automata. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 2–23. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Caucal, D., Hassen, S.: Synchronization of Grammars. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 110–121. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Constant, C., Jeannet, B., Jéron, T.: Automatic Test Generation from Interprocedural Specifications. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds.) TestCom/FATES 2007. LNCS, vol. 4581, pp. 41–57. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Handbook of Theoretical Computer Science. Elsevier (1990)

    Google Scholar 

  8. Frantzen, L., Tretmans, J., Willemse, T.A.C.: A Symbolic Framework for Model-Based Testing. In: Havelund, K., Núñez, M., Roşu, G., Wolff, B. (eds.) FATES 2006 and RV 2006. LNCS, vol. 4262, pp. 40–54. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Jard, C., Jéron, T.: TGV: theory, principles and algorithms. Software Tools for Technology Transfer (STTT) 7(4), 297–315 (2005)

    Article  Google Scholar 

  10. Jeannet, B., Jéron, T., Rusu, V.: Model-Based Test Selection for Infinite-State Reactive Systems. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol. 4709, pp. 47–69. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Nowotka, D., Srba, J.: Height-Deterministic Pushdown Automata. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 125–134. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Tretmans, G.J., Brinksma, H.: Torx: Automated model-based testing. In: Hartman, A., Dussa-Ziegler, K. (eds.) First European Conference on Model-Driven Software Engineering, pp. 31–43 (December 2003)

    Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chédor, S., Jéron, T., Morvan, C. (2012). Test Generation from Recursive Tiles Systems. In: Brucker, A.D., Julliand, J. (eds) Tests and Proofs. TAP 2012. Lecture Notes in Computer Science, vol 7305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30473-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30473-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30472-9

  • Online ISBN: 978-3-642-30473-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics