{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:05:39Z","timestamp":1742965539143,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319420189"},{"type":"electronic","value":"9783319420196"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42019-6_14","type":"book-chapter","created":{"date-parts":[[2016,6,26]],"date-time":"2016-06-26T22:04:53Z","timestamp":1466978693000},"page":"208-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Why Can\u2019t You Behave? Non-termination Analysis of Direct Recursive Rules with Constraints"],"prefix":"10.1007","author":[{"given":"Thom","family":"Fr\u00fchwirth","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1017\/S147106841000030X","volume":"10","author":"H Betz","year":"2010","unstructured":"Betz, H., Raiser, F., Fr\u00fchwirth, T.: A complete and terminating execution model for constraint handling rules. Theor. Pract. Log. Program. 10, 597\u2013610 (2010)","journal-title":"Theor. Pract. Log. Program."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-31762-0_9","volume-title":"Formal Verification of Object-Oriented Software","author":"M Brockschmidt","year":"2012","unstructured":"Brockschmidt, M., Str\u00f6der, T., Otto, C., Giesl, J.: Automated detection of non-termination and NullPointerExceptions for Java bytecode. In: Beckert, B., Damiani, F., Gurov, D. (eds.) FoVeOOS 2011. LNCS, vol. 7421, pp. 123\u2013141. Springer, Heidelberg (2012)"},{"unstructured":"Endrullis, J., Zantema, H.: Proving non-termination by finite automata. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 36. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)","key":"14_CR3"},{"key":"14_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609886","volume-title":"Constraint Handling Rules (Monography)","author":"T Fr\u00fchwirth","year":"2009","unstructured":"Fr\u00fchwirth, T.: Constraint Handling Rules (Monography). Cambridge University Press, Cambridge (2009)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-21542-6_2","volume-title":"Rule Technologies: Foundations, Tools, and Applications","author":"T Fr\u00fchwirth","year":"2015","unstructured":"Fr\u00fchwirth, T.: Constraint handling rules - what else? In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 13\u201334. Springer, Heidelberg (2015)"},{"doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T.: A devil\u2019s advocate against termination of direct recursion. In: Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, pp. 103\u2013113. ACM (2015)","key":"14_CR6","DOI":"10.1145\/2790449.2790518"},{"unstructured":"Fr\u00fchwirth, T.: The CHR Web Site. Ulm University (2016). \n                      www.constraint-handling-rules.org","key":"14_CR7"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/1328897.1328459","volume":"43","author":"A Gupta","year":"2008","unstructured":"Gupta, A., Henzinger, T.A., Majumdar, R., Rybalchenko, A., Xu, R.-G.: Proving non-termination. ACM Sigplan Not. 43(1), 147\u2013158 (2008)","journal-title":"ACM Sigplan Not."},{"doi-asserted-by":"crossref","unstructured":"Le, T.C., Qin, S., Chin, W.-N.: Termination and non-termination specification inference. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 489\u2013498. ACM (2015)","key":"14_CR9","DOI":"10.1145\/2813885.2737993"},{"issue":"4\u20135","key":"14_CR10","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1017\/S1471068413000446","volume":"13","author":"S Liang","year":"2013","unstructured":"Liang, S., Kifer, M.: A practical analysis of non-termination in large logic programs. Theor. Practi. Log. Program. 13(4\u20135), 705\u2013719 (2013)","journal-title":"Theor. Practi. Log. Program."},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.tcs.2008.05.013","volume":"403","author":"\u00c9 Payet","year":"2008","unstructured":"Payet, \u00c9.: Loop detection in term rewriting using the eliminating unfoldings. Theoret. Comput. Sci. 403(2), 307\u2013327 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"02","key":"14_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1017\/S1471068409003652","volume":"9","author":"\u00c9 Payet","year":"2009","unstructured":"Payet, \u00c9., Mesnard, F.: A non-termination criterion for binary constraint logic programs. Theor. Pract. Log. Program. 9(02), 145\u2013164 (2009)","journal-title":"Theor. Pract. Log. Program."},{"unstructured":"Payet, \u00c9., Mesnard, F., Spoto, F.: Non-termination analysis of Java bytecode (2014). CoRR abs\/1401.5292","key":"14_CR13"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-02846-5_21","volume-title":"Logic Programming","author":"D Voets","year":"2009","unstructured":"Voets, D., De Schreye, D.: A new approach to non-termination analysis of logic programs. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 220\u2013234. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Rule Technologies. Research, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42019-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:57:37Z","timestamp":1558313857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42019-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420189","9783319420196"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42019-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}