{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:20:20Z","timestamp":1777702820913,"version":"3.51.4"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T00:00:00Z","timestamp":1665100800000},"content-version":"vor","delay-in-days":6,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007210","name":"RWTH Aachen University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007210","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":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Loop acceleration can be used to prove safety, reachability, runtime bounds, and (non-)termination of programs. To this end, a variety of acceleration techniques have been proposed. However, so far all of them have been monolithic, i.e., a single loop could not be accelerated using a <jats:italic>combination of several different<\/jats:italic> acceleration techniques. In contrast, we present a calculus that allows for combining acceleration techniques in a modular way and we show how to integrate many existing acceleration techniques into our calculus. Moreover, we propose two novel acceleration techniques that can be incorporated into our calculus seamlessly. Some of these acceleration techniques apply only to non-terminating loops. Thus, combining them with our novel calculus results in a new, modular approach for proving non-termination. An empirical evaluation demonstrates the applicability of our approach, both for loop acceleration and for proving non-termination.<\/jats:p>","DOI":"10.1007\/s10009-022-00670-2","type":"journal-article","created":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T13:04:18Z","timestamp":1665147858000},"page":"691-715","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A calculus for modular loop acceleration and non-termination proofs"],"prefix":"10.1007","volume":"24","author":[{"given":"Florian","family":"Frohn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Fuhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,7]]},"reference":[{"key":"670_CR1","doi-asserted-by":"publisher","unstructured":"Albert, E., Genaim, S., Martin-Martin, E., Merayo, A., Rubio, A.: Lower-bound synthesis using loop specialization and max-SMT. In: CAV\u00a0\u201921. pp. 863\u2013886. LNCS 12760 (2021). https:\/\/doi.org\/10.1007\/978-3-030-81688-9_40","DOI":"10.1007\/978-3-030-81688-9_40"},{"key":"670_CR2","unstructured":"Bagnara, R., Pescetti, A., Zaccagnini, A., Zaffanella, E.: PURRS: towards computer algebra support for fully automatic worst-case complexity analysis (2005). https:\/\/arxiv.org\/abs\/cs\/0512056 [cs.MS]"},{"issue":"5","key":"670_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10009-008-0064-3","volume":"10","author":"S Bardin","year":"2008","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: acceleration from theory to practice. Int. J. Softw. Tools Technol. Transf. 10(5), 401\u2013424 (2008). https:\/\/doi.org\/10.1007\/s10009-008-0064-3","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"670_CR4","doi-asserted-by":"publisher","unstructured":"Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat acceleration in symbolic model checking. In: ATVA\u00a0\u201905. pp. 474\u2013488. LNCS 3707 (2005). https:\/\/doi.org\/10.1007\/11562948_35","DOI":"10.1007\/11562948_35"},{"key":"670_CR5","doi-asserted-by":"publisher","unstructured":"Ben-Amram, A.M., Dom\u00e9nech, J.J., Genaim, S.: Multiphase-linear ranking functions and their relation to recurrent sets. In: SAS\u00a0\u201919. pp. 459\u2013480. LNCS 11822 (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_22","DOI":"10.1007\/978-3-030-32304-2_22"},{"key":"670_CR6","unstructured":"Boigelot, B.: Symbolic methods for exploring infinite state spaces. Ph.D. thesis, Universit\u00e9 de Li\u00e8ge (1999). https:\/\/orbi.uliege.be\/bitstream\/2268\/74874\/1\/Boigelot98.pdf"},{"issue":"1\u20133","key":"670_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0304-3975(03)00314-1","volume":"309","author":"B Boigelot","year":"2003","unstructured":"Boigelot, B.: On iterating linear transformations over recognizable sets of integers. Theor. Comput. Sci. 309(1\u20133), 413\u2013468 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(03)00314-1","journal-title":"Theor. Comput. Sci."},{"key":"670_CR8","doi-asserted-by":"publisher","unstructured":"Bozga, M., G\u00eerlea, C., Iosif, R.: Iterating octagons. In: TACAS\u00a0\u201909. pp. 337\u2013351. LNCS 5505 (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_29","DOI":"10.1007\/978-3-642-00768-2_29"},{"key":"670_CR9","doi-asserted-by":"publisher","unstructured":"Bozga, M., Iosif, R., Kone\u010dn\u00fd, F.: Fast acceleration of ultimately periodic relations. In: CAV\u00a0\u201910. pp. 227\u2013242. LNCS 6174 (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_23","DOI":"10.1007\/978-3-642-14295-6_23"},{"key":"670_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2168\/LMCS-10(3:8)2014","volume":"10","author":"M Bozga","year":"2014","unstructured":"Bozga, M., Iosif, R., Kone\u010dn\u00fd, F.: Deciding conditional termination. Log. Methods Comput. Sci. 10, 3 (2014). https:\/\/doi.org\/10.2168\/LMCS-10(3:8)2014","journal-title":"Log. Methods Comput. Sci."},{"key":"670_CR11","doi-asserted-by":"publisher","unstructured":"Brockschmidt, M., Str\u00f6der, T., Otto, C., Giesl, J.: Automated detection of non-termination and NullPointerExceptions for Java Bytecode. In: FoVeOOS\u00a0\u201911. pp. 123\u2013141. LNCS 7421 (2012). https:\/\/doi.org\/10.1007\/978-3-642-31762-0_9","DOI":"10.1007\/978-3-642-31762-0_9"},{"key":"670_CR12","unstructured":"Brockschmidt, M., Rybalchenko, A.: TermComp proposal: pushdown systems as a model for programs with procedures (2014). https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/02\/SMTPushdownPrograms.pdf"},{"key":"670_CR13","doi-asserted-by":"publisher","unstructured":"Brockschmidt, M., Cook, B., Ishtiaq, S., Khlaaf, H., Piterman, N.: T2: temporal property verification. In: TACAS\u00a0\u201916. LNCS 9636 (2016), pp. 387\u2013393. https:\/\/doi.org\/10.1007\/978-3-662-49674-9_22","DOI":"10.1007\/978-3-662-49674-9_22"},{"key":"670_CR14","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Goharshady, E.K., Novotn\u00fd, P., Zikelic, D.: Proving non-termination by program reversal. In: PLDI\u00a0\u201921. pp. 1033\u20131048 (2021). https:\/\/doi.org\/10.1145\/3453483.3454093","DOI":"10.1145\/3453483.3454093"},{"key":"670_CR15","doi-asserted-by":"publisher","unstructured":"Chen, Y., Heizmann, M., Leng\u00e1l, O., Li, Y., Tsai, M., Turrini, A., Zhang, L.: Advanced automata-based algorithms for program termination checking. In: PLDI\u00a0\u201918. pp. 135\u2013150 (2018). https:\/\/doi.org\/10.1145\/3192366.3192405","DOI":"10.1145\/3192366.3192405"},{"key":"670_CR16","doi-asserted-by":"publisher","unstructured":"Chen, H., Cook, B., Fuhs, C., Nimkar, K., O\u2019Hearn, P.W.: Proving nontermination via safety. In: TACAS\u00a0\u201914. pp. 156\u2013171. LNCS 8413 (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_11","DOI":"10.1007\/978-3-642-54862-8_11"},{"key":"670_CR17","doi-asserted-by":"publisher","unstructured":"Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and Presburger arithmetic. In: CAV\u00a0\u201998. pp. 268\u2013279. LNCS 1427 (1998). https:\/\/doi.org\/10.1007\/BFb0028751","DOI":"10.1007\/BFb0028751"},{"key":"670_CR18","doi-asserted-by":"publisher","unstructured":"Cook, B., Fuhs, C., Nimkar, K., O\u2019Hearn, P.W.: Disproving termination with overapproximation. In: FMCAD\u00a0\u201914. pp. 67\u201374 (2014). https:\/\/doi.org\/10.1109\/FMCAD.2014.6987597","DOI":"10.1109\/FMCAD.2014.6987597"},{"key":"670_CR19","doi-asserted-by":"publisher","unstructured":"Dutertre, B.: Yices 2.2. In: CAV\u00a0\u201914. LNCS 8559 (2014), pp. 737\u2013744. https:\/\/doi.org\/10.1007\/978-3-319-08867-9_49","DOI":"10.1007\/978-3-319-08867-9_49"},{"key":"670_CR20","doi-asserted-by":"publisher","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: TACAS \u201908. pp. 337\u2013340. LNCS 4963 (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"670_CR21","doi-asserted-by":"publisher","unstructured":"Farzan, A., Kincaid, Z.: Compositional recurrence analysis. In: FMCAD\u00a0\u201915. pp. 57\u201364 (2015). https:\/\/doi.org\/10.1109\/FMCAD.2015.7542253","DOI":"10.1109\/FMCAD.2015.7542253"},{"key":"670_CR22","doi-asserted-by":"publisher","unstructured":"Frohn, F., Giesl, J.: Proving non-termination via loop acceleration. In: FMCAD\u00a0\u201919. pp. 221\u2013230 (2019). https:\/\/doi.org\/10.23919\/FMCAD.2019.8894271","DOI":"10.23919\/FMCAD.2019.8894271"},{"key":"670_CR23","doi-asserted-by":"publisher","unstructured":"Frohn, F.: A calculus for modular loop acceleration. In: TACAS\u00a0\u201920. pp. 58\u201376. LNCS 12078 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_4","DOI":"10.1007\/978-3-030-45190-5_4"},{"key":"670_CR24","doi-asserted-by":"crossref","unstructured":"Frohn, F., Fuhs, C.: Empirical evaluation of \u201cA calculus for modular loop acceleration (and non-termination proofs)\u201d (2022). https:\/\/ffrohn.github.io\/acceleration-calculus","DOI":"10.1007\/s10009-022-00670-2"},{"key":"670_CR25","doi-asserted-by":"publisher","unstructured":"Frohn, F., Giesl, J.: Termination of triangular integer loops is decidable. In: CAV\u00a0\u201919. LNCS 11562 (2019), pp. 426\u2013444. https:\/\/doi.org\/10.1007\/978-3-030-25543-5_24","DOI":"10.1007\/978-3-030-25543-5_24"},{"key":"670_CR26","doi-asserted-by":"publisher","unstructured":"Frohn, F., Hark, M., Giesl, J.: Termination of polynomial loops. In: SAS\u00a0\u201920. pp. 89\u2013112. LNCS 12389 (2020). https:\/\/doi.org\/10.1007\/978-3-030-65474-0_5","DOI":"10.1007\/978-3-030-65474-0_5"},{"issue":"3","key":"670_CR27","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/3410331","volume":"42","author":"F Frohn","year":"2020","unstructured":"Frohn, F., Naaf, M., Brockschmidt, M., Giesl, J.: Inferring lower runtime bounds for integer programs. ACM Trans. Program. Lang. Syst. 42(3), 13:1-13:50 (2020). https:\/\/doi.org\/10.1145\/3410331","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"670_CR28","doi-asserted-by":"publisher","unstructured":"Frohn, F., Naaf, M., Hensel, J., Brockschmidt, M., Giesl, J.: Lower runtime bounds for integer programs. In: IJCAR\u00a0\u201916. pp. 550\u2013567. LNCS 9706 (2016). https:\/\/doi.org\/10.1007\/978-3-319-40229-1_37","DOI":"10.1007\/978-3-319-40229-1_37"},{"issue":"5","key":"670_CR29","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10009-016-0420-7","volume":"19","author":"P Ganty","year":"2017","unstructured":"Ganty, P., Iosif, R., Kone\u010dn\u00fd, F.: Underapproximation of procedure summaries for integer programs. Int. J. Softw. Tools Technol. Transf. 19(5), 565\u2013584 (2017). https:\/\/doi.org\/10.1007\/s10009-016-0420-7","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"1","key":"670_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10817-016-9388-y","volume":"58","author":"J Giesl","year":"2017","unstructured":"Giesl, J., Aschermann, C., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Hensel, J., Otto, C., Pl\u00fccker, M., Schneider-Kamp, P., Str\u00f6der, T., Swiderski, S., Thiemann, R.: Analyzing program termination and complexity automatically with AProVE. J. Autom. Reason. 58(1), 3\u201331 (2017). https:\/\/doi.org\/10.1007\/s10817-016-9388-y","journal-title":"J. Autom. Reason."},{"key":"670_CR31","doi-asserted-by":"publisher","unstructured":"Giesl, J., Rubio, A., Sternagel, C., Waldmann, J., Yamada, A.: The termination and complexity competition. In: TACAS\u00a0\u201919. pp. 156\u2013166. LNCS 11429 (2019). https:\/\/doi.org\/10.1007\/978-3-030-17502-3_10","DOI":"10.1007\/978-3-030-17502-3_10"},{"key":"670_CR32","unstructured":"Goharshady, E.K.: RevTerm on GitHub (2021). https:\/\/github.com\/ekgma\/RevTerm"},{"key":"670_CR33","doi-asserted-by":"publisher","unstructured":"Gonnord, L., Halbwachs, N.: Combining widening and acceleration in linear relation analysis. In: SAS\u00a0\u201906. pp. 144\u2013160. LNCS 4134 (2006). https:\/\/doi.org\/10.1007\/11823230_10","DOI":"10.1007\/11823230_10"},{"key":"670_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.scico.2013.09.016","volume":"93","author":"L Gonnord","year":"2014","unstructured":"Gonnord, L., Schrammel, P.: Abstract acceleration in linear relation analysis. Sci. Comput. Program. 93, 125\u2013153 (2014). https:\/\/doi.org\/10.1016\/j.scico.2013.09.016","journal-title":"Sci. Comput. Program."},{"key":"670_CR35","doi-asserted-by":"publisher","unstructured":"Gulwani, S., Srivastava, S., Venkatesan, R.: Program analysis as constraint solving. In: PLDI\u00a0\u201908. pp. 281\u2013292 (2008). https:\/\/doi.org\/10.1145\/1375581.1375616","DOI":"10.1145\/1375581.1375616"},{"key":"670_CR36","doi-asserted-by":"publisher","unstructured":"Gupta, A., Henzinger, T.A., Majumdar, R., Rybalchenko, A., Xu, R.: Proving non-termination. In: POPL\u00a0\u201908. pp. 147\u2013158 (2008). https:\/\/doi.org\/10.1145\/1328438.1328459","DOI":"10.1145\/1328438.1328459"},{"key":"670_CR37","doi-asserted-by":"publisher","unstructured":"Hark, M., Frohn, F., Giesl, J.: Polynomial loops: beyond termination. In: LPAR\u00a0\u201920. pp. 279\u2013297. EPiC Series in Computing 73 (2020). https:\/\/doi.org\/10.29007\/nxv1","DOI":"10.29007\/nxv1"},{"key":"670_CR38","doi-asserted-by":"publisher","unstructured":"Hojjat, H., Iosif, R., Kone\u010dn\u00fd, F., Kuncak, V., R\u00fcmmer, P.: Accelerating interpolants. In: ATVA\u00a0\u201912. pp. 187\u2013202. LNCS 7561 (2012). https:\/\/doi.org\/10.1007\/978-3-642-33386-6_16","DOI":"10.1007\/978-3-642-33386-6_16"},{"key":"670_CR39","doi-asserted-by":"publisher","unstructured":"Hojjat, H., Kone\u010dn\u00fd, F., Garnier, F., Iosif, R., Kuncak, V., R\u00fcmmer, P.: A verification toolkit for numerical transition systems - tool paper. In: FM\u00a0\u201912. pp. 247\u2013251. LNCS 7436 (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_21","DOI":"10.1007\/978-3-642-32759-9_21"},{"key":"670_CR40","doi-asserted-by":"publisher","unstructured":"Hosseini, M., Ouaknine, J., Worrell, J.: Termination of linear loops over the integers. In: ICALP\u00a0\u201919. pp. 118:1\u2013118:13. LIPIcs 132 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.118","DOI":"10.4230\/LIPIcs.ICALP.2019.118"},{"key":"670_CR41","doi-asserted-by":"publisher","unstructured":"Jeannet, B., Schrammel, P., Sankaranarayanan, S.: Abstract acceleration of general linear loops. In: POPL\u00a0\u201914. pp. 529\u2013540 (2014). https:\/\/doi.org\/10.1145\/2535838.2535843","DOI":"10.1145\/2535838.2535843"},{"key":"670_CR42","doi-asserted-by":"publisher","unstructured":"Kincaid, Z., Breck, J., Boroujeni, A.F., Reps, T.W.: Compositional recurrence analysis revisited. In: PLDI\u00a0\u201917. pp. 248\u2013262 (2017). https:\/\/doi.org\/10.1145\/3062341.3062373","DOI":"10.1145\/3062341.3062373"},{"key":"670_CR43","doi-asserted-by":"publisher","unstructured":"Kone\u010dn\u00fd, F.: PTIME computation of transitive closures of octagonal relations. In: TACAS\u00a0\u201916. LNCS 9636 (2016), pp. 645\u2013661. https:\/\/doi.org\/10.1007\/978-3-662-49674-9_42","DOI":"10.1007\/978-3-662-49674-9_42"},{"issue":"1","key":"670_CR44","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10703-015-0228-1","volume":"47","author":"D Kroening","year":"2015","unstructured":"Kroening, D., Lewis, M., Weissenbacher, G.: Under-approximating loops in C programs for fast counterexample detection. Formal Methods Syst. Des. 47(1), 75\u201392 (2015). https:\/\/doi.org\/10.1007\/s10703-015-0228-1","journal-title":"Formal Methods Syst. Des."},{"key":"670_CR45","doi-asserted-by":"publisher","unstructured":"Larraz, D., Nimkar, K., Oliveras, A., Rodr\u00edguez-Carbonell, E., Rubio, A.: Proving non-termination using max-SMT. In: CAV\u00a0\u201914. LNCS 8559 (2014), pp. 779\u2013796. https:\/\/doi.org\/10.1007\/978-3-319-08867-9_52","DOI":"10.1007\/978-3-319-08867-9_52"},{"key":"670_CR46","doi-asserted-by":"publisher","unstructured":"Leike, J., Heizmann, M.: Geometric nontermination arguments. In: TACAS\u00a0\u201918. pp. 266\u2013283. LNCS 10806 (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_16","DOI":"10.1007\/978-3-319-89963-3_16"},{"key":"670_CR47","doi-asserted-by":"publisher","unstructured":"Madhukar, K., Wachter, B., Kroening, D., Lewis, M., Srivas, M.K.: Accelerating invariant generation. In: FMCAD\u00a0\u201915. pp. 105\u2013111 (2015). https:\/\/doi.org\/10.1109\/FMCAD.2015.7542259","DOI":"10.1109\/FMCAD.2015.7542259"},{"key":"670_CR48","doi-asserted-by":"publisher","unstructured":"Ouaknine, J., Pinto, J.S., Worrell, J.: On termination of integer linear loops. In: SODA\u00a0\u201915. pp. 957\u2013969 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.65","DOI":"10.1137\/1.9781611973730.65"},{"key":"670_CR49","doi-asserted-by":"publisher","unstructured":"Silverman, J., Kincaid, Z.: Loop summarization with rational vector addition systems. In: CAV\u00a0\u201919. LNCS 11562 (2019), pp. 97\u2013115. https:\/\/doi.org\/10.1007\/978-3-030-25543-5_7","DOI":"10.1007\/978-3-030-25543-5_7"},{"key":"670_CR50","unstructured":"StarExec hardware specifications (2022). https:\/\/www.starexec.org\/starexec\/public\/machine-specs.txt"},{"key":"670_CR51","doi-asserted-by":"publisher","unstructured":"Strejcek, J., Trt\u00edk, M.: Abstracting path conditions. In: ISSTA\u00a0\u201912. pp. 155\u2013165 (2012). https:\/\/doi.org\/10.1145\/2338965.2336772","DOI":"10.1145\/2338965.2336772"},{"key":"670_CR52","doi-asserted-by":"publisher","unstructured":"Stump, A., Sutcliffe, G., Tinelli, C.: StarExec: a cross-community infrastructure for logic solving. In: IJCAR\u00a0\u201914. pp. 367\u2013373. LNCS 8562 (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_28","DOI":"10.1007\/978-3-319-08587-6_28"},{"key":"670_CR53","unstructured":"Termination problems data base (TPDB). http:\/\/termination-portal.org\/wiki\/TPDB"},{"key":"670_CR54","doi-asserted-by":"publisher","unstructured":"Urban, C., Gurfinkel, A., Kahsai, T.: Synthesizing ranking functions from bits and pieces. In: TACAS\u00a0\u201916. LNCS 9636 (2016), pp. 54\u201370. https:\/\/doi.org\/10.1007\/978-3-662-49674-9_4","DOI":"10.1007\/978-3-662-49674-9_4"},{"key":"670_CR55","doi-asserted-by":"publisher","unstructured":"Velroyen, H., R\u00fcmmer, P.: Non-termination checking for imperative programs. In: TAP\u00a0\u201908. pp. 154\u2013170. LNCS 4966 (2008). https:\/\/doi.org\/10.1007\/978-3-540-79124-9_11","DOI":"10.1007\/978-3-540-79124-9_11"}],"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-022-00670-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10009-022-00670-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-022-00670-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T10:11:50Z","timestamp":1668593510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10009-022-00670-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["670"],"URL":"https:\/\/doi.org\/10.1007\/s10009-022-00670-2","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]},"assertion":[{"value":"29 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}