{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:15:40Z","timestamp":1743009340575,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030913830"},{"type":"electronic","value":"9783030913847"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91384-7_9","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T13:03:12Z","timestamp":1638450192000},"page":"164-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Never-Stop Context-Free Learning"],"prefix":"10.1007","author":[{"given":"Markus","family":"Frohme","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"9_CR1","unstructured":"Aarts, F., et al.: Establishing basis for learning algorithms. Technical report, CCSd\/HAL: e-articles server (based on gBUS) [http:\/\/hal.ccsd.cnrs.fr\/oai\/oai.php] (France), February 2010. http:\/\/hal.archives-ouvertes.fr\/inria-00464671\/en\/"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/11523468_89","volume-title":"Automata, Languages and Programming","author":"R Alur","year":"2005","unstructured":"Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for visibly pushdown languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1102\u20131114. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_89"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the 36th annual ACM Symposium on Theory of computing, pp. 202\u2013211. ACM (2004)","DOI":"10.1145\/1007352.1007390"},{"issue":"2","key":"9_CR4","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":"9_CR5","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-45260-4_2","volume-title":"Trustworthy Eternal Systems via Evolving Software, Data and Knowledge","author":"A Bennaceur","year":"2013","unstructured":"Bennaceur, A., et al.: Machine learning for emergent middleware. In: Moschitti, A., Plank, B. (eds.) EternalS 2012. CCIS, vol. 379, pp. 16\u201329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45260-4_2"},{"key":"9_CR6","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"},{"key":"9_CR7","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":"9_CR8","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"},{"issue":"88","key":"9_CR9","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"},{"key":"9_CR10","unstructured":"Bertolino, A., et al.:. Further development of learning techniques. Research report, February 2011"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b137241","volume-title":"Model-Based Testing of Reactive Systems","author":"M Broy","year":"2005","unstructured":"Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A.: Model-Based Testing of Reactive Systems. LNCS, vol. 3472. Springer, New York (2005). https:\/\/doi.org\/10.1007\/b137241"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/3-540-60246-1_148","volume-title":"Mathematical Foundations of Computer Science 1995","author":"O Burkart","year":"1995","unstructured":"Burkart, O., Caucal, D., Steffen, B.: An elementary bisimulation decision procedure for arbitrary context-free processes. In: Wiedermann, J., H\u00e1jek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 423\u2013433. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60246-1_148"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0084787","volume-title":"CONCUR \u201992","author":"O Burkart","year":"1992","unstructured":"Burkart, O., Steffen, B.: Model checking for context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 123\u2013137. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0084787"},{"issue":"2","key":"9_CR14","first-page":"89","volume":"2","author":"O Burkart","year":"1995","unstructured":"Burkart, O., Steffen, B.: Composition, decomposition and model checking of pushdown processes. Nordic J. Comput. 2(2), 89\u2013125 (1995)","journal-title":"Nordic J. Comput."},{"key":"9_CR15","unstructured":"Cassel, S., Howar, F., Jonsson, B.: RALib: a LearnLib extension for inferring EFSMs. DIFTS, p. 5 (2015)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-24372-1_26","volume-title":"Automated Technology for Verification and Analysis","author":"S Cassel","year":"2011","unstructured":"Cassel, S., Howar, F., Jonsson, B., Merten, M., Steffen, B.: A succinct canonical register automaton model. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 366\u2013380. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_26"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-319-10431-7_18","volume-title":"Software Engineering and Formal Methods","author":"S Cassel","year":"2014","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Learning extended finite state machines. In: Giannakopoulou, D., Sala\u00fcn, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 250\u2013264. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10431-7_18"},{"issue":"2","key":"9_CR18","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 Aspects Comput. 28(2), 233\u2013263 (2016). https:\/\/doi.org\/10.1007\/s00165-016-0355-5","journal-title":"Formal Aspects Comput."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-96562-8_6","volume-title":"Machine Learning for Dynamic Software Analysis: Potentials and Limits","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., H\u00e4hnle, R., Meinke, K. (eds.) Machine Learning for Dynamic Software Analysis: Potentials and Limits. LNCS, vol. 11026, pp. 149\u2013177. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96562-8_6"},{"key":"9_CR20","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"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-030-00244-2_10","volume-title":"Formal Methods for Industrial Critical Systems","author":"M Frohme","year":"2018","unstructured":"Frohme, M., Steffen, B.: Active mining of document type definitions. In: Howar, F., Barnat, J. (eds.) FMICS 2018. LNCS, vol. 11119, pp. 147\u2013161. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00244-2_10"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10009-021-00634-y","volume":"23","author":"M Frohme","year":"2021","unstructured":"Frohme, M., Steffen, B.: Compositional learning of mutually recursive procedural systems. Int. J. Softw. Tools Technol. Transfer. 23, 521\u2013543 (2021). https:\/\/doi.org\/10.1007\/s10009-021-00634-y","journal-title":"Int. J. Softw. Tools Technol. Transfer."},{"issue":"6","key":"9_CR23","doi-asserted-by":"publisher","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":"9_CR24","series-title":"Addison-Wesley series in computer science","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley series in computer science, 2nd edn. Addison-Wesley-Longman, Boston (2001)","edition":"2"},{"key":"9_CR25","unstructured":"Howar, F.: Active learning of interface programs. Ph.D. thesis, TU Dortmund University (2012)"},{"key":"9_CR26","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"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-16561-0_24","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F Howar","year":"2010","unstructured":"Howar, F., Jonsson, B., Merten, M., Steffen, B., Cassel, S.: On handling data in automata learning - Considerations from the CONNECT perspective. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6416, pp. 221\u2013235. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16561-0_24"},{"key":"9_CR28","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":"9_CR29","unstructured":"Isberner, M.: Foundations of active automata learning: an algorithmic perspective. Ph.D. thesis, Technical University Dortmund, Germany (2015)"},{"issue":"1","key":"9_CR30","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), 65\u201398 (2014). https:\/\/doi.org\/10.1007\/s10994-013-5419-7","journal-title":"Mach. Learn."},{"key":"9_CR31","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":"9_CR32","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 - A framework for active automata learning. 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"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Issarny, V., et al.: CONNECT challenges: towards emergent connectors for eternal networked systems. In: ICECCS, pp. 154\u2013161. IEEE Computer Society, June 2009","DOI":"10.1109\/ICECCS.2009.44"},{"key":"9_CR34","doi-asserted-by":"publisher","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":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/11817949_14","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"V Kumar","year":"2006","unstructured":"Kumar, V., Madhusudan, P., Viswanathan, M.: Minimization, learning, and conformance testing of Boolean programs. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 203\u2013217. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817949_14"},{"key":"9_CR36","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":"9_CR37","first-page":"129","volume":"34","author":"EF Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. Ann. Math. Stud. 34, 129\u2013153 (1956)","journal-title":"Ann. Math. Stud."},{"issue":"5","key":"9_CR38","doi-asserted-by":"publisher","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. Transfer 16(5), 569\u2013591 (2014). https:\/\/doi.org\/10.1007\/s10009-014-0321-6","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"issue":"2","key":"9_CR39","doi-asserted-by":"publisher","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":"9_CR40","first-page":"195","volume":"21","author":"B Steffen","year":"2012","unstructured":"Steffen, B., Howar, F., Isberner, M.: Active automata learning: from DFAs to interface programs and beyond. J. Mach. Learn. Res.-Proc. Track 21, 195\u2013209 (2012)","journal-title":"J. Mach. Learn. Res.-Proc. Track"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Windm\u00fcller, S., Neubauer, J., Steffen, B., Howar, F., Bauer, O.: Active continuous quality control. In: 16th International ACM SIGSOFT Symposium on Component-Based Software Engineering, CBSE \u201913, pp. 111\u2013120. ACM SIGSOFT, New York (2013)","DOI":"10.1145\/2465449.2465469"}],"container-title":["Lecture Notes in Computer Science","Model Checking, Synthesis, and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91384-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T13:04:15Z","timestamp":1638450255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91384-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030913830","9783030913847"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91384-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}