{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T14:09:09Z","timestamp":1746194949401},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319467498"},{"type":"electronic","value":"9783319467504"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-46750-4_3","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T22:11:57Z","timestamp":1474409517000},"page":"33-50","source":"Crossref","is-referenced-by-count":3,"title":["Termination of Single-Path Polynomial Loop Programs"],"prefix":"10.1007","author":[{"given":"Yi","family":"Li","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"3_CR1","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, pp. 229\u2013238. ACM, Madrid (2013)","DOI":"10.1145\/2505879.2505884"},{"key":"3_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":"3_CR3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.4204\/EPTCS.161.6","volume":"161","author":"A Ben-Amram","year":"2014","unstructured":"Ben-Amram, A.: The hardness of finding linear ranking functions for Lasso programs. Electron.Proc. Theor. Comput. Sci. 161, 32\u201345 (2014)","journal-title":"Electron.Proc. Theor. Comput. Sci."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Amram, A., Genaim, S.: On the linear ranking problem for integer linear-constraint loops. In: POPL 2013 Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 51\u201362. ACM, Rome (2013)","DOI":"10.1145\/2429069.2429078"},{"issue":"4","key":"3_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":"3_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: 10.1007\/11513988_48"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1007\/11523468_109","volume-title":"Automata, Languages and Programming","author":"AR Bradley","year":"2005","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: The polyranking principle. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1349\u20131361. Springer, Heidelberg (2005). doi: 10.1007\/11523468_109"},{"key":"3_CR8","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: 10.1007\/978-3-540-30579-8_8"},{"key":"3_CR9","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: 10.1007\/11817963_34"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Chen, C., Maza, M.: Quantifier elimination by cylindrical algebraic decomposition based on regular chains. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 91\u201398. ACM (2014)","DOI":"10.1145\/2608628.2608666"},{"key":"3_CR11","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: 10.1007\/978-3-642-33125-1_28"},{"key":"3_CR12","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: 10.1007\/978-3-540-75292-9_3"},{"key":"3_CR13","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\u00f3n","year":"2001","unstructured":"Col\u00f3n, 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: 10.1007\/3-540-45319-9_6"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-540-70545-1_32","volume-title":"Computer Aided Verification","author":"B Cook","year":"2008","unstructured":"Cook, B., Gulwani, S., Lev-Ami, T., Rybalchenko, A., Sagiv, M.: Proving conditional termination. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 328\u2013340. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-70545-1_32"},{"key":"3_CR15","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: 10.1007\/978-3-642-36742-7_4"},{"key":"3_CR16","volume-title":"Multidimensional Real Analysis","author":"J Duistermaat","year":"2004","unstructured":"Duistermaat, J., Kolk, J.: Multidimensional Real Analysis. Cambridge University Press, Cambridge (2004)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-39799-8_27","volume-title":"Computer Aided Verification","author":"P Ganty","year":"2013","unstructured":"Ganty, P., Genaim, S.: Proving termination starting from the end. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 397\u2013412. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39799-8_27"},{"key":"3_CR18","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, Heidelberg (2013). doi: 10.1007\/978-3-319-02444-8_26"},{"key":"3_CR19","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: 10.1007\/978-3-642-54862-8_12"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-642-54013-4_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"J Leike","year":"2014","unstructured":"Leike, J., Tiwari, A.: Synthesis for polynomial Lasso programs. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol. 8318, pp. 434\u2013452. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54013-4_24"},{"key":"3_CR21","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":"3_CR22","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: 10.1007\/978-3-540-24622-0_20"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Sohn, K., Van Gelder, A.: Termination detection in logic programs using argument sizes (extended abstract). In: Proceedings of the Tenth ACM SIGACT- SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 216-226. ACM, Association for Computing Machinery, Denver (1991)","DOI":"10.1145\/113413.113433"},{"key":"3_CR24","volume-title":"Convex Optimization","author":"B Stephen","year":"2004","unstructured":"Stephen, B., Lieven, V.: Convex Optimization. Cambridge University Press, New\u00a0York (2004)"},{"key":"3_CR25","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: 10.1007\/978-3-540-27813-9_6"},{"issue":"11","key":"3_CR26","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."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46750-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T19:17:19Z","timestamp":1498331839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46750-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319467498","9783319467504"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46750-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}