{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T14:09:26Z","timestamp":1746194966023,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319694825"},{"type":"electronic","value":"9783319694832"}],"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-319-69483-2_8","type":"book-chapter","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T07:34:48Z","timestamp":1508139288000},"page":"131-146","source":"Crossref","is-referenced-by-count":4,"title":["Termination of Semi-algebraic Loop Programs"],"prefix":"10.1007","author":[{"given":"Yi","family":"Li","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,17]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Bagnara, R., Mesnard, F.: Eventual linear ranking functions. In: Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming. Madrid, Spain, pp. 229\u2013238. ACM (2013)","key":"8_CR1","DOI":"10.1145\/2505879.2505884"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ic.2012.03.003","volume":"215","author":"R Bagnara","year":"2012","unstructured":"Bagnara, R., Mesnard, F., Pescetti, A., Zaffanella, E.: A new look at the automatic synthesis of linear ranking functions. Inf. Comput. 215, 47\u201367 (2012)","journal-title":"Inf. Comput."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-319-63390-9_32","volume-title":"Computer Aided Verification","author":"AM Ben-Amram","year":"2017","unstructured":"Ben-Amram, A.M., Genaim, S.: On multiphase-linear ranking functions. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 601\u2013620. Springer, Cham (2017). doi:\n10.1007\/978-3-319-63390-9_32"},{"doi-asserted-by":"crossref","unstructured":"Ben-Amram, A., Genaim, S.: On the linear ranking problem for integer linear-constraint loops. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2013), Rome, Italy, pp. 51\u201362. ACM (2013)","key":"8_CR4","DOI":"10.1145\/2429069.2429078"},{"issue":"4","key":"8_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2629488","volume":"61","author":"A Ben-Amram","year":"2014","unstructured":"Ben-Amram, A., Genaim, S.: Ranking functions for linear-constraint loops. J. ACM 61(4), 1\u201355 (2014)","journal-title":"J. ACM"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/11513988_48","volume-title":"Computer Aided Verification","author":"AR Bradley","year":"2005","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: Linear ranking with reachability. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 491\u2013504. Springer, Heidelberg (2005). doi:\n10.1007\/11513988_48"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-30579-8_8","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"AR Bradley","year":"2005","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: Termination of polynomial programs. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 113\u2013129. Springer, Heidelberg (2005). doi:\n10.1007\/978-3-540-30579-8_8"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/11817963_34","volume-title":"Computer Aided Verification","author":"M Braverman","year":"2006","unstructured":"Braverman, M.: Termination of integer linear programs. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 372\u2013385. Springer, Heidelberg (2006). doi:\n10.1007\/11817963_34"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-33125-1_28","volume-title":"Static Analysis","author":"HY Chen","year":"2012","unstructured":"Chen, H.Y., Flur, S., Mukhopadhyay, S.: Termination proofs for linear simple loops. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 422\u2013438. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-33125-1_28"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-75292-9_3","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2007","author":"Y Chen","year":"2007","unstructured":"Chen, Y., Xia, B., Yang, L., Zhan, N., Zhou, C.: Discovering non-linear ranking functions by solving semi-algebraic systems. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 34\u201349. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-75292-9_3"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45319-9_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"MA Col\u00f3on","year":"2001","unstructured":"Col\u00f3on, M.A., Sipma, H.B.: Synthesis of linear ranking functions. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 67\u201381. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-45319-9_6"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-36742-7_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Cook","year":"2013","unstructured":"Cook, B., See, A., Zuleger, F.: Ramsey vs. lexicographic termination proving. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 47\u201361. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-36742-7_4"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30579-8_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P Cousot","year":"2005","unstructured":"Cousot, P.: Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 1\u201324. Springer, Heidelberg (2005). doi:\n10.1007\/978-3-540-30579-8_1"},{"key":"8_CR14","volume-title":"Multidimensional Real Analysis","author":"J Duistermaat","year":"2004","unstructured":"Duistermaat, J., Kolk, J.: Multidimensional Real Analysis. Cambridge University Press, Cambridge (2004)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-319-02444-8_26","volume-title":"Automated Technology for Verification and Analysis","author":"M Heizmann","year":"2013","unstructured":"Heizmann, M., Hoenicke, J., Leike, J., Podelski, A.: Linear ranking for linear lasso programs. In: Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 365\u2013380. Springer, Cham (2013). doi:\n10.1007\/978-3-319-02444-8_26"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-642-54862-8_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Leike","year":"2014","unstructured":"Leike, J., Heizmann, M.: Ranking templates for linear loops. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 172\u2013186. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-642-54862-8_12"},{"doi-asserted-by":"crossref","unstructured":"Li, Y., Zhu, G., Feng, Y.: The L-depth eventual linear ranking functions for single-path linear constraints loops. In: 10th International Symposium on Theoretical Aspects of Software Engineering (TASE 2016), pp. 30\u201337. IEEE (2016)","key":"8_CR17","DOI":"10.1109\/TASE.2016.8"},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tcs.2017.03.036","volume":"681","author":"Y Li","year":"2017","unstructured":"Li, Y.: Witness to non-termination of linear programs. Theor. Comput. Sci. 681, 75\u2013100 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR19","first-page":"1284","volume":"27","author":"J Liu","year":"2014","unstructured":"Liu, J., Xu, M., Zhan, N.J., Zhao, H.J.: Discovering non-terminating inputs for multi-path polynomial programs. J. Syst. Sci. Complex. 27, 1284\u20131304 (2014)","journal-title":"J. Syst. Sci. Complex."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-24622-0_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Podelski","year":"2004","unstructured":"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239\u2013251. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-24622-0_20"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-27813-9_6","volume-title":"Computer Aided Verification","author":"A Tiwari","year":"2004","unstructured":"Tiwari, A.: Termination of linear programs. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 70\u201382. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-27813-9_6"},{"issue":"11","key":"8_CR22","doi-asserted-by":"crossref","first-page":"1234","DOI":"10.1016\/j.jsc.2010.06.006","volume":"45","author":"B Xia","year":"2010","unstructured":"Xia, B., Zhang, Z.: Termination of linear programs with nonlinear constraints. J. Symb. Comput. 45(11), 1234\u20131249 (2010)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"8_CR23","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00165-009-0144-5","volume":"23","author":"B Xia","year":"2011","unstructured":"Xia, B., Yang, L., Zhan, N., Zhang, Z.: Symbolic decision procedure for termination of linear programs. Formal Aspects Comput. 23(2), 171\u2013190 (2011)","journal-title":"Formal Aspects Comput."}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69483-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T07:37:20Z","timestamp":1508139440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69483-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319694825","9783319694832"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69483-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}