Skip to main content

Model-Based Testing and Model Inference

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7609))

Introduction

Model-based software testing is well established, and can be traced back to Moore’s ”Gedanken experiments” on finite state machines from 1956 [10]. The best known approaches involve the use of models (such as UML interaction diagrams or state machines) as the basis for selecting test inputs that seek to explore the core functionality of the system. Outputs from the test executions can subsequently be checked against the model.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(1), 87–106 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bergadano, F., Gunetti, D.: Testing by means of inductive program learning. ACM Trans. Software Engineering and Methodology 5(2), 119–145 (1996)

    Article  Google Scholar 

  3. Groz, R., Irfan, M.-N., Oriat, C.: Algorithmic Improvements on Regular Inference of Software Models and Perspectives for Security Testing. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012, Part I. LNCS, vol. 7609, pp. 444–457. Springer, Heidelberg (2012)

    Google Scholar 

  4. Howar, F.M.: Active Learning of Interface Programs. PhD thesis, Faculty of Informatics, Technical University of Dortmund (2012)

    Google Scholar 

  5. Kitamura, T., Do, N.T.B., Ohsaki, H., Fang, L., Yatabe, S.: Test-Case Design by Feature Trees. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012, Part I. LNCS, vol. 7609, pp. 458–473. Springer, Heidelberg (2012)

    Google Scholar 

  6. Meinke, K.: A Stochastic Theory of Black-Box Software Testing. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 578–595. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Meinke, K., Niu, F.: An Incremental Learning Algorithm for Extended Mealy Automata. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012, Part I. LNCS, vol. 7609, pp. 488–504. Springer, Heidelberg (2012)

    Google Scholar 

  8. Meinke, K., Niu, F., Sindhu, M.: Learning-based software testing: a tutorial. In: Proc. Fourth Int. ISoLA Workshop on Machine Learning for Software Construction. CCIS. Springer (2011)

    Google Scholar 

  9. Meinke, K., Sindhu, M.A.: Incremental Learning-Based Testing for Reactive Systems. In: Gogolla, M., Wolff, B. (eds.) TAP 2011. LNCS, vol. 6706, pp. 134–151. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Moore, E.F.: Gedanken experiments on sequential machines. In: Automata Studies, Princeton, pp. 129–153 (1956)

    Google Scholar 

  11. Lu, Z., Mukhopadhyay, S.: Model-Based Static Code Analysis For MATLAB Models. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012, Part I. LNCS, vol. 7609, pp. 474–487. Springer, Heidelberg (2012)

    Google Scholar 

  12. Peled, D., Vardi, M.Y., Yannakakis, M.: Black-box checking. In: Formal Methods for Protocol Engineering and Distributed Systems FORTE/PSTV, pp. 225–240. Kluwer (1999)

    Google Scholar 

  13. Raffelt, H., Steffen, B., Margaria, T.: Dynamic Testing Via Automata Learning. In: Yorav, K. (ed.) HVC 2007. LNCS, vol. 4899, pp. 136–152. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Walkinshaw, N.: Assessing Test Adequacy for Black-Box Systems without Specifications. In: Wolff, B., Zaïdi, F. (eds.) ICTSS 2011. LNCS, vol. 7019, pp. 209–224. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Walkinshaw, N., Bogdanov, K., Derrick, J., Paris, J.: Increasing Functional Coverage by Inductive Testing: A Case Study. In: Petrenko, A., Simão, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol. 6435, pp. 126–141. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Weyuker, E.: Assessing test data adequacy through program inference. ACM Trans. Program. Lang. Syst. 5(4), 641–655 (1983)

    Article  MATH  Google Scholar 

  17. Zhu, H.: A formal interpretation of software testing as inductive inference. Journal of Software testing, Verification and Reliability 6(1), 3–31 (1996)

    Article  Google Scholar 

  18. Zhu, H., Hall, P., May, J.: Inductive inference and software testing. Journal of Software testing, Verification and Reliability 2(2), 3–31 (1992)

    Article  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

Meinke, K., Walkinshaw, N. (2012). Model-Based Testing and Model Inference. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change. ISoLA 2012. Lecture Notes in Computer Science, vol 7609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34026-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34026-0_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34025-3

  • Online ISBN: 978-3-642-34026-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics