{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:51:20Z","timestamp":1725907880698},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662557501"},{"type":"electronic","value":"9783662557518"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55751-8_1","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:32:49Z","timestamp":1502796769000},"page":"3-10","source":"Crossref","is-referenced-by-count":2,"title":["Automata and Program Analysis"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laure","family":"Daviaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Zuleger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-40018-9_9","volume-title":"Programming Languages and Systems","author":"H Anderson","year":"2003","unstructured":"Anderson, H., Khoo, S.-C.: Affine-based size-change termination. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol. 2895, pp. 122\u2013140. Springer, Heidelberg (2003). doi:\n10.1007\/978-3-540-40018-9_9"},{"issue":"3","key":"1_CR2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/1353445.1353450","volume":"30","author":"AM Ben-Amram","year":"2008","unstructured":"Ben-Amram, A.M.: Size-change termination with difference constraints. ACM Trans. Program. Lang. Syst. 30(3), 16 (2008)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"1_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-7(3:4)2011","volume":"7","author":"AM Ben-Amram","year":"2011","unstructured":"Ben-Amram, A.M.: Monotonicity constraints for termination in the integer domain. Logical Methods Comput. Sci. 7(3), 1\u201343 (2011)","journal-title":"Logical Methods Comput. Sci."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-27940-9_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L Bozzelli","year":"2012","unstructured":"Bozzelli, L., Pinchinat, S.: Verification of gap-order constraint abstractions of counter systems. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 88\u2013103. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-27940-9_7"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-16242-8_16","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M Codish","year":"2010","unstructured":"Codish, M., Fuhs, C., Giesl, J., Schneider-Kamp, P.: Lazy abstraction for size-change termination. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 217\u2013232. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-16242-8_16"},{"issue":"4\u20135","key":"1_CR6","first-page":"503","volume":"11","author":"M Codish","year":"2011","unstructured":"Codish, M., Gonopolskiy, I., Ben-Amram, A.M., Fuhs, C., Giesl, J.: Sat-based termination analysis using monotonicity constraints over the integers. TPLP 11(4\u20135), 503\u2013520 (2011)","journal-title":"TPLP"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-662-44522-8_18","volume-title":"Mathematical Foundations of Computer Science 2014","author":"T Colcombet","year":"2014","unstructured":"Colcombet, T., Daviaud, L., Zuleger, F.: Size-change abstraction and max-plus automata. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8634, pp. 208\u2013219. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-44522-8_18"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-540-73595-3_34","volume-title":"Automated Deduction \u2013 CADE-21","author":"A Krauss","year":"2007","unstructured":"Krauss, A.: Certified size-change termination. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 460\u2013475. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-73595-3_34"},{"issue":"3","key":"1_CR9","first-page":"10:1","volume":"31","author":"CS Lee","year":"2009","unstructured":"Lee, C.S.: Ranking functions for size-change termination. ACM Trans. Program. Lang. Syst. 31(3), 10:1\u201310:42 (2009)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: POPL, pp. 81\u201392 (2001)","DOI":"10.1145\/360204.360210"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/11817963_36","volume-title":"Computer Aided Verification","author":"P Manolios","year":"2006","unstructured":"Manolios, P., Vroon, D.: Termination analysis with calling context graphs. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 401\u2013414. Springer, Heidelberg (2006). doi:\n10.1007\/11817963_36"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Vidal, G.: Quasi-terminating logic programs for ensuring the termination of partial evaluation. In: PEPM, pp. 51\u201360 (2007)","DOI":"10.1145\/1244381.1244390"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-319-20297-6_27","volume-title":"Computer Science \u2013 Theory and Applications","author":"F Zuleger","year":"2015","unstructured":"Zuleger, F.: Asymptotically precise ranking functions for deterministic size-change systems. In: Beklemishev, L.D., Musatov, D.V. (eds.) CSR 2015. LNCS, vol. 9139, pp. 426\u2013442. Springer, Cham (2015). doi:\n10.1007\/978-3-319-20297-6_27"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-23702-7_22","volume-title":"Static Analysis","author":"F Zuleger","year":"2011","unstructured":"Zuleger, F., Gulwani, S., Sinn, M., Veith, H.: Bound analysis of imperative programs with the size-change abstraction. In: Yahav, E. (ed.) SAS 2011. LNCS, vol. 6887, pp. 280\u2013297. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-23702-7_22"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55751-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:33:00Z","timestamp":1502796780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55751-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662557501","9783662557518"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55751-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}