{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:48Z","timestamp":1742913288042,"version":"3.40.3"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030873479"},{"type":"electronic","value":"9783030873486"}],"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-87348-6_10","type":"book-chapter","created":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T18:08:32Z","timestamp":1634494112000},"page":"159-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Context-Free Symbiosis of Runtime Verification and Automata 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":[[2021,10,17]]},"reference":[{"key":"10_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 - 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":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-24730-2_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Alur","year":"2004","unstructured":"Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 467\u2013481. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_35"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44585-4_18","volume-title":"Computer Aided Verification","author":"R Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Analysis of recursive state machines. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 207\u2013220. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44585-4_18"},{"key":"10_CR4","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":"10_CR5","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":"10_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":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-32759-9_9","volume-title":"FM 2012: Formal Methods","author":"H Barringer","year":"2012","unstructured":"Barringer, H., Falcone, Y., Havelund, K., Reger, G., Rydeheard, D.: Quantified event automata: towards expressive and efficient runtime monitors. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 68\u201384. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_9"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-75632-5","volume-title":"Lectures on Runtime Verification","year":"2018","unstructured":"Bartocci, E., Falcone, Y. (eds.): Lectures on Runtime Verification. LNCS, vol. 10457. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75632-5"},{"key":"10_CR9","volume-title":"Black-Box Testing: Techniques for Functional Testing of Software and Systems","author":"B Beizer","year":"1995","unstructured":"Beizer, B.: Black-Box Testing: Techniques for Functional Testing of Software and Systems. Wiley, New York (1995)"},{"key":"10_CR10","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":"10_CR11","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). http:\/\/ercim-news.ercim.eu\/en88\/special\/never-stop-learning-continuous-validation-of-learned-models-for-evolving-systems-through-monitoring"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-38771-5_12","volume-title":"Developments in Language Theory","author":"B Bollig","year":"2013","unstructured":"Bollig, B., Habermehl, P., Leucker, M., Monmege, B.: A fresh approach to learning register automata. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 118\u2013130. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38771-5_12"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-47169-3_1","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications","author":"M Broy","year":"2016","unstructured":"Broy, M., Havelund, K., Kumar, R., Steffen, B.: Towards a unified view of modeling and programming (track summary). In: Margaria, T., Steffen, B. (eds.) ISoLA 2016, Part II. LNCS, vol. 9953, pp. 3\u201310. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47169-3_1"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-03418-4_1","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Modeling","author":"M Broy","year":"2018","unstructured":"Broy, M., Havelund, K., Kumar, R., Steffen, B.: Towards a unified view of modeling and programming (ISoLA 2018 track introduction). In: Margaria, T., Steffen, B. (eds.) ISoLA 2018, Part I. LNCS, vol. 11244, pp. 3\u201321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03418-4_1"},{"key":"10_CR15","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":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0084787","volume-title":"CONCUR 1992","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"},{"key":"10_CR17","unstructured":"Burkart, O., Steffen, B.: Composition, decomposition and model checking of pushdown processes. Nordic J. Comput. 2(2), 89\u2013125 (1995). http:\/\/dl.acm.org\/citation.cfm?id=642068.642070"},{"key":"10_CR18","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":"10_CR19","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, Part I. LNCS, vol. 10205, pp. 173\u2013189. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_10"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-030-03769-7_14","volume-title":"Runtime Verification","author":"Y Falcone","year":"2018","unstructured":"Falcone, Y., Krsti\u0107, S., Reger, G., Traytel, D.: A taxonomy for classifying runtime verification tools. In: Colombo, C., Leucker, M. (eds.) RV 2018. LNCS, vol. 11237, pp. 241\u2013262. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03769-7_14"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Feng, L., Kwiatkowska, M., Parker, D.: Compositional verification of probabilistic systems using learning. In: Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems, QEST 2010, Washington, DC, USA, pp. 133\u2013142. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/QEST.2010.24","DOI":"10.1109\/QEST.2010.24"},{"key":"10_CR22","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":"10_CR23","doi-asserted-by":"publisher","unstructured":"Frohme, M., Steffen, B.: Compositional learning of mutually recursive procedural systems. Int. J. Softw. Tools Technol. Transf. (STTT) (2021, to appear). https:\/\/doi.org\/10.1007\/s10009-021-00634-y","DOI":"10.1007\/s10009-021-00634-y"},{"key":"10_CR24","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"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-48234-2_11","volume-title":"Theoretical and Practical Aspects of SPIN Model Checking","author":"K Havelund","year":"1999","unstructured":"Havelund, K.: Java PathFinder a translator from Java to promela. In: Dams, D., Gerth, R., Leue, S., Massink, M. (eds.) SPIN 1999. LNCS, vol. 1680, pp. 152\u2013152. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48234-2_11"},{"issue":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/s100090050043","volume":"2","author":"K Havelund","year":"2000","unstructured":"Havelund, K., Pressburger, T.: Model checking JAVA programs using JAVA PathFinder. Int. J. Softw. Tools Technol. Transf. 2(4), 366\u2013381 (2000). https:\/\/doi.org\/10.1007\/s100090050043","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-319-91908-9_25","volume-title":"Computing and Software Science","author":"K Havelund","year":"2019","unstructured":"Havelund, K., Reger, G., Ro\u015fu, G.: Runtime verification past experiences and future projections. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 532\u2013562. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91908-9_25"},{"issue":"2","key":"10_CR28","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S1571-0661(04)00253-1","volume":"55","author":"K Havelund","year":"2001","unstructured":"Havelund, K., Rosu, G.: Monitoring Java programs with Java PathExplorer. Electron. Notes Theor. Comput. Sci. 55(2), 200\u2013217 (2001). https:\/\/doi.org\/10.1016\/S1571-0661(04)00253-1","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Havelund, K., Rosu, G.: Monitoring programs using rewriting. In: 16th IEEE International Conference on Automated Software Engineering (ASE 2001), Coronado Island, San Diego, CA, USA, 26\u201329 November 2001, pp. 135\u2013143. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/ASE.2001.989799","DOI":"10.1109\/ASE.2001.989799"},{"issue":"2","key":"10_CR30","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s10009-003-0117-6","volume":"6","author":"K Havelund","year":"2003","unstructured":"Havelund, K., Ro\u015fu, G.: Efficient monitoring of safety properties. Int. J. Softw. Tools Technol. Transf. 6(2), 158\u2013173 (2003). https:\/\/doi.org\/10.1007\/s10009-003-0117-6","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Havelund, K., Steffen, B.: Programming: what is next? In: Proceedings of the 9th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2021). LNCS, Springer (2021, to appear)","DOI":"10.1007\/978-3-030-89159-6_13"},{"issue":"1","key":"10_CR32","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/s10009-002-0080-7","volume":"4","author":"K Havelund","year":"2002","unstructured":"Havelund, K., Visser, W.: Program model checking as a new trend. Int. J. Softw. Tools Technol. Transf. 4(1), 8\u201320 (2002). https:\/\/doi.org\/10.1007\/s10009-002-0080-7","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10_CR33","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":"10_CR34","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"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Hungar, H., Margaria, T., Steffen, B.: Test-based model generation for legacy systems. In: Proceedings of the 2003 International Test Conference, ITC 2003, vol. 1, pp. 971\u2013980, October 2003. https:\/\/doi.org\/10.1109\/TEST.2003.1271205","DOI":"10.1109\/TEST.2003.1271205"},{"key":"10_CR36","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"},{"key":"10_CR37","unstructured":"Isberner, M.: Foundations of active automata learning: an algorithmic perspective. Ph.D. thesis, Technical University Dortmund, Germany (2015). http:\/\/hdl.handle.net\/2003\/34282"},{"issue":"1","key":"10_CR38","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10994-013-5419-7","volume":"96","author":"M Isberner","year":"2013","unstructured":"Isberner, M., Howar, F., Steffen, B.: Learning register automata: from languages to program structures. Mach. Learn. 96(1), 65\u201398 (2013). https:\/\/doi.org\/10.1007\/s10994-013-5419-7","journal-title":"Mach. Learn."},{"key":"10_CR39","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":"10_CR40","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":"10_CR41","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":"10_CR42","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":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-54862-8_41","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Maler","year":"2014","unstructured":"Maler, O., Mens, I.-E.: Learning regular languages over large alphabets. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 485\u2013499. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_41"},{"key":"10_CR44","doi-asserted-by":"publisher","unstructured":"Margaria, T., Niese, O., Raffelt, H., Steffen, B.: Efficient test-based model generation for legacy reactive systems. In: HLDVT 2004: 2004 Ninth IEEE International Proceedings of the High-Level Design Validation and Test Workshop, Washington, DC, USA, pp. 95\u2013100. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/HLDVT.2004.1431246","DOI":"10.1109\/HLDVT.2004.1431246"},{"issue":"2","key":"10_CR45","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10515-010-0063-y","volume":"17","author":"PO Meredith","year":"2010","unstructured":"Meredith, P.O., Jin, D., Chen, F., Ro\u015fu, G.: Efficient monitoring of parametric context-free patterns. Autom. Softw. Eng. 17(2), 149\u2013180 (2010). https:\/\/doi.org\/10.1007\/s10515-010-0063-y","journal-title":"Autom. Softw. Eng."},{"key":"10_CR46","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":"10_CR47","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. Transf. 16(5), 569\u2013591 (2014). https:\/\/doi.org\/10.1007\/s10009-014-0321-6","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Proceedings of the FORTE 1999, pp. 225\u2013240. Kluwer Academic (1999)","DOI":"10.1007\/978-0-387-35578-8_13"},{"key":"10_CR49","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Technical report, University of Aarhus (1981). dAIMI FN-19"},{"issue":"4","key":"10_CR50","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. Int. J. Softw. Tools Technol. Transf. (STTT) 11(4), 307\u2013324 (2009). https:\/\/doi.org\/10.1007\/s10009-009-0120-7","journal-title":"Int. J. Softw. Tools Technol. Transf. (STTT)"},{"key":"10_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/11693017_28","volume-title":"Fundamental Approaches to Software Engineering","author":"H Raffelt","year":"2006","unstructured":"Raffelt, H., Steffen, B.: LearnLib: a library for automata learning and experimentation. In: Baresi, L., Heckel, R. (eds.) FASE 2006. LNCS, vol. 3922, pp. 377\u2013380. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693017_28"},{"key":"10_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-319-48869-1_2","volume-title":"Verified Software. Theories, Tools, and Experiments","author":"KY Rozier","year":"2016","unstructured":"Rozier, K.Y.: Specification: the biggest bottleneck in formal methods and autonomy. In: Blazy, S., Chechik, M. (eds.) VSTTE 2016. LNCS, vol. 9971, pp. 8\u201326. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48869-1_2"},{"key":"10_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-21455-4_8","volume-title":"Formal Methods for Eternal Networked Software Systems","author":"B Steffen","year":"2011","unstructured":"Steffen, B., Howar, F., Merten, M.: Introduction to active automata learning from a practical perspective. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol. 6659, pp. 256\u2013296. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21455-4_8"},{"key":"10_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-030-30985-5_19","volume-title":"From Software Engineering to Formal Methods and Tools, and Back","author":"T Tegeler","year":"2019","unstructured":"Tegeler, T., Murtovi, A., Frohme, M., Steffen, B.: Product line verification via modal meta model checking. In: ter Beek, M.H., Fantechi, A., Semini, L. (eds.) From Software Engineering to Formal Methods and Tools, and Back. LNCS, vol. 11865, pp. 313\u2013337. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30985-5_19"},{"key":"10_CR55","doi-asserted-by":"publisher","unstructured":"Visser, W., Havelund, K., Brat, G.P., Park, S.: Model checking programs. In: The Fifteenth IEEE International Conference on Automated Software Engineering, ASE 2000, Grenoble, France, 11\u201315 September 2000, pp. 3\u201312. IEEE Computer Society (2000). https:\/\/doi.org\/10.1109\/ASE.2000.873645","DOI":"10.1109\/ASE.2000.873645"},{"key":"10_CR56","doi-asserted-by":"publisher","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 2013, pp. 111\u2013120. ACM, New York (2013). https:\/\/doi.org\/10.1145\/2465449.2465469","DOI":"10.1145\/2465449.2465469"}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Outer Space"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87348-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T18:13:55Z","timestamp":1634494435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87348-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030873479","9783030873486"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87348-6_10","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":"17 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}