{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:22:15Z","timestamp":1751660535133,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031280825"},{"type":"electronic","value":"9783031280832"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-28083-2_11","type":"book-chapter","created":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T09:03:07Z","timestamp":1678179787000},"page":"176-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["What Else is Undecidable About Loops?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8299-2714","authenticated-orcid":false,"given":"Laura","family":"Kov\u00e1cs","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5758-0657","authenticated-orcid":false,"given":"Anton","family":"Varonka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,8]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2007.10.025","volume":"391","author":"P Bell","year":"2008","unstructured":"Bell, P., Potapov, I.: On undecidability bounds for matrix decision problems. Theor. Comput. Sci. 391(1), 3\u201313 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.10.025","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2400676.2400679","volume":"34","author":"AM Ben-Amram","year":"2012","unstructured":"Ben-Amram, A.M., Genaim, S., Masud, A.N.: On the termination of integer loops. ACM Trans. Program. Lang. Syst. 34(4), 1\u201324 (2012). https:\/\/doi.org\/10.1145\/2400676.2400679","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-540-69738-1_27","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D Beyer","year":"2007","unstructured":"Beyer, D., Henzinger, T.A., Majumdar, R., Rybalchenko, A.: Invariant synthesis for combined theories. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 378\u2013394. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69738-1_27"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Bradley, A.R., Manna, Z.: The Calculus of Computation - Decision Procedures with Applications to Verification. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74113-8","DOI":"10.1007\/978-3-540-74113-8"},{"key":"11_CR5","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). https:\/\/doi.org\/10.1007\/978-3-540-30579-8_8"},{"key":"11_CR6","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). https:\/\/doi.org\/10.1007\/11817963_34"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Fu, H., Goharshady, A.K., Goharshady, E.K.: Polynomial invariant generation for non-deterministic recursive programs. In: PLDI 2020, pp. 672\u2013687 (2020). https:\/\/doi.org\/10.1145\/3385412.3385969","DOI":"10.1145\/3385412.3385969"},{"issue":"5","key":"11_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/1941487.1941509","volume":"54","author":"B Cook","year":"2011","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Proving program termination. Commun. ACM 54(5), 88\u201398 (2011). https:\/\/doi.org\/10.1145\/1941487.1941509","journal-title":"Commun. ACM"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL 1978, pp. 84\u201396 (1978). https:\/\/doi.org\/10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"11_CR10","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16721-3","volume-title":"Ideals, Varieties, and Algorithms","author":"DA Cox","year":"2015","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms. UTM, Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16721-3"},{"issue":"8","key":"11_CR11","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"EW Dijkstra","year":"1975","unstructured":"Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18(8), 453\u2013457 (1975). https:\/\/doi.org\/10.1145\/360933.360975","journal-title":"Commun. ACM"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103\u2013115. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055044"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Hark, M., Frohn, F., Giesl, J.: Polynomial loops: beyond termination. In: LPAR-23, vol. 73, pp. 279\u2013297 (2020). https:\/\/doi.org\/10.29007\/nxv1","DOI":"10.29007\/nxv1"},{"key":"11_CR14","unstructured":"Hosseini, M., Ouaknine, J., Worrell, J.: Termination of linear loops over the integers. In: ICALP 2019, pp. 118:1\u2013118:13 (2019). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/10694"},{"key":"11_CR15","unstructured":"Hrushovski, E., Ouaknine, J., Pouly, A., Worrell, J.: On strongest algebraic program invariants. J. ACM. (2019). https:\/\/people.mpi-sws.org\/~joel\/publications\/strongest_algebraic_invariants19abs.html"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-319-73721-8_11","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Humenberger","year":"2018","unstructured":"Humenberger, A., Jaroschek, M., Kov\u00e1cs, L.: Invariant generation for multi-path loops with polynomial assignments. In: VMCAI 2018. LNCS, vol. 10747, pp. 226\u2013246. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73721-8_11"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Karimov, T., et al.: What\u2019s decidable about linear loops? In: POPL 2022, pp. 1\u201325 (2022). https:\/\/doi.org\/10.1145\/3498727","DOI":"10.1145\/3498727"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M Karr","year":"1976","unstructured":"Karr, M.: Affine relationships among variables of a program. Acta Inf. 6(2), 133\u2013151 (1976). https:\/\/doi.org\/10.1007\/BF00268497","journal-title":"Acta Inf."},{"key":"11_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104785","volume":"281","author":"S Ko","year":"2021","unstructured":"Ko, S., Niskanen, R., Potapov, I.: Reachability problems in low-dimensional nondeterministic polynomial maps over integers. Inf. Comput. 281, 104785 (2021). https:\/\/doi.org\/10.1016\/j.ic.2021.104785","journal-title":"Inf. Comput."},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1006\/jcom.1999.0536","volume":"16","author":"P Koiran","year":"2000","unstructured":"Koiran, P.: The complexity of local dimensions for constructible sets. J. Complex. 16, 311\u2013323 (2000). https:\/\/doi.org\/10.1006\/jcom.1999.0536","journal-title":"J. Complex."},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-540-72504-6_49","volume-title":"Theory and Applications of Models of Computation","author":"SA Kurtz","year":"2007","unstructured":"Kurtz, S.A., Simon, J.: The undecidability of the generalized Collatz problem. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 542\u2013553. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72504-6_49"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Li, Y., Zhan, N., Chen, M., Lu, H., Wu, G., Katoen, J.P.: On termination of polynomial programs with equality conditions (2015). https:\/\/doi.org\/10.48550\/ARXIV.1510.05201","DOI":"10.48550\/ARXIV.1510.05201"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1007\/s11424-014-2145-6","volume":"27","author":"J Liu","year":"2014","unstructured":"Liu, J., Xu, M., Zhan, N., Zhao, H.: Discovering non-terminating inputs for multi-path polynomial programs. J. Syst. Sci. Complex. 27, 1286\u20131304 (2014). https:\/\/doi.org\/10.1007\/s11424-014-2145-6","journal-title":"J. Syst. Sci. Complex."},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1007\/978-3-540-27836-8_85","volume-title":"Automata, Languages and Programming","author":"M M\u00fcller-Olm","year":"2004","unstructured":"M\u00fcller-Olm, M., Seidl, H.: A note on Karr\u2019s algorithm. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1016\u20131028. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_85"},{"issue":"5","key":"11_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.ipl.2004.05.004","volume":"91","author":"M M\u00fcller-Olm","year":"2004","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Computing polynomial program invariants. Inf. Process. Lett. 91(5), 233\u2013244 (2004). https:\/\/doi.org\/10.1016\/j.ipl.2004.05.004","journal-title":"Inf. Process. Lett."},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Neary, T.: Undecidability in binary tag systems and the post correspondence problem for five pairs of words. In: STACS 2015, pp. 649\u2013661 (2015). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2015.649","DOI":"10.4230\/LIPIcs.STACS.2015.649"},{"issue":"2","key":"11_CR27","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2766189.2766191","volume":"2","author":"J Ouaknine","year":"2015","unstructured":"Ouaknine, J., Worrell, J.: On linear recurrence sequences and loop termination. ACM SIGLOG News 2(2), 4\u201313 (2015). https:\/\/doi.org\/10.1145\/2766189.2766191","journal-title":"ACM SIGLOG News"},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"264","DOI":"10.2307\/2267252","volume":"52","author":"EL Post","year":"1946","unstructured":"Post, E.L.: A variant of a recursively unsolvable problem. Bull. Am. Math. Soc. 52, 264\u2013268 (1946). https:\/\/doi.org\/10.2307\/2267252","journal-title":"Bull. Am. Math. Soc."},{"key":"11_CR29","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). https:\/\/doi.org\/10.1007\/978-3-540-27813-9_6"},{"issue":"11","key":"11_CR30","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/j.jsc.2010.06.006","journal-title":"J. Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-28083-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:39:41Z","timestamp":1710268781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-28083-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031280825","9783031280832"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-28083-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augsburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics20.lis-lab.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}