{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:48:06Z","timestamp":1771573686526,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T00:00:00Z","timestamp":1633392000000},"content-version":"vor","delay-in-days":65,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100016378","name":"Technische Universit\u00e4t Dortmund","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100016378","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a compositional approach to active automata learning of Systems of Procedural Automata (SPAs), an extension of Deterministic Finite Automata (DFAs) to systems of DFAs that can mutually call each other. SPAs are of high practical relevance, as they allow one to efficiently learn intuitive recursive models of recursive programs after an easy instrumentation that makes calls and returns observable. Key to our approach is the simultaneous inference of individual DFAs for each of the involved procedures via expansion and projection: membership queries for the individual DFAs are expanded to membership queries of the entire SPA, and global counterexample traces are transformed into counterexamples for the DFAs of concerned procedures. This reduces the inference of SPAs to a simultaneous inference of the DFAs for the involved procedures for which we can utilize various existing regular learning algorithms. The inferred models are easy to understand and allow for an intuitive display of the procedural system under learning that reveals its recursive structure. We implemented the algorithm within the LearnLib framework in order to provide a ready-to-use tool for practical application which is publicly available on GitHub for experimentation.\n<\/jats:p>","DOI":"10.1007\/s10009-021-00634-y","type":"journal-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:55:38Z","timestamp":1633460138000},"page":"521-543","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Compositional learning of mutually recursive procedural systems"],"prefix":"10.1007","volume":"23","author":[{"given":"Markus","family":"Frohme","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"634_CR1","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.) Theoretical Aspects of Computing-ICTAC 2015, pp. 165\u2013183. Springer, Cham (2015)"},{"key":"634_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44585-4_18","volume-title":"Computer Aided Verification: 13th International Conference","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.) Computer Aided Verification: 13th International Conference, pp. 207\u2013220. Springer, Berlin (2001). https:\/\/doi.org\/10.1007\/3-540-44585-4_18"},{"key":"634_CR3","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/11523468_89","volume-title":"Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11\u201315, 2005. Proceedings","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.) Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11\u201315, 2005. Proceedings, pp. 1102\u20131114. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/11523468_89"},{"key":"634_CR4","doi-asserted-by":"publisher","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC\u201904, p. 202\u2013211. Association for Computing Machinery, New York, NY, USA (2004). https:\/\/doi.org\/10.1145\/1007352.1007390","DOI":"10.1145\/1007352.1007390"},{"issue":"2","key":"634_CR5","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. Information and Computation 75(2), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"634_CR6","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"issue":"88","key":"634_CR7","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":"634_CR8","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-38771-5_12","volume-title":"Developments in Language Theory: 17th International Conference, DLT 2013, Marne-la-Vall\u00e9e, France, June 18\u201321, 2013 Proceedings","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.) Developments in Language Theory: 17th International Conference, DLT 2013, Marne-la-Vall\u00e9e, France, June 18\u201321, 2013 Proceedings, pp. 118\u2013130. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-38771-5_12"},{"key":"634_CR9","doi-asserted-by":"crossref","unstructured":"Bollig, B., Katoen, J.P., Kern, C., Leucker, M., Neider, D., Piegdon, D.R.: libalf: the automata learning framework. In: CAV\u201910, pp. 360\u2013364 (2010)","DOI":"10.1007\/978-3-642-14295-6_32"},{"key":"634_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/b137241","volume-title":"Model-Based Testing of Reactive Systems: Lecture Notes in Computer Science","author":"M Broy","year":"2005","unstructured":"Broy, M., Jonsson, B., Katoen, J.P., Leucker, M., Pretschner, A.: Model-Based Testing of Reactive Systems: Lecture Notes in Computer Science, vol. 3472. Springer, New York (2005)"},{"key":"634_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0084787","volume-title":"CONCUR 92","author":"O Burkart","year":"1992","unstructured":"Burkart, O., Steffen, B.: Model checking for context-free processes. In: Cleaveland, W. (ed.) CONCUR 92. Lecture Notes in Computer Science, vol. 630, pp. 123\u2013137. Springer, Berlin (1992). https:\/\/doi.org\/10.1007\/BFb0084787"},{"issue":"2","key":"634_CR12","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":"634_CR13","unstructured":"Cassel, S., Howar, F., Jonsson, B.: RALib: a LearnLib extension for inferring EFSMs. DIFTS 5 (2015)"},{"key":"634_CR14","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":"634_CR15","doi-asserted-by":"publisher","unstructured":"Drews, S., D\u2019Antoni, L.: Learning symbolic automata. In: Legay, A., Margaria, T. (eds.) Tools and Algorithms for the Construction and Analysis of Systems: 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22\u201329, 2017, Proceedings, Part I, pp. 173\u2013189. Springer, Berlin (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_10","DOI":"10.1007\/978-3-662-54577-5_10"},{"key":"634_CR16","doi-asserted-by":"publisher","unstructured":"Feng, L., Kwiatkowska, M., Parker, D.: In: Compositional Verification of Probabilistic Systems Using Learning, vol. QEST\u201910, pp. 133\u2013142. IEEE Computer Society, Washington (2010). https:\/\/doi.org\/10.1109\/QEST.2010.24","DOI":"10.1109\/QEST.2010.24"},{"key":"634_CR17","volume-title":"23rd International Conference, FMICS 2018, Maynooth, Ireland, September 3\u20134, 2018, Proceedings","author":"M Frohme","year":"2018","unstructured":"Frohme, M., Steffen, B.: Active mining of document type definitions. In: Howar, F., Barnat, J. (eds.) 23rd International Conference, FMICS 2018, Maynooth, Ireland, September 3\u20134, 2018, Proceedings. Springer, Berlin (2018)"},{"key":"634_CR18","doi-asserted-by":"publisher","unstructured":"Godefroid, P., Kiezun, A., Levin, M.Y.: In: Grammar-based whitebox fuzzing, vol. PLDI\u201908, pp. 206\u2013215. ACM, New York (2008). https:\/\/doi.org\/10.1145\/1375581.1375607","DOI":"10.1145\/1375581.1375607"},{"key":"634_CR19","unstructured":"Godefroid, P., Levin, M.Y., Molnar, D.A.: In: Automated whitebox fuzz testing. www.isoc.org\/isoc\/conferences\/ndss\/08\/papers\/10_automated_whitebox_fuzz.pdf. San Diego, California, USA (2008). (10th February\u201313th February 2008)"},{"key":"634_CR20","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":"634_CR21","unstructured":"Howar, F.: Active learning of interface programs. Ph.D. thesis, TU Dortmund University (2012). https:\/\/eldorado.tu-dortmund.de\/bitstream\/2003\/29486\/1\/Dissertation.pdf"},{"key":"634_CR22","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: Koncak, V., Rybalchenko, A. (eds.) Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science, vol. 7148, pp. 251\u2013266. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-27940-9_17"},{"key":"634_CR23","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.) Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science, vol. 6538, pp. 263\u2013277. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_19"},{"key":"634_CR24","doi-asserted-by":"publisher","unstructured":"Hungar, H., Margaria, T., Steffen, B.: Test-based model generation for legacy systems. In: Test Conference, 2003. Proceedings. ITC 2003. International, vol.\u00a01, pp. 971\u2013980 (2003). https:\/\/doi.org\/10.1109\/TEST.2003.1271205","DOI":"10.1109\/TEST.2003.1271205"},{"key":"634_CR25","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":"Proceedings 15th International Conference on 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., Jr., Somenzi, F. (eds.) Proceedings 15th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 2725, pp. 315\u2013327. Springer, Berlin (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_31"},{"key":"634_CR26","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"},{"key":"634_CR27","doi-asserted-by":"publisher","unstructured":"Isberner, M., Howar, F., Steffen, B.: Inferring automata with state-local alphabet abstractions. In: Brat, G.,\u00a0Rungta, N.,\u00a0Venet A. (eds.) NASA Formal Methods, LNCS, vol. 7871, pp. 124\u2013138 (2013). https:\/\/doi.org\/10.1007\/978-3-642-38088-4_9","DOI":"10.1007\/978-3-642-38088-4_9"},{"key":"634_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5419-7","author":"M Isberner","year":"2013","unstructured":"Isberner, M., Howar, F., Steffen, B.: Learning register automata: from languages to program structures. Mach. Learn. (2013). https:\/\/doi.org\/10.1007\/s10994-013-5419-7","journal-title":"Mach. Learn."},{"key":"634_CR29","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. (eds.) Runtime Verification. Lecture Notes in Computer Science, vol. 8734, pp. 307\u2013322. Springer, Berlin (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"634_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_32","author":"M Isberner","year":"2015","unstructured":"Isberner, M., Howar, F., Steffen, B.: The open-source learnLib: a framework for active automata learning. CAV (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_32","journal-title":"CAV"},{"key":"634_CR31","doi-asserted-by":"crossref","unstructured":"Issarny, V., Steffen, B., Jonsson, B., Blair, G.S., Grace, P., Kwiatkowska, M.Z., Calinescu, R., Inverardi, P., Tivoli, M., Bertolino, A., Sabetta, A.: In: ICECCS (ed.) CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems, pp. 154\u2013161. IEEE Computer Society (2009)","DOI":"10.1109\/ICECCS.2009.44"},{"key":"634_CR32","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":"634_CR33","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/11817949_14","volume-title":"CONCUR 2006\u2014Concurrency Theory: 17th International Conference, CONCUR 2006, Bonn, Germany, August 27\u201330, 2006 Proceedings","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\u2014Concurrency Theory: 17th International Conference, CONCUR 2006, Bonn, Germany, August 27\u201330, 2006 Proceedings, pp. 203\u2013217. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/11817949_14"},{"key":"634_CR34","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: 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5\u201313, 2014. Proceedings","author":"O Maler","year":"2014","unstructured":"Maler, O., Mens, I.E.: Learning regular languages over large alphabets. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) Tools and Algorithms for the Construction and Analysis of Systems: 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5\u201313, 2014. Proceedings, pp. 485\u2013499. Springer, Berlin (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_41"},{"key":"634_CR35","doi-asserted-by":"publisher","unstructured":"Margaria, T., Niese, O., Raffelt, H., Steffen, B.: Efficient test-based model generation for legacy reactive systems. In: HLDVT\u201904: Proceedings of the High-Level Design Validation and Test Workshop, 2004. 9th IEEE International, pp. 95\u2013100. IEEE Computer Society, Washington (2004). https:\/\/doi.org\/10.1109\/HLDVT.2004.1431246","DOI":"10.1109\/HLDVT.2004.1431246"},{"issue":"3","key":"634_CR36","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/321406.321411","volume":"14","author":"R McNaughton","year":"1967","unstructured":"McNaughton, R.: Parenthesis grammars. J. ACM 14(3), 490\u2013500 (1967). https:\/\/doi.org\/10.1145\/321406.321411","journal-title":"J. ACM"},{"issue":"12","key":"634_CR37","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/96267.96279","volume":"33","author":"BP Miller","year":"1990","unstructured":"Miller, B.P., Fredriksen, L., So, B.: An empirical study of the reliability of unix utilities. Commun. ACM 33(12), 32\u201344 (1990). https:\/\/doi.org\/10.1145\/96267.96279","journal-title":"Commun. ACM"},{"key":"634_CR38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804175","volume-title":"Concepts in Programming Languages","author":"JC Mitchell","year":"2002","unstructured":"Mitchell, J.C.: Concepts in Programming Languages. Cambridge University Press, Cambridge (2002). https:\/\/doi.org\/10.1017\/CBO9780511804175"},{"issue":"4","key":"634_CR39","doi-asserted-by":"publisher","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."},{"issue":"5","key":"634_CR40","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."},{"issue":"2","key":"634_CR41","first-page":"225","volume":"7","author":"D Peled","year":"2001","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. J. Autom. Lang. Comb. 7(2), 225\u2013246 (2001)","journal-title":"J. Autom. Lang. Comb."},{"key":"634_CR42","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Tech. rep., University of Aarhus (1981). DAIMI FN-19"},{"key":"634_CR43","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-25959-6_40","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: The GROOVE simulator: a tool for state space generation. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) Applications of Graph Transformations with Industrial Relevance, pp. 479\u2013485. Springer, Berlin (2004)"},{"issue":"2","key":"634_CR44","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). https:\/\/doi.org\/10.1006\/inco.1993.1021","journal-title":"Inf. Comput."},{"key":"634_CR45","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.) Formal Methods for Eternal Networked Software Systems. Lecture Notes in Computer Science, vol. 6659, pp. 256\u2013296. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-21455-4_8"},{"key":"634_CR46","doi-asserted-by":"crossref","unstructured":"Vardhan, A., Viswanathan, M.: LEVER: a tool for learning based verification. Presented at the (2006)","DOI":"10.1007\/11817963_43"},{"key":"634_CR47","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\u201913, pp. 111\u2013120. ACM SIGSOFT, New York (2013). https:\/\/doi.org\/10.1145\/2465449.2465469","DOI":"10.1145\/2465449.2465469"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-021-00634-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10009-021-00634-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-021-00634-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T14:06:52Z","timestamp":1634825212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10009-021-00634-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["634"],"URL":"https:\/\/doi.org\/10.1007\/s10009-021-00634-y","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8]]},"assertion":[{"value":"5 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}