{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T19:44:53Z","timestamp":1768592693172,"version":"3.49.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T00:00:00Z","timestamp":1477008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T00:00:00Z","timestamp":1477008000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GI 274\/6-1"],"award-info":[{"award-number":["GI 274\/6-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["Y757"],"award-info":[{"award-number":["Y757"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Danish Council for Independent Research, Natural Sciences"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10817-016-9388-y","type":"journal-article","created":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T05:54:05Z","timestamp":1477029245000},"page":"3-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":94,"title":["Analyzing Program Termination and Complexity Automatically with AProVE"],"prefix":"10.1007","volume":"58","author":[{"given":"J\u00fcrgen","family":"Giesl","sequence":"first","affiliation":[]},{"given":"Cornelius","family":"Aschermann","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Brockschmidt","sequence":"additional","affiliation":[]},{"given":"Fabian","family":"Emmes","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Frohn","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Fuhs","sequence":"additional","affiliation":[]},{"given":"Jera","family":"Hensel","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Otto","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Pl\u00fccker","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Schneider-Kamp","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Str\u00f6der","sequence":"additional","affiliation":[]},{"given":"Stephanie","family":"Swiderski","sequence":"additional","affiliation":[]},{"given":"Ren\u00e9","family":"Thiemann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,21]]},"reference":[{"key":"9388_CR1","doi-asserted-by":"crossref","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Removing useless variables in cost analysis of Java Bytecode. In: SAC\u00a0\u201908, pp. 368\u2013375 (2008)","DOI":"10.1145\/1363686.1363779"},{"key":"9388_CR2","doi-asserted-by":"crossref","unstructured":"Alias, C., Darte, A., Feautrier, P., Gonnord, L.: Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In: SAS\u00a0\u201910, pp. 117\u2013133 (2010)","DOI":"10.1007\/978-3-642-15769-1_8"},{"issue":"1\u20132","key":"9388_CR3","first-page":"3","volume":"7","author":"M Alpuente","year":"2007","unstructured":"Alpuente, M., Escobar, S., Lucas, S.: Removing redundant arguments automatically. TPLP 7(1\u20132), 3\u201335 (2007)","journal-title":"TPLP"},{"key":"9388_CR4","unstructured":"AProVE. http:\/\/aprove.informatik.rwth-aachen.de\/"},{"key":"9388_CR5","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard: Version 2.5. Technical report, The University of Iowa. http:\/\/smt-lib.org\/ (2015)"},{"key":"9388_CR6","volume-title":"Coq\u2019Art","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Coq\u2019Art. Springer, Berlin (2004)"},{"key":"9388_CR7","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1017\/S0960129511000120","volume":"4","author":"F Blanqui","year":"2011","unstructured":"Blanqui, F., Koprowski, A.: CoLoR: A Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates. Math. Struct. Comput. Sci. 4, 827\u2013859 (2011)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9388_CR8","doi-asserted-by":"crossref","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: Linear ranking with reachability. In: CAV\u00a0\u201905, pp. 491\u2013504 (2005)","DOI":"10.1007\/11513988_48"},{"key":"9388_CR9","doi-asserted-by":"crossref","unstructured":"Bray, T.: The JavaScript object notation (JSON) data interchange format. (2014). RFC 7159","DOI":"10.17487\/rfc7158"},{"key":"9388_CR10","unstructured":"Brockschmidt, M., Otto, C., Giesl, J.: Modular termination proofs of recursive Java Bytecode programs by term rewriting. In: RTA\u00a0\u201911, pp. 155\u2013170 (2011)"},{"key":"9388_CR11","doi-asserted-by":"crossref","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 (2012)","DOI":"10.1007\/978-3-642-31762-0_9"},{"key":"9388_CR12","doi-asserted-by":"crossref","unstructured":"Brockschmidt, M., Musiol, R., Otto, C., Giesl, J.: Automated termination proofs for Java programs with cyclic data. In: CAV\u00a0\u201912, pp. 105\u2013122 (2012)","DOI":"10.1007\/978-3-642-31424-7_13"},{"key":"9388_CR13","doi-asserted-by":"crossref","unstructured":"Brockschmidt, M., Cook, B., Fuhs, C.: Better termination proving through cooperation. In: CAV\u00a0\u201913, pp. 413\u2013429 (2013)","DOI":"10.1007\/978-3-642-39799-8_28"},{"issue":"4","key":"9388_CR14","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2866575","volume":"38","author":"M Brockschmidt","year":"2016","unstructured":"Brockschmidt, M., Emmes, F., Falke, S., Fuhs, C., Giesl, J.: Analyzing runtime and size complexity of integer programs. ACM TOPLAS 38(4), 13:1\u201313:50 (2016)","journal-title":"ACM TOPLAS"},{"key":"9388_CR15","doi-asserted-by":"crossref","unstructured":"Christ, J., Hoenicke, J., Nutz, A.: SMTInterpol: an interpolating SMT solver. In: SPIN\u00a0\u201912, pp. 248\u2013254 (2012)","DOI":"10.1007\/978-3-642-31759-0_19"},{"key":"9388_CR16","unstructured":"Codish, M., Fekete, Y., Fuhs, C., Giesl, J., Waldmann, J.: Exotic semiring constraints (extended abstract). In: SMT\u00a0\u201912, pp. 87\u201396 (2012)"},{"issue":"1","key":"9388_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10817-010-9211-0","volume":"49","author":"M Codish","year":"2012","unstructured":"Codish, M., Giesl, J., Schneider-Kamp, P., Thiemann, R.: SAT solving for termination proofs with recursive path orders and dependency pairs. JAR 49(1), 53\u201393 (2012)","journal-title":"JAR"},{"key":"9388_CR18","unstructured":"Contejean, E., Courtieu, P., Forest, J., Pons, O., Urbain, X.: Automated certified proofs with CiME3. In: RTA\u00a0\u201911, pp. 21\u201330 (2011)"},{"key":"9388_CR19","doi-asserted-by":"crossref","unstructured":"Cook, B., See, A., Zuleger, F.: Ramsey vs. lexicographic termination proving. In: TACAS\u00a0\u201913, pp. 47\u201361 (2013)","DOI":"10.1007\/978-3-642-36742-7_4"},{"key":"9388_CR20","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL\u00a0\u201977, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"9388_CR21","doi-asserted-by":"crossref","unstructured":"de\u00a0Moura, L.M., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: TACAS\u00a0\u201908, pp. 337\u2013340 (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"9388_CR22","unstructured":"Dutertre, B., de\u00a0Moura, L.M.: The Yices SMT solver. Tool paper at http:\/\/yices.csl.sri.com\/tool-paper (2006)"},{"key":"9388_CR23","unstructured":"Eclipse. http:\/\/www.eclipse.org\/"},{"key":"9388_CR24","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: SAT\u00a0\u201903, pp. 502\u2013518 (2004)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"9388_CR25","doi-asserted-by":"crossref","unstructured":"Emmes, F., Enger, T., Giesl, J.: Proving non-looping non-termination automatically. In: IJCAR\u00a0\u201912, pp. 225\u2013240 (2012)","DOI":"10.1007\/978-3-642-31365-3_19"},{"issue":"2\u20133","key":"9388_CR26","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10817-007-9087-9","volume":"40","author":"J Endrullis","year":"2008","unstructured":"Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. JAR 40(2\u20133), 195\u2013220 (2008)","journal-title":"JAR"},{"key":"9388_CR27","unstructured":"Falke, S., Kapur, D., Sinz, C.: Termination analysis of C programs using compiler intermediate languages. In: RTA\u00a0\u201911, pp. 41\u201350 (2011)"},{"key":"9388_CR28","unstructured":"Frohn, F., Giesl, J., Hensel, J., Aschermann, C., Str\u00f6der, T.: Inferring lower bounds for runtime complexity. In: RTA\u00a0\u201915, pp. 334\u2013349 (2015)"},{"key":"9388_CR29","doi-asserted-by":"crossref","unstructured":"Frohn, F., Naaf, M., Hensel, J., Brockschmidt, M., Giesl, J.: Lower runtime bounds for integer programs. In: IJCAR\u00a0\u201916, pp. 550\u2013567 (2016)","DOI":"10.1007\/978-3-319-40229-1_37"},{"key":"9388_CR30","doi-asserted-by":"crossref","unstructured":"Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R.,Zankl, H.: SAT solving for termination analysis with polynomial interpretations. In: SAT\u00a0\u201907, pp. 340\u2013354 (2007)","DOI":"10.1007\/978-3-540-72788-0_33"},{"key":"9388_CR31","doi-asserted-by":"crossref","unstructured":"Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal termination. In: RTA\u00a0\u201908, pp. 110\u2013125 (2008)","DOI":"10.1007\/978-3-540-70590-1_8"},{"key":"9388_CR32","doi-asserted-by":"crossref","unstructured":"Fuhs, C., Navarro-Marset, R., Otto, C., Giesl, J., Lucas, S., Schneider-Kamp, P.: Search techniques for rational polynomial orders. In: AISC\u00a0\u201908, pp. 109\u2013124 (2008)","DOI":"10.1007\/978-3-540-85110-3_10"},{"key":"9388_CR33","doi-asserted-by":"crossref","unstructured":"Fuhs, C., Giesl, J., Pl\u00fccker, M., Schneider-Kamp, P., Falke, S.: Proving termination of integer term rewriting. In: RTA\u00a0\u201909, pp. 32\u201347 (2009)","DOI":"10.1007\/978-3-642-02348-4_3"},{"issue":"2","key":"9388_CR34","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10817-010-9215-9","volume":"47","author":"C Fuhs","year":"2011","unstructured":"Fuhs, C., Giesl, J., Parting, M., Schneider-Kamp, P., Swiderski, S.: Proving termination by dependency pairs and inductive theorem proving. JAR 47(2), 133\u2013160 (2011)","journal-title":"JAR"},{"key":"9388_CR35","doi-asserted-by":"crossref","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: RTA\u00a0\u201904, pp. 210\u2013220 (2004)","DOI":"10.1007\/978-3-540-25979-4_15"},{"key":"9388_CR36","doi-asserted-by":"crossref","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: FroCoS\u00a0\u201905, pp. 216\u2013231 (2005)","DOI":"10.1007\/11559306_12"},{"issue":"3","key":"9388_CR37","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. JAR 37(3), 155\u2013203 (2006)","journal-title":"JAR"},{"key":"9388_CR38","doi-asserted-by":"crossref","unstructured":"Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: automatic termination proofs in the dependency pair framework. In: IJCAR\u00a0\u201906, pp. 281\u2013286 (2006)","DOI":"10.1007\/11814771_24"},{"key":"9388_CR39","doi-asserted-by":"crossref","unstructured":"Giesl, J., Thiemann, R., Swiderski, S., Schneider-Kamp, P.: Proving termination by bounded increase. In: CADE\u00a0\u201907, pp. 443\u2013459 (2007)","DOI":"10.1007\/978-3-540-73595-3_33"},{"issue":"2","key":"9388_CR40","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/1890028.1890030","volume":"33","author":"J Giesl","year":"2011","unstructured":"Giesl, J., Raffelsieper, M., Schneider-Kamp, P., Swiderski, S., Thiemann, R.: Automated termination proofs for Haskell by term rewriting. ACM TOPLAS 33(2), 7:1\u20137:39 (2011)","journal-title":"ACM TOPLAS"},{"key":"9388_CR41","doi-asserted-by":"crossref","unstructured":"Giesl, J., Str\u00f6der, T., Schneider-Kamp, P., Emmes, F., Fuhs, C.: Symbolic evaluation graphs and term rewriting\u2014a general methodology for analyzing logic programs. In: PPDP\u00a0\u201912, pp. 1\u201312 (2012)","DOI":"10.1145\/2370776.2370778"},{"key":"9388_CR42","doi-asserted-by":"crossref","unstructured":"Giesl, J., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Otto, C., Pl\u00fccker, M., Schneider-Kamp, P., Str\u00f6der, T., Swiderski, S., Thiemann, R.: Proving termination of programs automatically with AProVE. In: IJCAR\u00a0\u201914, pp. 184\u2013191 (2014)","DOI":"10.1007\/978-3-319-08587-6_13"},{"key":"9388_CR43","doi-asserted-by":"crossref","unstructured":"Hensel, J., Giesl, J., Frohn, F., Str\u00f6der, T.: Proving termination of programs with bitvector arithmetic by symbolic execution. In SEFM\u00a0\u201916, pp. 234\u2013252 (2016)","DOI":"10.1007\/978-3-319-41591-8_16"},{"issue":"2","key":"9388_CR44","first-page":"357","volume":"19","author":"A Koprowski","year":"2009","unstructured":"Koprowski, A., Waldmann, J.: Max\/plus tree automata for termination of term rewriting. Acta Cybern. 19(2), 357\u2013392 (2009)","journal-title":"Acta Cybern."},{"key":"9388_CR45","unstructured":"Lankford, D.: On proving term rewriting systems are Noetherian. Technical Report Memo MTP-3, Louisiana Technical University (1979)"},{"key":"9388_CR46","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis & transformation. In: CGO\u00a0\u201904, pp. 75\u201388 (2004)","DOI":"10.1109\/CGO.2004.1281665"},{"key":"9388_CR47","first-page":"59","volume":"7","author":"D Le Berre","year":"2010","unstructured":"Le Berre, D., Parrain, A.: The SAT4J library, release 2.2. JSAT 7, 59\u201364 (2010)","journal-title":"JSAT"},{"key":"9388_CR48","doi-asserted-by":"crossref","unstructured":"McMillan, K.: Lazy abstraction with interpolants. In: CAV\u00a0\u201906, pp. 123\u2013136 (2006)","DOI":"10.1007\/11817963_14"},{"issue":"1","key":"9388_CR49","first-page":"33","volume":"11","author":"MT Nguyen","year":"2011","unstructured":"Nguyen, M.T., De Schreye, D., Giesl, J., Schneider-Kamp, P.: Polytool: polynomial interpretations as a basis for termination analysis of logic programs. TPLP 11(1), 33\u201363 (2011)","journal-title":"TPLP"},{"key":"9388_CR50","volume-title":"Isabelle\/HOL\u2014A Proof Assistant for Higher-Order Logic","author":"T Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL\u2014A Proof Assistant for Higher-Order Logic. Springer, Berlin (2002)"},{"issue":"1","key":"9388_CR51","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10817-013-9277-6","volume":"51","author":"L Noschinski","year":"2013","unstructured":"Noschinski, L., Emmes, F., Giesl, J.: Analyzing innermost runtime complexity of term rewriting by dependency pairs. JAR 51(1), 27\u201356 (2013)","journal-title":"JAR"},{"key":"9388_CR52","doi-asserted-by":"crossref","unstructured":"Otto, C., Brockschmidt, M., von Essen, C., Giesl, J.: Automated termination analysis of Java Bytecode by term rewriting. In RTA\u00a0\u201910, pp. 259\u2013276 (2010)","DOI":"10.1007\/978-3-642-17172-7_2"},{"key":"9388_CR53","doi-asserted-by":"crossref","unstructured":"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: VMCAI\u00a0\u201904, pp. 239\u2013251 (2004)","DOI":"10.1007\/978-3-540-24622-0_20"},{"key":"9388_CR54","unstructured":"SMT-COMP. http:\/\/www.smt-comp.org\/"},{"issue":"5","key":"9388_CR55","first-page":"129","volume":"253","author":"F Spoto","year":"2009","unstructured":"Spoto, F., Lunjin, L., Mesnard, F.: Using CLP simplifications to improve Java Bytecode termination analysis. ENTCS 253(5), 129\u2013144 (2009)","journal-title":"ENTCS"},{"issue":"3","key":"9388_CR56","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/1709093.1709095","volume":"32","author":"F Spoto","year":"2010","unstructured":"Spoto, F., Mesnard, F., Payet, \u00c9.: A termination analyser for Java Bytecode based on path-length. ACM TOPLAS 32(3), 8:1\u20138:70 (2010)","journal-title":"ACM TOPLAS"},{"key":"9388_CR57","doi-asserted-by":"crossref","unstructured":"Str\u00f6der, T., Schneider-Kamp, P., Giesl, J.: Dependency triples for improving termination analysis of logic programs with cut. In: LOPSTR\u00a0\u201910, pp. 184\u2013199 (2011)","DOI":"10.1007\/978-3-642-20551-4_12"},{"key":"9388_CR58","doi-asserted-by":"crossref","unstructured":"Str\u00f6der, T., Giesl, J., Brockschmidt, M., Frohn, F., Fuhs, C., Hensel, J., Schneider-Kamp, P.: Proving termination and memory safety for programs with pointer arithmetic. In: IJCAR\u00a0\u201914, pp. 208\u2013223 (2014)","DOI":"10.1007\/978-3-319-08587-6_15"},{"key":"9388_CR59","doi-asserted-by":"crossref","unstructured":"Str\u00f6der, T., Aschermann, C., Frohn, F., Hensel, J., Giesl, J.: AProVE: termination and memory safety of C programs (competition contribution). In: TACAS\u00a0\u201915, pp. 417\u2013419 (2015)","DOI":"10.1007\/978-3-662-46681-0_32"},{"key":"9388_CR60","unstructured":"SV-COMP. http:\/\/sv-comp.sosy-lab.org\/"},{"issue":"2","key":"9388_CR61","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","volume":"14","author":"N Tamura","year":"2009","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints 14(2), 254\u2013272 (2009)","journal-title":"Constraints"},{"key":"9388_CR62","unstructured":"Termination Comp. http:\/\/termination-portal.org\/wiki\/Termination_Competition"},{"key":"9388_CR63","doi-asserted-by":"crossref","unstructured":"Thiemann, R., Sternagel, C.: Certification of termination proofs using CeTA. In: TPHOLs\u00a0\u201909, pp. 452\u2013468 (2009)","DOI":"10.1007\/978-3-642-03359-9_31"},{"issue":"2","key":"9388_CR64","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10817-009-9131-z","volume":"43","author":"H Zankl","year":"2009","unstructured":"Zankl, H., Hirokawa, N., Middeldorp, A.: KBO orientability. JAR 43(2), 173\u2013201 (2009)","journal-title":"JAR"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-016-9388-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10817-016-9388-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-016-9388-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T18:55:58Z","timestamp":1749668158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10817-016-9388-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,21]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9388"],"URL":"https:\/\/doi.org\/10.1007\/s10817-016-9388-y","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,21]]},"assertion":[{"value":"16 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}