{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T19:36:41Z","timestamp":1782416201923,"version":"3.54.5"},"publisher-location":"Cham","reference-count":146,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319965611","type":"print"},{"value":"9783319965628","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-96562-8_5","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T13:43:34Z","timestamp":1532094214000},"page":"123-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["Active Automata Learning in Practice"],"prefix":"10.1007","author":[{"given":"Falk","family":"Howar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,20]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Aadithya, K.V., Roychowdhury, J.: DAE2FSM: automatic generation of accurate discrete-time logical abstractions for continuous-time circuit dynamics. In: Proceedings of the 49th Annual Design Automation Conference, DAC 2012, pp. 311\u2013316. ACM, New York (2012)","DOI":"10.1145\/2228360.2228418"},{"key":"5_CR2","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). https:\/\/doi.org\/10.1007\/978-3-319-25150-9_11"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-32759-9_4","volume-title":"FM 2012: Formal Methods","author":"F Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.: Automata learning through counterexample guided abstraction refinement. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 10\u201327. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_4"},{"key":"5_CR4","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). https:\/\/doi.org\/10.1007\/978-3-642-32940-1_18"},{"key":"5_CR5","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). https:\/\/doi.org\/10.1007\/978-3-662-45234-9_15"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-16573-3_14","volume-title":"Testing Software and Systems","author":"F Aarts","year":"2010","unstructured":"Aarts, F., Jonsson, B., Uijen, J.: Generating models of infinite-state communication protocols using regular inference with abstraction. In: Petrenko, A., Sim\u00e3o, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol. 6435, pp. 188\u2013204. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16573-3_14"},{"issue":"1","key":"5_CR7","doi-asserted-by":"crossref","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.: 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":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-15375-4_6","volume-title":"CONCUR 2010 - Concurrency Theory","author":"F Aarts","year":"2010","unstructured":"Aarts, F., Vaandrager, F.: Learning I\/O automata. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 71\u201385. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_6"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-40648-0_21","volume-title":"NASA Formal Methods","author":"A Abel","year":"2016","unstructured":"Abel, A., Reineke, J.: Gray-box learning of serial compositions of mealy machines. In: Rayadurgam, S., Tkachuk, O. (eds.) NFM 2016. LNCS, vol. 9690, pp. 272\u2013287. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40648-0_21"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-24912-4_19","volume-title":"SDL 2015: Model-Driven Engineering for Smart Cities","author":"G Adamis","year":"2015","unstructured":"Adamis, G., Kov\u00e1cs, G., R\u00e9thy, G.: Generating performance test model from conformance test logs. In: Fischer, J., Scheidgen, M., Schieferdecker, I., Reed, R. (eds.) SDL 2015. LNCS, vol. 9369, pp. 268\u2013284. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24912-4_19"},{"key":"5_CR11","series-title":"LNCS","first-page":"74","volume-title":"ML for Dynamic Software Analysis","author":"BK Aichernig","year":"2018","unstructured":"Aichernig, B.K., Mostowski, W., Mousavi, M.R., Tappler, M., Taromirad, M.: Model learning and model-based testing. In: Bennaceur, A., H\u00e4hnle, R., Meinke, K. (eds.) ML for Dynamic Software Analysis. LNCS, vol. 11026, pp. 74\u2013100. Springer, Cham (2018)"},{"key":"5_CR12","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). https:\/\/doi.org\/10.1007\/3-540-45923-5_6"},{"issue":"2","key":"5_CR13","doi-asserted-by":"crossref","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":"5_CR14","unstructured":"Angluin, D., Eisenstat, S., Fisman, D.: Learning regular languages via alternating automata. In: Proceedings of the 24th International Conference on Artificial Intelligence, IJCAI 2015, pp. 3308\u20133314. AAAI Press (2015)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Argyros, G., Stais, I., Jana, S., Keromytis, A.D., Kiayias, A.: SFADiff: automated evasion attacks and fingerprinting using black-box differential automata learning. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS 2016, pp. 1690\u20131701. ACM, New York (2016)","DOI":"10.1145\/2976749.2978383"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/978-3-319-47169-3_51","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications","author":"A Bainczyk","year":"2016","unstructured":"Bainczyk, A., Schieweck, A., Isberner, M., Margaria, T., Neubauer, J., Steffen, B.: ALEX: mixed-mode learning of web applications at ease. In: Margaria, T., Steffen, B. (eds.) ISoLA 2016. LNCS, vol. 9953, pp. 655\u2013671. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47169-3_51"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-1-4613-3394-4_2","volume-title":"Advances in Algorithms, Languages, and Complexity","author":"JL Balc\u00e1zar","year":"1997","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gavald\u00e0, R., Watanabe, O.: Algorithms for learning finite automata from queries: a unified view. In: Du, D.Z., Ko, K.I. (eds.) Advances in Algorithms, Languages, and Complexity, pp. 53\u201372. Springer, Boston (1997). https:\/\/doi.org\/10.1007\/978-1-4613-3394-4_2"},{"issue":"6","key":"5_CR18","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/2813885.2737952","volume":"50","author":"DW Barowy","year":"2015","unstructured":"Barowy, D.W., Gulwani, S., Hart, T., Zorn, B.: FlashRelate: extracting relational data from semi-structured spreadsheets using examples. SIGPLAN Not. 50(6), 218\u2013228 (2015)","journal-title":"SIGPLAN Not."},{"key":"5_CR19","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). https:\/\/doi.org\/10.1007\/978-3-540-31984-9_14"},{"issue":"88","key":"5_CR20","first-page":"28","volume":"2012","author":"A Bertolino","year":"2012","unstructured":"Bertolino, A., Calabr\u00f2, A., Merten, M., Steffen, B.: Never-stop learning: continuous validation of learned models for evolving systems through monitoring. ERCIM News 2012(88), 28\u201329 (2012)","journal-title":"ERCIM News"},{"issue":"C","key":"5_CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ic.2015.11.005","volume":"246","author":"J Bj\u00f6rklund","year":"2016","unstructured":"Bj\u00f6rklund, J., Fernau, H., Kasprzik, A.: Polynomial inference of universal automata from membership and equivalence queries. Inf. Comput. 246(C), 3\u201319 (2016)","journal-title":"Inf. Comput."},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-540-71209-1_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Bollig","year":"2007","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M.: Replaying play in and play out: synthesis of design models from scenarios by learning. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 435\u2013450. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_33"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-85361-9_15","volume-title":"CONCUR 2008 - Concurrency Theory","author":"B Bollig","year":"2008","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M.: Smyle: a tool for synthesizing distributed models from scenarios by learning. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 162\u2013166. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_15"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-14295-6_32","volume-title":"Computer Aided Verification","author":"B Bollig","year":"2010","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M., Neider, D., Piegdon, D.R.: Libalf: the automata learning framework. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 360\u2013364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_32"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-33693-0_19","volume-title":"Integrated Formal Methods","author":"P Bos van den","year":"2016","unstructured":"van den Bos, P., Smetsers, R., Vaandrager, F.: Enhancing automata learning by log-based metrics. In: \u00c1brah\u00e1m, E., Huisman, M. (eds.) IFM 2016. LNCS, vol. 9681, pp. 295\u2013310. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33693-0_19"},{"key":"5_CR26","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\/2429069.2429123"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b137241","volume-title":"Model-Based Testing of Reactive Systems","year":"2005","unstructured":"Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol. 3472. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/b137241"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-21254-3_14","volume-title":"Language and Automata Theory and Applications","author":"J Case","year":"2011","unstructured":"Case, J., Jain, S., Le, T.D., Ong, Y.S., Semukhin, P., Stephan, F.: Automatic learning of subclasses of pattern languages. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 192\u2013203. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_14"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-21875-0_4","volume-title":"Models of Computation in Context","author":"J Case","year":"2011","unstructured":"Case, J., Jain, S., Ong, Y.S., Semukhin, P., Stephan, F.: Automatic learners with feedback queries. In: L\u00f6we, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol. 6735, pp. 31\u201340. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21875-0_4"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-319-96562-8_6","volume-title":"ML for Dynamic Software Analysis","author":"S Cassel","year":"2018","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Extending automata learning to extended finite state machines. In: Bennaceur, A., Hahnle, R., Meinke, K. (eds.) ML for Dynamic Software Analysis. LNCS, vol. 11026, pp. 149\u2013177. Springer, Cham (2018)"},{"issue":"2","key":"5_CR31","doi-asserted-by":"crossref","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":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-33386-6_6","volume-title":"Automated Technology for Verification and Analysis","author":"S Cassel","year":"2012","unstructured":"Cassel, S., Jonsson, B., Howar, F., Steffen, B.: A succinct canonical register automaton model for data domains with binary relations. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 57\u201371. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33386-6_6"},{"issue":"2","key":"5_CR33","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s11334-011-0148-1","volume":"7","author":"S Chaki","year":"2011","unstructured":"Chaki, S., Gurfinkel, A.: Automated assume-guarantee reasoning for omega-regular systems and specifications. Innov. Syst. Softw. Eng. 7(2), 131\u2013139 (2011)","journal-title":"Innov. Syst. Softw. Eng."},{"key":"5_CR34","unstructured":"Chalupar, G., Peherstorfer, S., Poll, E., De Ruiter, J.: Automated reverse engineering using lego\u00ae. In: Proceedings of the 8th USENIX Conference on Offensive Technologies, WOOT 2014, p. 9. USENIX Association, Berkeley (2014)"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Chen, Y.F., Hsieh, C., Leng\u00e1l, O., Lii, T.J., Tsai, M.H., Wang, B.Y., Wang, F.: PAC learning-based verification and model synthesis. In: Proceedings of the 38th International Conference on Software Engineering, ICSE 2016, pp. 714\u2013724. ACM, New York (2016)","DOI":"10.1145\/2884781.2884860"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-31424-7_10","volume-title":"Computer Aided Verification","author":"Y-F Chen","year":"2012","unstructured":"Chen, Y.-F., Wang, B.-Y.: Learning Boolean functions incrementally. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 55\u201370. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_10"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-24372-1_12","volume-title":"Automated Technology for Verification and Analysis","author":"C-H Cheng","year":"2011","unstructured":"Cheng, C.-H., et al.: Algorithms for synthesizing priorities in component-based systems. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 150\u2013167. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_12"},{"key":"5_CR38","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, p. 10. USENIX Association, Berkeley (2011)"},{"key":"5_CR39","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":"5_CR40","doi-asserted-by":"crossref","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."},{"issue":"3","key":"5_CR41","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"4","author":"TS Chow","year":"1978","unstructured":"Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. Softw. Eng. 4(3), 178\u2013187 (1978)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"5_CR42","volume-title":"Model Checking","author":"EM Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"5_CR43","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., P\u0102s\u0102reanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331\u2013346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_24"},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-14684-8_15","volume-title":"Finite-State Methods and Natural Language Processing","author":"D Combe","year":"2010","unstructured":"Combe, D., de la Higuera, C., Janodet, J.-C.: Zulu: an interactive learning competition. In: Yli-Jyr\u00e4, A., Kornai, A., Sakarovitch, J., Watson, B. (eds.) FSMNLP 2009. LNCS (LNAI), vol. 6062, pp. 139\u2013146. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14684-8_15"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Comb\u00e9fis, S., Giannakopoulou, D., Pecheur, C., Feary, M.: Learning system abstractions for human operators. In: Proceedings of the International Workshop on Machine Learning Technologies in Software Engineering, MALETS 2011, pp. 3\u201310. ACM, New York (2011)","DOI":"10.1145\/2070821.2070822"},{"key":"5_CR46","unstructured":"De Ruiter, J., Poll, E.: Protocol state fuzzing of TLS implementations. In: Proceedings of the 24th USENIX Conference on Security Symposium, SEC 2015, pp. 193\u2013206. USENIX Association, Berkeley (2015)"},{"key":"5_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-319-07734-5_8","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"N Decker","year":"2014","unstructured":"Decker, N., Habermehl, P., Leucker, M., Thoma, D.: Learning transparent data automata. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 130\u2013149. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07734-5_8"},{"issue":"4","key":"5_CR48","doi-asserted-by":"crossref","first-page":"339","DOI":"10.3233\/FUN-2002-51402","volume":"51","author":"F Denis","year":"2002","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. Fundam. Informaticae 51(4), 339\u2013368 (2002)","journal-title":"Fundam. Informaticae"},{"key":"5_CR49","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., et al. (eds.) ABZ 2012. LNCS, vol. 7316, pp. 361\u2013364. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30885-7_32"},{"key":"5_CR50","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). https:\/\/doi.org\/10.1007\/978-3-642-34026-0_40"},{"key":"5_CR51","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). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_10"},{"issue":"3\u20134","key":"5_CR52","doi-asserted-by":"crossref","first-page":"205","DOI":"10.3233\/FI-2011-607","volume":"113","author":"J Esparza","year":"2011","unstructured":"Esparza, J., Leucker, M., Schlund, M.: Learning workflow petri nets. Fundam. Informaticae 113(3\u20134), 205\u2013228 (2011)","journal-title":"Fundam. Informaticae"},{"key":"5_CR53","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). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_40"},{"key":"5_CR54","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). https:\/\/doi.org\/10.1007\/978-3-642-19811-3_2"},{"key":"5_CR55","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). https:\/\/doi.org\/10.1007\/978-3-319-67113-0_12"},{"key":"5_CR56","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). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_25"},{"issue":"6","key":"5_CR57","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/32.87284","volume":"17","author":"S Fujiwara","year":"1991","unstructured":"Fujiwara, S., von Bochmann, G., Khendek, F., Amalou, M., Ghedamsi, A.: Test selection based on finite state models. IEEE Trans. Softw. Eng. 17(6), 591\u2013603 (1991)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"5_CR58","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.tcs.2012.04.042","volume":"448","author":"P Garc\u00eda","year":"2012","unstructured":"Garc\u00eda, P., L\u00f3pez, D., De Parga, M.V.: Polynomial characteristic sets for DFA identification. Theor. Comput. Sci. 448, 41\u201346 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/978-3-642-39799-8_57","volume-title":"Computer Aided Verification","author":"P Garg","year":"2013","unstructured":"Garg, P., L\u00f6ding, C., Madhusudan, P., Neider, D.: Learning\u00a0universally\u00a0quantified\u00a0invariants of linear\u00a0data\u00a0structures. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 813\u2013829. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_57"},{"key":"5_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-08867-9_5","volume-title":"Computer Aided Verification","author":"P Garg","year":"2014","unstructured":"Garg, P., L\u00f6ding, C., Madhusudan, P., Neider, D.: ICE:\u00a0a\u00a0robust\u00a0framework\u00a0for\u00a0learning\u00a0invariants. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 69\u201387. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_5"},{"key":"5_CR61","doi-asserted-by":"crossref","unstructured":"Garg, P., Neider, D., Madhusudan, P., Roth, D.: Learning invariants using decision trees and implication counterexamples. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, pp. 499\u2013512. ACM, New York (2016)","DOI":"10.1145\/2837614.2837664"},{"key":"5_CR62","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). https:\/\/doi.org\/10.1007\/978-3-642-33125-1_18"},{"issue":"5","key":"5_CR63","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967)","journal-title":"Inf. Control"},{"key":"5_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-34026-0_33","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"R Groz","year":"2012","unstructured":"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. LNCS, vol. 7609, pp. 444\u2013457. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34026-0_33"},{"key":"5_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/978-3-319-96562-8_7","volume-title":"ML for Dynamic Software Analysis","author":"R Groz","year":"2018","unstructured":"Groz, R., Simao, A., Petrenko, A., Oriat, C.: Inferring FSM models of systems without reset. In: Bennaceur, A., Hahnle, R., Meinke, K. (eds.) ML for Dynamic Software Analysis. LNCS, vol. 11026, pp. 178\u2013201. Springer, Cham (2018)"},{"key":"5_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-25945-1_10","volume-title":"Testing Software and Systems","author":"R Groz","year":"2015","unstructured":"Groz, R., Simao, A., Petrenko, A., Oriat, C.: Inferring finite state machines without reset using state identification sequences. In: El-Fakih, K., Barlas, G., Yevtushenko, N. (eds.) ICTSS 2015. LNCS, vol. 9447, pp. 161\u2013177. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25945-1_10"},{"key":"5_CR67","doi-asserted-by":"crossref","unstructured":"Gu, C., Roychowdhury, J.: FSM model abstraction for analog\/mixed-signal circuits by learning from I\/O trajectories. In: Proceedings of the 16th Asia and South Pacific Design Automation Conference, ASPDAC 2011, pp. 7\u201312. IEEE Press, Piscataway (2011)","DOI":"10.1109\/ASPDAC.2011.5722281"},{"key":"5_CR68","doi-asserted-by":"crossref","unstructured":"Gulwani, S.: Automating string processing in spreadsheets using input-output examples. In: Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, pp. 317\u2013330. ACM, New York (2011)","DOI":"10.1145\/1926385.1926423"},{"key":"5_CR69","first-page":"1033","volume":"55","author":"A Hagerer","year":"2001","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. 55, 1033\u20131040 (2001)","journal-title":"Ann. Rev. Commun."},{"key":"5_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-3-319-96562-8_8","volume-title":"ML for Dynamic Software Analysis","author":"R H\u00e4hnle","year":"2018","unstructured":"H\u00e4hnle, R., Steffen, B.: Constraint-based behavioral consistency of evolving software systems. In: Bennaceur, A., Hahnle, R., Meinke, K. (eds.) ML for Dynamic Software Analysis. LNCS, vol. 11026, pp. 205\u2013218. Springer, Cham (2018)"},{"issue":"1","key":"5_CR71","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s10009-004-0139-8","volume":"6","author":"H Hungar","year":"2004","unstructured":"Hungar, H., Steffen, B.: Behavior-based model construction. Int. J. Softw. Tools Technol. Transf. 6(1), 4\u201314 (2004)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"5_CR72","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). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_31"},{"issue":"3","key":"5_CR73","first-page":"21:1","volume":"25","author":"F He","year":"2016","unstructured":"He, F., Gao, X., Wang, M., Wang, B.Y., Zhang, L.: Learning weighted assumptions for compositional verification of Markov decision processes. ACM Trans. Softw. Eng. Methodol. 25(3), 21:1\u201321:39 (2016)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"5_CR74","doi-asserted-by":"crossref","unstructured":"He, F., Wang, B.Y., Yin, L., Zhu, L.: Symbolic assume-guarantee reasoning through BDD learning. In: Proceedings of the 36th International Conference on Software Engineering, ICSE 2014, pp. 1071\u20131082. ACM, New York (2014)","DOI":"10.1145\/2568225.2568253"},{"issue":"10","key":"5_CR75","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"issue":"2","key":"5_CR76","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1017\/S1351324911000064","volume":"17","author":"J H\u00f6gberg","year":"2011","unstructured":"H\u00f6gberg, J.: A randomised inference algorithm for regular tree languages. Nat. Lang. Eng. 17(2), 203\u2013219 (2011)","journal-title":"Nat. Lang. Eng."},{"key":"5_CR77","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-34781-8_18","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F Howar","year":"2012","unstructured":"Howar, F., Bauer, O., Merten, M., Steffen, B., Margaria, T.: The teachers\u2019 crowd: the impact of distributed oracles on active automata learning. In: H\u00e4hnle, R., Knoop, J., Margaria, T., Schreiner, D., Steffen, B. (eds.) ISoLA 2011. CCIS, pp. 232\u2013247. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34781-8_18"},{"key":"5_CR78","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":"5_CR79","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). https:\/\/doi.org\/10.1007\/978-3-642-34026-0_41"},{"issue":"3","key":"5_CR80","doi-asserted-by":"crossref","first-page":"71","DOI":"10.3233\/jid-2013-0022","volume":"17","author":"F Howar","year":"2013","unstructured":"Howar, F., Margaria, T., Wagner, C.: Simplifying translation validation via model extrapolation. J. Integr. Des. Process Sci. 17(3), 71\u201391 (2013)","journal-title":"J. Integr. Des. Process Sci."},{"key":"5_CR81","doi-asserted-by":"crossref","unstructured":"Howar, F., Merten, M., Steffen, B., Margaria, T.: Practical aspects of active automata learning, pp. 235\u2013267. John Wiley and Sons, Inc. (2012)","DOI":"10.1002\/9781118459898.ch11"},{"key":"5_CR82","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). https:\/\/doi.org\/10.1007\/978-3-642-27940-9_17"},{"key":"5_CR83","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-642-16558-0_55","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F Howar","year":"2010","unstructured":"Howar, F., Steffen, B., Merten, M.: From ZULU to RERS. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6415, pp. 687\u2013704. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16558-0_55"},{"key":"5_CR84","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). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_19"},{"issue":"3","key":"5_CR85","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1016\/j.asoc.2011.11.024","volume":"12","author":"D Hrn\u010di\u010d","year":"2012","unstructured":"Hrn\u010di\u010d, D., Mernik, M., Bryant, B.R., Javed, F.: A memetic grammar inference algorithm for language learning. Appl. Soft Comput. 12(3), 1006\u20131020 (2012)","journal-title":"Appl. Soft Comput."},{"key":"5_CR86","doi-asserted-by":"crossref","unstructured":"Hungar, H., Margaria, T., Steffen, B.: Test-based model generation for legacy systems. In: 2003 Proceedings of the International Test Conference, ITC 2003, vol. 1, pp. 971\u2013980, 30 September\u20132 October 2003","DOI":"10.1109\/TEST.2003.1271084"},{"issue":"1","key":"5_CR87","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.jcss.2011.04.002","volume":"78","author":"F Ipate","year":"2012","unstructured":"Ipate, F.: Learning finite cover automata from queries. J. Comput. Syst. Sci. 78(1), 221\u2013244 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR88","unstructured":"Isberner, M.: Foundations of active automata learning: an algorithmic perspective. Ph.D. thesis (2015)"},{"key":"5_CR89","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). https:\/\/doi.org\/10.1007\/978-3-642-38088-4_9"},{"key":"5_CR90","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). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"5_CR91","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). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_32"},{"issue":"6","key":"5_CR92","doi-asserted-by":"crossref","first-page":"1910","DOI":"10.1016\/j.jcss.2011.12.011","volume":"78","author":"S Jain","year":"2012","unstructured":"Jain, S., Luo, Q., Stephan, F.: Learnability of automatic classes. J. Comput. Syst. Sci. 78(6), 1910\u20131927 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR93","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-24412-4_8","volume-title":"Algorithmic Learning Theory","author":"S Jain","year":"2011","unstructured":"Jain, S., Martin, E., Stephan, F.: Robust learning of automatic classes of languages. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS (LNAI), vol. 6925, pp. 55\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24412-4_8"},{"key":"5_CR94","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-19835-9_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Jung","year":"2011","unstructured":"Jung, Y., Lee, W., Wang, B.-Y., Yi, K.: Predicate generation for learning-based quantifier-free loop invariant inference. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 205\u2013219. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19835-9_17"},{"key":"5_CR95","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-22321-1_45","volume-title":"Developments in Language Theory","author":"A Kasprzik","year":"2011","unstructured":"Kasprzik, A.: Inference of residual finite-state tree automata from membership queries and finite positive data. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 476\u2013477. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22321-1_45"},{"key":"5_CR96","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"MJ Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"5_CR97","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). https:\/\/doi.org\/10.1007\/978-3-319-11900-7_27"},{"key":"5_CR98","unstructured":"Khalili, A., Tacchella, A.: Learning nondeterministic mealy machines. In: Proceedings of the 12th International Conference on Grammatical Inference, ICGI 2014, Kyoto, Japan, 17\u201319 September 2014, pp. 109\u2013123 (2014)"},{"key":"5_CR99","doi-asserted-by":"crossref","unstructured":"Komuravelli, A., Pasareanu, C.S., Clarke, E.M.: Learning probabilistic systems from tree samples. In: Proceedings of the 2012 27th Annual IEEE\/ACM Symposium on Logic in Computer Science, LICS 2012, pp. 441\u2013450. IEEE Computer Society, Washington, DC (2012)","DOI":"10.1109\/LICS.2012.54"},{"key":"5_CR100","unstructured":"Konev, B., Lutz, C., Ozaki, A., Wolter, F.: Exact learning of lightweight description logic ontologies. In: Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, KR 2014, pp. 298\u2013307. AAAI Press (2014)"},{"key":"5_CR101","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-12002-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Kwiatkowska","year":"2010","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Qu, H.: Assume-guarantee verification for probabilistic systems. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 23\u201337. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_3"},{"key":"5_CR102","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-34026-0_39","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"M Leucker","year":"2012","unstructured":"Leucker, M., Neider, D.: Learning minimal deterministic automata from inexperienced teachers. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7609, pp. 524\u2013538. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34026-0_39"},{"key":"5_CR103","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-24372-1_35","volume-title":"Automated Technology for Verification and Analysis","author":"S-W Lin","year":"2011","unstructured":"Lin, S.-W., Andr\u00e9, \u00c9., Dong, J.S., Sun, J., Liu, Y.: An efficient algorithm for learning event-recording automata. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 463\u2013472. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_35"},{"key":"5_CR104","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-319-06410-9_29","volume-title":"FM 2014: Formal Methods","author":"S-W Lin","year":"2014","unstructured":"Lin, S.-W., Hsiung, P.-A.: Compositional synthesis of concurrent systems through causal model checking and learning. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 416\u2013431. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06410-9_29"},{"key":"5_CR105","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-63121-9_8","volume-title":"Models, Algorithms, Logics and Tools","author":"O Maler","year":"2017","unstructured":"Maler, O., Mens, I.-E.: A generic algorithm for learning symbolic automata from membership queries. In: Aceto, L., Bacci, G., Bacci, G., Ing\u00f3lfsd\u00f3ttir, A., Legay, A., Mardare, R. (eds.) Models, Algorithms, Logics and Tools. LNCS, vol. 10460, pp. 146\u2013169. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63121-9_8"},{"issue":"2","key":"5_CR106","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10994-016-5565-9","volume":"105","author":"H Mao","year":"2016","unstructured":"Mao, H., Chen, Y., Jaeger, M., Nielsen, T.D., Larsen, K.G., Nielsen, B.: Learning deterministic probabilistic automata from a model checking perspective. Mach. Learn. 105(2), 255\u2013299 (2016)","journal-title":"Mach. Learn."},{"key":"5_CR107","doi-asserted-by":"crossref","unstructured":"Margaria, T., Niese, O., Raffelt, H., Steffen, B.: Efficient test-based model generation for legacy reactive systems. In: 2004 Ninth IEEE International Proceedings of the High-Level Design Validation and Test Workshop, HLDVT 2004, pp. 95\u2013100. IEEE Computer Society, Washington, DC (2004)","DOI":"10.1109\/HLDVT.2004.1431246"},{"key":"5_CR108","doi-asserted-by":"crossref","unstructured":"Medhat, R., Ramesh, S., Bonakdarpour, B., Fischmeister, S.: A framework for mining hybrid automata from input\/output traces. In: Proceedings of the 12th International Conference on Embedded Software, EMSOFT 2015, pp. 177\u2013186. IEEE Press, Piscataway (2015)","DOI":"10.1109\/EMSOFT.2015.7318273"},{"key":"5_CR109","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-319-96562-8_2","volume-title":"ML for Dynamic Software Analysis","author":"K Meinke","year":"2018","unstructured":"Meinke, K.: Learning-based testing: recent progress and future prospects. In: Bennaceur, A., Hahnle, R., Meinke, K. (eds.) ML for Dynamic Software Analysis. LNCS, vol. 11026, pp. 53\u201373. Springer, Cham (2018)"},{"key":"5_CR110","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-21768-5_11","volume-title":"Tests and Proofs","author":"K Meinke","year":"2011","unstructured":"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\u2013151. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21768-5_11"},{"key":"5_CR111","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, 18\u201322 March 2013, pp. 447\u2013454 (2013)","DOI":"10.1109\/ICST.2013.62"},{"key":"5_CR112","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-28934-2_15","volume-title":"Formal Aspects of Component Software","author":"Y Meller","year":"2016","unstructured":"Meller, Y., Grumberg, O., Yorav, K.: Learning-based compositional model checking of behavioral UML systems. In: Braga, C., \u00d6lveczky, P.C. (eds.) FACS 2015. LNCS, vol. 9539, pp. 275\u2013293. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-28934-2_15"},{"issue":"3","key":"5_CR113","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-11(3:13)2015","volume":"11","author":"I Mens","year":"2015","unstructured":"Mens, I., 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":"5_CR114","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-28756-5_32","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Merten","year":"2012","unstructured":"Merten, M., Howar, F., Steffen, B., Cassel, S., Jonsson, B.: Demonstrating learning of register automata. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 466\u2013471. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28756-5_32"},{"key":"5_CR115","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-34026-0_7","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"M Merten","year":"2012","unstructured":"Merten, M., Howar, F., Steffen, B., Pellicione, P., Tivoli, M.: Automated inference of models for black box systems based on interface descriptions. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7609, pp. 79\u201396. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34026-0_7"},{"key":"5_CR116","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-19835-9_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Merten","year":"2011","unstructured":"Merten, M., Steffen, B., Howar, F., Margaria, T.: Next generation LearnLib. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 220\u2013223. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19835-9_18"},{"key":"5_CR117","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-73066-8_22","volume-title":"Testing of Software and Communicating Systems","author":"M Shahbaz","year":"2007","unstructured":"Shahbaz, M., Li, K., Groz, R.: Learning and integration of parameterized components through testing. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds.) FATES\/TestCom -2007. LNCS, vol. 4581, pp. 319\u2013334. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73066-8_22"},{"key":"5_CR118","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-24372-1_22","volume-title":"Automated Technology for Verification and Analysis","author":"D Neider","year":"2011","unstructured":"Neider, D.: Small strategies for safety games. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 306\u2013320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_22"},{"key":"5_CR119","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-662-49674-9_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Neider","year":"2016","unstructured":"Neider, D., Topcu, U.: An automaton learning approach to solving safety games over infinite graphs. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 204\u2013221. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_12"},{"issue":"4","key":"5_CR120","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proc. Am. Math. Soc. 9(4), 541\u2013544 (1958)","journal-title":"Proc. Am. Math. Soc."},{"key":"5_CR121","doi-asserted-by":"crossref","unstructured":"Neubauer, J., Steffen, B., Bauer, O., Windm\u00fcller, S., Merten, M., Margaria, T., Howar, F.: Automated continuous quality assurance. In: Proceedings of the First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches, FormSERA 2012, pp. 37\u201343. IEEE Press, Piscataway (2012)","DOI":"10.1109\/FormSERA.2012.6229787"},{"issue":"5","key":"5_CR122","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s10009-014-0321-6","volume":"16","author":"J Neubauer","year":"2014","unstructured":"Neubauer, J., Windm\u00fcller, S., Steffen, B.: Risk-based testing via active continuous quality control. Int. J. Softw. Tools Technol. Transf. 16(5), 569\u2013591 (2014)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"2","key":"5_CR123","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1006\/inco.1995.1070","volume":"118","author":"O Maler","year":"1995","unstructured":"Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Inf. Comput. 118(2), 316\u2013326 (1995)","journal-title":"Inf. Comput."},{"key":"5_CR124","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/11817949_29","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"O Grinchtein","year":"2006","unstructured":"Grinchtein, O., Jonsson, B., Pettersson, P.: Inference of event-recording automata using timed decision trees. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 435\u2013449. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817949_29"},{"issue":"3","key":"5_CR125","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10703-008-0049-6","volume":"32","author":"CS Pasareanu","year":"2008","unstructured":"Pasareanu, C.S., Giannakopoulou, D., Bobaru, M.G., Cobleigh, J.M., Barringer, H.: Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning. Formal Methods Syst. Des. 32(3), 175\u2013205 (2008)","journal-title":"Formal Methods Syst. Des."},{"key":"5_CR126","series-title":"Classics Series","volume-title":"The Logic of Scientific Discovery","author":"K Popper","year":"2002","unstructured":"Popper, K.: The Logic of Scientific Discovery. Classics Series. Routledge, Abingdon (2002)"},{"key":"5_CR127","doi-asserted-by":"crossref","unstructured":"Raffelt, H., Margaria, T., Steffen, B., Merten, M.: Hybrid test of web applications with webtest. In: Proceedings of the 2008 Workshop on Testing, Analysis, and Verification of Web Services and Applications, TAV-WEB 2008, pp. 1\u20137. ACM, New York (2008)","DOI":"10.1145\/1390832.1390833"},{"issue":"4","key":"5_CR128","doi-asserted-by":"crossref","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. Int. J. Softw. Tools Technol. Transf. 11(4), 307\u2013324 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"5","key":"5_CR129","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10009-009-0111-8","volume":"11","author":"H Raffelt","year":"2009","unstructured":"Raffelt, H., Steffen, B., Berg, T., Margaria, T.: LearnLib: a framework for extrapolating behavioral models. Int. J. Softw. Tools Technol. Transf. 11(5), 393\u2013407 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"2","key":"5_CR130","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"RL Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Inf. Comput. 103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"5_CR131","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). https:\/\/doi.org\/10.1007\/978-3-319-33693-0_20"},{"key":"5_CR132","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05089-3_14","volume-title":"FM 2009: Formal Methods","author":"M Shahbaz","year":"2009","unstructured":"Shahbaz, M., Groz, R.: Inferring mealy machines. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 207\u2013222. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05089-3_14"},{"issue":"4","key":"5_CR133","doi-asserted-by":"crossref","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":"5_CR134","unstructured":"Cassel, S., Howar, F., Jonsson, B.: RALib: a LearnLib extension for inferring EFSMs. In: DIFTS 2015 at FMCAD 2015 (2015)"},{"key":"5_CR135","doi-asserted-by":"crossref","unstructured":"Staworko, S., Wieczorek, P.: Learning twig and path queries. In: Proceedings of the 15th International Conference on Database Theory, ICDT 2012, pp. 140\u2013154. ACM, New York (2012)","DOI":"10.1145\/2274576.2274592"},{"key":"5_CR136","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":"5_CR137","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11693017_10","volume-title":"Fundamental Approaches to Software Engineering","author":"T Berg","year":"2006","unstructured":"Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines with parameters. In: Baresi, L., Heckel, R. (eds.) FASE 2006. LNCS, vol. 3922, pp. 107\u2013121. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693017_10"},{"key":"5_CR138","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). https:\/\/doi.org\/10.1007\/978-3-540-78743-3_24"},{"key":"5_CR139","doi-asserted-by":"crossref","unstructured":"Bohlin, T., Jonsson, B.: Regular inference for communication protocol entities. Technical report. Department of Information Technology, Uppsala University, Schweden (2009)","DOI":"10.1007\/978-3-642-16558-0_53"},{"issue":"2","key":"5_CR140","doi-asserted-by":"crossref","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":"5_CR141","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). https:\/\/doi.org\/10.1007\/978-3-662-45234-9_16"},{"key":"5_CR142","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-24580-0_15","volume-title":"Testing Software and Systems","author":"N Walkinshaw","year":"2011","unstructured":"Walkinshaw, N.: Assessing test adequacy for black-box systems without specifications. In: Wolff, B., Za\u00efdi, F. (eds.) ICTSS 2011. LNCS, vol. 7019, pp. 209\u2013224. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24580-0_15"},{"issue":"3","key":"5_CR143","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1007\/s10664-015-9367-7","volume":"21","author":"N Walkinshaw","year":"2016","unstructured":"Walkinshaw, N., Taylor, R., Derrick, J.: Inferring extended finite state machine models from software executions. Empirical Softw. Engg. 21(3), 811\u2013853 (2016)","journal-title":"Empirical Softw. Engg."},{"key":"5_CR144","doi-asserted-by":"crossref","unstructured":"Wang, X., Gulwani, S., Singh, R.: FIDEX: filtering spreadsheet data using examples. In: Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2016, pp. 195\u2013213. ACM, New York (2016)","DOI":"10.1145\/2983990.2984030"},{"key":"5_CR145","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":"5_CR146","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","Machine Learning for Dynamic Software Analysis: Potentials and Limits"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96562-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T22:48:03Z","timestamp":1751755683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96562-8_5"}},"subtitle":["An Annotated Bibliography of the Years 2011 to 2016"],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319965611","9783319965628"],"references-count":146,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96562-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}