skip to main content
review-article
Free Access

Model learning

Published:23 January 2017Publication History
Skip Abstract Section

Abstract

Model learning emerges as an effective method for black-box state machine models of hardware and software components.

References

  1. Aarts, F., Fiterău-Broştean, P., Kuppens, H., Vaandrager, F. Learning register automata with fresh value generation. In ICTAC'15, LNCS 9399 (2015). Springer, 165--183. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Aarts, F., Jonsson, B., Uijen, J., Vaandrager, F. Generating models of infinite-state communication protocols using regular inference with abstraction. Formal Methods Syst. Des. 46, 1 (2015), 1--41. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Aarts, F., de Ruiter, J., Poll, E. Formal models of bank cards for free. In SECTEST'13 (2013). IEEE, 461--468. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Aarts, F., Vaandrager, F. Learning I/O automata. In CONCUR'10, LNCS 6269 (2010). Springer, 71--85.Google ScholarGoogle Scholar
  5. Alur, R., Madhusudan, P. Visibly pushdown languages. In STOC'04 (2004). ACM, 202--211. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Angluin, D. Learning regular sets from queries and counterexamples. Inf. Comput. 75, 2 (1987), 87--106. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Bennett, K. Legacy systems: coping with success. IEEE Softw. 12, 1 (1995), 19--23. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Berg, T., Grinchtein, O., Jonsson, B., Leucker, M., Raffelt, H., Steffen, B. On the correspondence between conformance testing and regular inference. In FASE'05, LNCS 3442 (2005). Springer, 175--189. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Bollig, B., Katoen, J.-P., Kern, C., Leucker, M., Neider, D., Piegdon, D. libalf: The automata learning framework. In CAV'10, LNCS 6174 (2010). Springer, 360--364.Google ScholarGoogle Scholar
  10. Cassel, S., Howar, F., Jonsson, B. RALib: A LearnLib extension for inferring EFSMs. In DIFTS 15 (2015).Google ScholarGoogle Scholar
  11. Cassel, S., Howar, F., Jonsson, B., Merten, M., Steffen, B. A succinct canonical register automaton model. J. Log. Algebr. Meth. Program. 84, 1 (2015), 54--66. Google ScholarGoogle ScholarCross RefCross Ref
  12. Cassel, S., Howar, F., Jonsson, B., Steffen, B. Active learning for extended finite state machines. Formal Asp. Comput. 28, 2 (2016), 233--263. Google ScholarGoogle ScholarCross RefCross Ref
  13. Chalupar, G., Peherstorfer, S., Poll, E., Ruiter, J. Automated reverse engineering using Lego. In WOOT'14 (Aug. 2014). IEEE Computer Society.Google ScholarGoogle Scholar
  14. Cho, C., Babic, D., Shin, E., Song, D. Inference and analysis of formal models of botnet command and control protocols. In CCS'10 (2010). ACM, 426--439. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Clarke, E., Grumberg, O., Peled, D. Model Checking. MIT Press, Cambridge, MA, 1999.Google ScholarGoogle Scholar
  16. Feng, L., Lundmark, S., Meinke, K., Niu, F., Sindhu, M., Wong, P. Case studies in learning-based testing. In ICTSS'13, LNCS 8254 (2013). Springer, 164--179. Google ScholarGoogle ScholarCross RefCross Ref
  17. Fiterău-Broştean, P., Janssen, R., Vaandrager, F. Combining model learning and model checking to analyze TCP implementations. In CAV'16, LNCS 9780 (2016). Springer, 454--471. Google ScholarGoogle ScholarCross RefCross Ref
  18. Grinchtein, O., Jonsson, B., Leucker, M. Learning of event-recording automata. Theor. Comput. Sci. 411, 47 (2010), 4029--4054. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Groce, A., Peled, D., Yannakakis, M. Adaptive model checking. Logic J. IGPL 14, 5 (2006), 729--744. Google ScholarGoogle ScholarCross RefCross Ref
  20. Hagerer, A., Hungar, H., Niese, O., Steffen, B. Model generation by moderated regular extrapolation. In FASE'02, LNCS 2306 (2002). Springer, 80--95. Google ScholarGoogle ScholarCross RefCross Ref
  21. Henrix, M. Performance improvement in automata learning. Master thesis, Radboud University (2015).Google ScholarGoogle Scholar
  22. Hungar, H., Niese, O., Steffen, B. Domain-specific optimization in automata learning. In CAV 2003, LNCS 2725 (2003). Springer, 315--327. Google ScholarGoogle ScholarCross RefCross Ref
  23. de la Higuera, C. Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, 2010. Google ScholarGoogle ScholarCross RefCross Ref
  24. Isberner, M. Foundations of active automata learning: An algorithmic perspective. PhD thesis, Technical University of Dortmund (2015).Google ScholarGoogle Scholar
  25. Isberner, M., Howar, F., Steffen, B. The TTT algorithm: A redundancy-free approach to active automata learning. In RV'14, LNCS 8734 (2014). Springer, 307--322. Google ScholarGoogle ScholarCross RefCross Ref
  26. Isberner, M., Howar, F., Steffen, B. The open-source LearnLib - A framework for active automata learning. In CAV'15, LNCS 9206 (2015). Springer, 487--495.Google ScholarGoogle Scholar
  27. Jhala, R., Majumdar, R. Software model checking. ACM Comput. Surv. 41, 4 (Oct. 2009), 21:1--21:54.Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Kearns, M.J., Vazirani, U.V. An Introduction to Computational Learning Theory. MIT Press, 1994.Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Lee, D., Yannakakis, M. Principles and methods of testing finite state machines---A survey. Proc. IEEE 84, 8 (1996), 1090--1123. Google ScholarGoogle ScholarCross RefCross Ref
  30. Margaria, T., Niese, O., Raffelt, H., Steffen, B. Efficient test-based model generation for legacy reactive systems. In HLDVT'04 (2004). IEEE Computer Society, 95--100. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Moore, E. Gedanken-experiments on sequential machines. In Automata Studies, Annals of Mathematics Studies 34 (1956). Princeton University Press, 129--153. Google ScholarGoogle ScholarCross RefCross Ref
  32. Peled, D., Vardi, M., Yannakakis, M. Black box checking. J. Autom. Lang. Comb. 7, 2 (2002), 225--246.Google ScholarGoogle Scholar
  33. Rivest, R.L., Schapire, R.E. Inference of finite automata using homing sequences. Inf. Comput. 103, 2 (1993), 299--347. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. de Ruiter, J., Poll, E. Protocol state fuzzing of TLS implementations. In USENIX Security'15 (2015). USENIX Association, 193--206.Google ScholarGoogle Scholar
  35. Schuts, M., Hooman, J., Vaandrager, F. Refactoring of legacy software using model learning and equivalence checking: an industrial experience report. In iFM'16, LNCS 9681 (2016). Springer, 311--325.Google ScholarGoogle Scholar
  36. Shahbaz, M., Groz, R. Analysis and testing of black-box component-based systems by inferring partial models. Softw. Test. Verif. Reliab. 24, 4 (2014), 253--288. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Valiant, L.G. A theory of the learnable. In STOC'84 (1984). ACM, 436--445. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Volpato, M., Tretmans, J. Approximate active learning of nondeterministic input output transition systems. Electron. Commun. EASST 72 (2015).Google ScholarGoogle Scholar
  39. Windmüller, S., Neubauer, J., Steffen, B., Howar, F., Bauer, O. Active continuous quality control. In CBSE'13 (2013). ACM, 111--120. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Model learning

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Communications of the ACM
          Communications of the ACM  Volume 60, Issue 2
          February 2017
          106 pages
          ISSN:0001-0782
          EISSN:1557-7317
          DOI:10.1145/3042068
          • Editor:
          • Moshe Y. Vardi
          Issue’s Table of Contents

          Copyright © 2017 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 23 January 2017

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • review-article
          • Popular
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format