{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:11:50Z","timestamp":1760080310814,"version":"3.40.3"},"publisher-location":"Cham","reference-count":74,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319919072"},{"type":"electronic","value":"9783319919089"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-91908-9_26","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T05:05:00Z","timestamp":1570165500000},"page":"563-588","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Combining Black-Box and White-Box Techniques for Learning Register Automata"],"prefix":"10.1007","author":[{"given":"Falk","family":"Howar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bengt","family":"Jonsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,5]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-25150-9_11","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2015","author":"F Aarts","year":"2015","unstructured":"Aarts, F., Fiterau-Brostean, P., Kuppens, H., Vaandrager, F.: Learning register automata with fresh value generation. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 165\u2013183. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-25150-9_11"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-662-45234-9_15","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"F Aarts","year":"2014","unstructured":"Aarts, F., Howar, F., Kuppens, H., Vaandrager, F.: Algorithms for inferring register automata. In: Margaria, T., Steffen, B. (eds.) ISoLA 2014. LNCS, vol. 8802, pp. 202\u2013219. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-662-45234-9_15"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10703-014-0216-x","volume":"46","author":"F Aarts","year":"2015","unstructured":"Aarts, F., Jonsson, B., Uijen, J., Vaandrager, F.W.: Generating models of infinite-state communication protocols using regular inference with abstraction. Formal Methods Syst. Des. 46(1), 1\u201341 (2015)","journal-title":"Formal Methods Syst. Des."},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-16558-0_54","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F Aarts","year":"2010","unstructured":"Aarts, F., Schmaltz, J., Vaandrager, F.: Inference and abstraction of the biometric passport. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6415, pp. 673\u2013686. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16558-0_54"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32940-1_18","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"F Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Vaandrager, F.: A theory of history dependent abstractions for learning interface automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 240\u2013255. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-32940-1_18"},{"issue":"2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Avgerinos, T., Rebert, A., Cha, S.K., Brumley, D.: Enhancing symbolic execution with veritesting. In: Proceedings of the 36th International Conference on Software Engineering, ICSE 2014, pp. 1083\u20131094. ACM, New York (2014)","DOI":"10.1145\/2568225.2568293"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Bell, J., Kaiser, G.: Phosphor: illuminating dynamic data flow in commodity JVMs. In: Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA 2014, pp. 83\u2013101. ACM, New York (2014)","DOI":"10.1145\/2714064.2660212"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-31984-9_14","volume-title":"Fundamental Approaches to Software Engineering","author":"T Berg","year":"2005","unstructured":"Berg, T., Grinchtein, O., Jonsson, B., Leucker, M., Raffelt, H., Steffen, B.: On the correspondence between conformance testing and regular inference. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 175\u2013189. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/978-3-540-31984-9_14"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-78743-3_24","volume-title":"Fundamental Approaches to Software Engineering","author":"T Berg","year":"2008","unstructured":"Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines using domains with equality tests. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 317\u2013331. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-78743-3_24"},{"issue":"6","key":"26_CR11","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1049\/sej.1991.0040","volume":"6","author":"G Bernot","year":"1991","unstructured":"Bernot, G., Gaudel, M.C., Marre, B.: Software testing based on formal specifications: a theory and a tool. Softw. Eng. J. 6(6), 387\u2013405 (1991)","journal-title":"Softw. Eng. J."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Bossert, G., Hiet, G., Henin, T.: Modelling to simulate botnet command and control protocols for the evaluation of network intrusion detection systems. In: Proceedings of the 6th Conference on Network and Information Systems Security, SAR-SSI 2011, pp. 1\u20138. IEEE Computer Society (2011)","DOI":"10.1109\/SAR-SSI.2011.5931397"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Botin\u010dan, M., Babi\u0107, D.: Sigma*: symbolic learning of input-output specifications. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, pp. 443\u2013456. ACM, New York (2013)","DOI":"10.1145\/2480359.2429123"},{"key":"26_CR14","unstructured":"Cassel, S., Howar, F., Jonsson, B.: RALib: a LearnLib extension for inferring EFSMs. In: International Workshop on Design and Implementation of Formal Tools and Systems, DIFTS 2015, Austin, Texas (2015). \n                      http:\/\/www.faculty.ece.vt.edu\/chaowang\/difts2015\/papers\/paper_5.pdf"},{"issue":"2","key":"26_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00165-016-0355-5","volume":"28","author":"S Cassel","year":"2016","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Asp. Comput. 28(2), 233\u2013263 (2016)","journal-title":"Formal Asp. Comput."},{"key":"26_CR16","unstructured":"Chalupar, G., Peherstorfer, S., Poll, E., de Ruiter, J.: Automated reverse engineering using Lego. In: Proceedings of 8th USENIX Workshop on Offensive Technologies (WOOT 2014), San Diego, California, Los Alamitos, CA, USA, August 2014. IEEE Computer Society (2014)"},{"key":"26_CR17","unstructured":"Cho, C.Y., Babi\u0107, D., Poosankam, P., Chen, K.Z., Wu, E.X., Song, D.: Mace: model-inference-assisted concolic exploration for protocol and vulnerability discovery. In: Proceedings of the 20th USENIX Conference on Security, SEC 2011, Berkeley, CA, USA, p. 10. USENIX Association (2011)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Choi, W.: Automated testing of graphical user interfaces: a new algorithm and challenges. In: Proceedings of the 2013 ACM Workshop on Mobile Development Lifecycle, MobileDeLi 2013, pp. 27\u201328. ACM, New York (2013)","DOI":"10.1145\/2542128.2542136"},{"issue":"10","key":"26_CR19","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/2544173.2509552","volume":"48","author":"W Choi","year":"2013","unstructured":"Choi, W., Necula, G., Sen, K.: Guided GUI testing of android apps with minimal restart and approximate learning. SIGPLAN Not. 48(10), 623\u2013640 (2013)","journal-title":"SIGPLAN Not."},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Clause, J., Li, W., Orso, A.: Dytan: a generic dynamic taint analysis framework. In: Proceedings of the 2007 International Symposium on Software Testing and Analysis, ISSTA 2007, pp. 196\u2013206. ACM, New York (2007)","DOI":"10.1145\/1273463.1273490"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Clause, J., Orso, A.: Penumbra: automatically identifying failure-relevant inputs using dynamic tainting. In: Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009, pp. 249\u2013260. ACM, New York (2009)","DOI":"10.1145\/1572272.1572301"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-36577-X_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"JM Cobleigh","year":"2003","unstructured":"Cobleigh, J.M., Giannakopoulou, D., Pasareanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331\u2013346. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/3-540-36577-X_24"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-30885-7_32","volume-title":"Abstract State Machines, Alloy, B, VDM, and Z","author":"I Dinca","year":"2012","unstructured":"Dinca, I., Ipate, F., Mierla, L., Stefanescu, A.: Learn and test for event-B \u2013 a rodin plugin. In: Derrick, J., Fitzgerald, J., Gnesi, S., Khurshid, S., Leuschel, M., Reeves, S., Riccobene, E. (eds.) ABZ 2012. LNCS, vol. 7316, pp. 361\u2013364. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-30885-7_32"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-34026-0_40","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"I Dinca","year":"2012","unstructured":"Dinca, I., Ipate, F., Stefanescu, A.: Model learning and test generation for event-B decomposition. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7609, pp. 539\u2013553. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-34026-0_40"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-662-54577-5_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Drews","year":"2017","unstructured":"Drews, S., D\u2019Antoni, L.: Learning symbolic automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 173\u2013189. Springer, Heidelberg (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-662-54577-5_10"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-24372-1_40","volume-title":"Automated Technology for Verification and Analysis","author":"L Feng","year":"2011","unstructured":"Feng, L., Han, T., Kwiatkowska, M., Parker, D.: Learning-based compositional verification for synchronous probabilistic systems. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 511\u2013521. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-24372-1_40"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-19811-3_2","volume-title":"Fundamental Approaches to Software Engineering","author":"L Feng","year":"2011","unstructured":"Feng, L., Kwiatkowska, M., Parker, D.: Automated learning of probabilistic assumptions for compositional reasoning. In: Giannakopoulou, D., Orejas, F. (eds.) FASE 2011. LNCS, vol. 6603, pp. 2\u201317. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-19811-3_2"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-67113-0_12","volume-title":"Critical Systems: Formal Methods and Automated Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2017","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Howar, F.: Learning-based testing the sliding window behavior of TCP implementations. In: Petrucci, L., Seceleanu, C., Cavalcanti, A. (eds.) FMICS\/AVoCS -2017. LNCS, vol. 10471, pp. 185\u2013200. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-67113-0_12"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-319-41540-6_25","volume-title":"Computer Aided Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2016","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Janssen, R., Vaandrager, F.: Combining model learning and model checking to analyze TCP implementations. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 454\u2013471. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-41540-6_25"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Lenaerts, T., Poll, E., de Ruiter, J., Vaandrager, F., Verleg, P.: Model learning and model checking of SSH implementations. In: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, SPIN 2017, pp. 142\u2013151. ACM, New York (2017)","DOI":"10.1145\/3092282.3092289"},{"key":"26_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-59293-8_188","volume-title":"TAPSOFT 1995: Theory and Practice of Software Development","author":"M-C Gaudel","year":"1995","unstructured":"Gaudel, M.-C.: Testing can be formal, too. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds.) CAAP 1995. LNCS, vol. 915, pp. 82\u201396. Springer, Heidelberg (1995). \n                      https:\/\/doi.org\/10.1007\/3-540-59293-8_188"},{"key":"26_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-33125-1_18","volume-title":"Static Analysis","author":"D Giannakopoulou","year":"2012","unstructured":"Giannakopoulou, D., Rakamari\u0107, Z., Raman, V.: Symbolic learning of component interfaces. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 248\u2013264. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-33125-1_18"},{"key":"26_CR33","unstructured":"van Glabbeek, R.J.: The linear time \u2013 branching time spectrum I. The semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 3\u201399. North-Holland, Amsterdam (2001)"},{"key":"26_CR34","unstructured":"Godefroid, P., Levin, M.Y., Molnar, D.A.: Automated whitebox fuzz testing. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 2008, 10th February - 13th February 2008, San Diego, California, USA. The Internet Society (2008)"},{"issue":"6","key":"26_CR35","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/1064978.1065036","volume":"40","author":"P Godefroid","year":"2005","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. SIGPLAN Not. 40(6), 213\u2013223 (2005)","journal-title":"SIGPLAN Not."},{"issue":"47","key":"26_CR36","doi-asserted-by":"publisher","first-page":"4029","DOI":"10.1016\/j.tcs.2010.07.008","volume":"411","author":"O Grinchtein","year":"2010","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. Theoret. Comput. Sci. 411(47), 4029\u20134054 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"26_CR37","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1093\/jigpal\/jzl007","volume":"14","author":"A Groce","year":"2006","unstructured":"Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. Logic J. IGPL 14(5), 729\u2013744 (2006)","journal-title":"Logic J. IGPL"},{"key":"26_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45923-5_6","volume-title":"Fundamental Approaches to Software Engineering","author":"A Hagerer","year":"2002","unstructured":"Hagerer, A., Hungar, H., Niese, O., Steffen, B.: Model generation by moderated regular extrapolation. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 80\u201395. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45923-5_6"},{"key":"26_CR39","unstructured":"Hagerer, A., Margaria, T., Niese, O., Steffen, B., Brune, G., Ide, H.-D.: Efficient regression testing of CTI-systems: testing a complex call-center solution. Ann. Rev. Commun. Int. Eng. Consortium (IEC) 55, 1033\u20131040 (2001)"},{"key":"26_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-18275-4_18","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P Hooimeijer","year":"2011","unstructured":"Hooimeijer, P., Veanes, M.: An evaluation of automata algorithms for string analysis. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 248\u2013262. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-18275-4_18"},{"key":"26_CR41","doi-asserted-by":"crossref","unstructured":"H\u00f6schele, M., Zeller, A.: Mining input grammars from dynamic taints. In: Proceedings of the 31st IEEE\/ACM International Conference on Automated Software Engineering, ASE 2016, pp. 720\u2013725. ACM, New York (2016)","DOI":"10.1145\/2970276.2970321"},{"key":"26_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-34026-0_41","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"F Howar","year":"2012","unstructured":"Howar, F., Isberner, M., Steffen, B., Bauer, O., Jonsson, B.: Inferring semantic interfaces of data structures. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7609, pp. 554\u2013571. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-34026-0_41"},{"key":"26_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-27940-9_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F Howar","year":"2012","unstructured":"Howar, F., Steffen, B., Jonsson, B., Cassel, S.: Inferring canonical register automata. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 251\u2013266. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-27940-9_17"},{"key":"26_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-18275-4_19","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F Howar","year":"2011","unstructured":"Howar, F., Steffen, B., Merten, M.: Automata learning with automated alphabet abstraction refinement. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 263\u2013277. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-18275-4_19"},{"key":"26_CR45","doi-asserted-by":"crossref","unstructured":"Howar, F., Giannakopoulou, D., Rakamari\u0107, Z.: Hybrid learning: interface generation through static, dynamic, and symbolic analysis. In: Proceedings of the 2013 International Symposium on Software Testing and Analysis, ISSTA 2013, pp. 268\u2013279. ACM, New York (2013)","DOI":"10.1145\/2483760.2483783"},{"key":"26_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-45069-6_31","volume-title":"Computer Aided Verification","author":"H Hungar","year":"2003","unstructured":"Hungar, H., Niese, O., Steffen, B.: Domain-specific optimization in automata learning. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 315\u2013327. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-45069-6_31"},{"key":"26_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-38088-4_9","volume-title":"NASA Formal Methods","author":"M Isberner","year":"2013","unstructured":"Isberner, M., Howar, F., Steffen, B.: Inferring automata with state-local alphabet abstractions. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 124\u2013138. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-38088-4_9"},{"key":"26_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-21690-4_32","volume-title":"Computer Aided Verification","author":"M Isberner","year":"2015","unstructured":"Isberner, M., Howar, F., Steffen, B.: The open-source LearnLib. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 487\u2013495. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-21690-4_32"},{"issue":"1\u20132","key":"26_CR49","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10994-013-5419-7","volume":"96","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: Learning register automata: from languages to program structures. Mach. Learn. 96(1\u20132), 65\u201398 (2014)","journal-title":"Mach. Learn."},{"key":"26_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-11164-3_26","volume-title":"Runtime Verification","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 307\u2013322. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"26_CR51","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-11900-7_27","volume-title":"Simulation, Modeling, and Programming for Autonomous Robots","author":"A Khalili","year":"2014","unstructured":"Khalili, A., Natale, L., Tacchella, A.: Reverse engineering of middleware for verification of robot control architectures. In: Brugali, D., Broenink, J.F., Kroeger, T., MacDonald, B.A. (eds.) SIMPAR 2014. LNCS (LNAI), vol. 8810, pp. 315\u2013326. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-11900-7_27"},{"issue":"8","key":"26_CR52","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/5.533956","volume":"84","author":"D Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines \u2013 a survey. Proc. IEEE 84(8), 1090\u20131123 (1996)","journal-title":"Proc. IEEE"},{"key":"26_CR53","doi-asserted-by":"crossref","unstructured":"Margaria, T., Niese, O., Raffelt, H., Steffen, B.: Efficient test-based model generation for legacy reactive systems. In: Proceedings of the 2004 Ninth IEEE International High-Level Design Validation and Test Workshop, HLDVT 2004, Washington, DC, USA, pp. 95\u2013100. IEEE Computer Society (2004)","DOI":"10.1109\/HLDVT.2004.1431246"},{"issue":"2","key":"26_CR54","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s11334-005-0016-y","volume":"1","author":"T Margaria","year":"2005","unstructured":"Margaria, T., Raffelt, H., Steffen, B.: Knowledge-based relevance filtering for efficient system-level test-based model generation. Innov. Syst. Softw. Eng. 1(2), 147\u2013156 (2005)","journal-title":"Innov. Syst. Softw. Eng."},{"key":"26_CR55","doi-asserted-by":"crossref","unstructured":"Meinke, K., Sindhu, M.A.: LBTest: a learning-based testing tool for reactive systems. In: Sixth IEEE International Conference on Software Testing, Verification and Validation, ICST 2013, Luxembourg, Luxembourg, 18\u201322 March 2013, pp. 447\u2013454 (2013)","DOI":"10.1109\/ICST.2013.62"},{"issue":"3","key":"26_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-11(3:13)2015","volume":"11","author":"I-E Mens","year":"2015","unstructured":"Mens, I.-E., Maler, O.: Learning regular languages over large ordered alphabets. Log. Methods Comput. Sci. 11(3), 1\u201322 (2015)","journal-title":"Log. Methods Comput. Sci."},{"key":"26_CR57","doi-asserted-by":"crossref","unstructured":"Moerman, J., Sammartino, M., Silva, A., Klin, B., Szynwelski, M.: Learning nominal automata. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, 18\u201320 January 2017, Paris, France, pp. 613\u2013625. ACM (2017)","DOI":"10.1145\/3009837.3009879"},{"issue":"6","key":"26_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3011286.3011298","volume":"41","author":"Malte Mues","year":"2017","unstructured":"Mues, M., Howar, F., Luckow, K., Kahsai, T., Rakamaric, Z.: Releasing the PSYCO: using symbolic search in interface generation for Java. ACM SIGSOFT Softw. Eng. Notes 41(6), 1\u20135 (2016)","journal-title":"ACM SIGSOFT Software Engineering Notes"},{"issue":"3","key":"26_CR59","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5(3), 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"2","key":"26_CR60","first-page":"225","volume":"7","author":"D Peled","year":"2002","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. J. Automata Lang. Comb. 7(2), 225\u2013246 (2002)","journal-title":"J. Automata Lang. Comb."},{"issue":"4","key":"26_CR61","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10009-009-0120-7","volume":"11","author":"H Raffelt","year":"2009","unstructured":"Raffelt, H., Merten, M., Steffen, B., Margaria, T.: Dynamic testing via automata learning. STTT 11(4), 307\u2013324 (2009)","journal-title":"STTT"},{"key":"26_CR62","unstructured":"de Ruiter, J., Poll, E.: Protocol state fuzzing of TLS implementations. In: 24th USENIX Security Symposium (USENIX Security 2015), Washington, D.C., pp. 193\u2013206. USENIX Association, August 2015"},{"key":"26_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-33693-0_20","volume-title":"Integrated Formal Methods","author":"M Schuts","year":"2016","unstructured":"Schuts, M., Hooman, J., Vaandrager, F.: Refactoring of legacy software using model learning and equivalence checking: an industrial experience report. In: \u00c1brah\u00e1m, E., Huisman, M. (eds.) IFM 2016. LNCS, vol. 9681, pp. 311\u2013325. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-33693-0_20"},{"issue":"4","key":"26_CR64","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/stvr.1491","volume":"24","author":"M Shahbaz","year":"2014","unstructured":"Shahbaz, M., Groz, R.: Analysis and testing of black-box component-based systems by inferring partial models. Softw. Test. Verif. Reliab. 24(4), 253\u2013288 (2014)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"26_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-25423-4_5","volume-title":"Formal Methods and Software Engineering","author":"W Smeenk","year":"2015","unstructured":"Smeenk, W., Moerman, J., Vaandrager, F., Jansen, D.N.: Applying automata learning to embedded control software. In: Butler, M., Conchon, S., Za\u00efdi, F. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 67\u201383. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-25423-4_5"},{"key":"26_CR66","unstructured":"Smetsers, R., Moerman, J., Janssen, M., Verwer, S.: Complementing model learning with mutation-based fuzzing. CoRR, abs\/1611.02429 (2016)"},{"key":"26_CR67","doi-asserted-by":"crossref","unstructured":"Sun, J., Xiao, H., Liu, Y., Lin, S.W., Qin, S.: TLV: abstraction through testing, learning, and validation. In: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, ESEC\/FSE 2015, pp. 698\u2013709. ACM, New York (2015)","DOI":"10.1145\/2786805.2786817"},{"key":"26_CR68","unstructured":"Tretmans, J.: A formal approach to conformance testing. Ph.D. thesis, University of Twente, December 1992"},{"key":"26_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-21455-4_9","volume-title":"Formal Methods for Eternal Networked Software Systems","author":"J Tretmans","year":"2011","unstructured":"Tretmans, J.: Model-based testing and some steps towards test-based modelling. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol. 6659, pp. 297\u2013326. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-21455-4_9"},{"issue":"2","key":"26_CR70","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2967606","volume":"60","author":"FW Vaandrager","year":"2017","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86\u201395 (2017)","journal-title":"Commun. ACM"},{"key":"26_CR71","doi-asserted-by":"crossref","unstructured":"Veanes, M., Hooimeijer, P., Livshits, B., Molnar, D., Bj\u00f8rner, N.: Symbolic finite state transducers: algorithms and applications. In: POPL, pp. 137\u2013150. ACM (2012)","DOI":"10.1145\/2103621.2103674"},{"key":"26_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-45234-9_16","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"M Volpato","year":"2014","unstructured":"Volpato, M., Tretmans, J.: Active learning of nondeterministic systems from an ioco perspective. In: Margaria, T., Steffen, B. (eds.) ISoLA 2014. LNCS, vol. 8802, pp. 220\u2013235. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-662-45234-9_16"},{"key":"26_CR73","doi-asserted-by":"crossref","unstructured":"Windm\u00fcller, S., Neubauer, J., Steffen, B., Howar, F., Bauer, O.: Active continuous quality control. In: Proceedings of the 16th International ACM Sigsoft Symposium on Component-based Software Engineering, CBSE 2013, pp. 111\u2013120. ACM, New York (2013)","DOI":"10.1145\/2465449.2465469"},{"key":"26_CR74","doi-asserted-by":"crossref","unstructured":"Xue, Y., Wang, J., Liu, Y., Xiao, H., Sun, J., Chandramohan, M.: Detection and classification of malicious JavaScript via attack behavior modelling. In: Proceedings of the 2015 International Symposium on Software Testing and Analysis, ISSTA 2015, pp. 48\u201359. ACM, New York (2015)","DOI":"10.1145\/2771783.2771814"}],"container-title":["Lecture Notes in Computer Science","Computing and Software Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91908-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T20:03:05Z","timestamp":1570305785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91908-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783319919072","9783319919089"],"references-count":74,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91908-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}