{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:04Z","timestamp":1750306384100,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,14]],"date-time":"2015-07-14T00:00:00Z","timestamp":1436832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,14]]},"DOI":"10.1145\/2790449.2790518","type":"proceedings-article","created":{"date-parts":[[2015,6,29]],"date-time":"2015-06-29T18:10:47Z","timestamp":1435601447000},"page":"103-113","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A devil's advocate against termination of direct recursion"],"prefix":"10.1145","author":[{"given":"Thom","family":"Fr\u00fchwirth","sequence":"first","affiliation":[{"name":"University of Ulm, Germany"}]}],"member":"320","published-online":{"date-parts":[[2015,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/647485.726326"},{"key":"e_1_3_2_1_2_1","volume-title":"5th International Conference on Principles and Practice of Constraint Programming, CP99","author":"Abdennadher S.","year":"1999","unstructured":"S. Abdennadher and T. Fr\u00fchwirth . Operational equivalence of constraint handling rules . In 5th International Conference on Principles and Practice of Constraint Programming, CP99 , LNCS 1713. Springer , 1999 . S. Abdennadher and T. Fr\u00fchwirth. Operational equivalence of constraint handling rules. In 5th International Conference on Principles and Practice of Constraint Programming, CP99, LNCS 1713. Springer, 1999."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841000030X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31762-0_9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54862-8_11"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941487.1941509"},{"key":"e_1_3_2_1_7_1","volume-title":"QAPL '01: Proc. First Intl. Workshop on Quantitative Aspects of Programming Languages","volume":"2002","author":"Fr\u00fchwirth T.","unstructured":"T. Fr\u00fchwirth . As time goes by II: More automatic complexity analysis of concurrent rule programs. In A. D. Pierro and H. Wiklicky, editors , QAPL '01: Proc. First Intl. Workshop on Quantitative Aspects of Programming Languages , volume 59(3) of ENTCS. Elsevier, 2002 . T. Fr\u00fchwirth. As time goes by II: More automatic complexity analysis of concurrent rule programs. In A. D. Pierro and H. Wiklicky, editors, QAPL '01: Proc. First Intl. Workshop on Quantitative Aspects of Programming Languages, volume 59(3) of ENTCS. Elsevier, 2002."},{"key":"e_1_3_2_1_8_1","first-page":"547","volume-title":"KR '02: Proc. 8th Intl. Conf. Princ. Knowledge Representation and Reasoning","author":"Fr\u00fchwirth T.","year":"2002","unstructured":"T. Fr\u00fchwirth . As time goes by: Automatic complexity analysis of simplification rules. In D. Fensel, F. Giunchiglia, D. McGuinness, and M.-A. Williams, editors , KR '02: Proc. 8th Intl. Conf. Princ. Knowledge Representation and Reasoning , pages 547 -- 557 . Morgan Kaufmann , Apr. 2002 . T. Fr\u00fchwirth. As time goes by: Automatic complexity analysis of simplification rules. In D. Fensel, F. Giunchiglia, D. McGuinness, and M.-A. Williams, editors, KR '02: Proc. 8th Intl. Conf. Princ. Knowledge Representation and Reasoning, pages 547--557. Morgan Kaufmann, Apr. 2002."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609886"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11559306_12"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328897.1328459"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000446"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.013"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119479.1119481"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068409003652"},{"key":"e_1_3_2_1_16_1","volume-title":"CoRR abs\/1401.5292","author":"Mesnard F.","year":"2014","unstructured":"\u00c9. Payet, F. Mesnard , and F. Spoto . Non-termination analysis of Java bytecode , CoRR abs\/1401.5292 , 2014 . \u00c9. Payet, F. Mesnard, and F. Spoto. Non-termination analysis of Java bytecode, CoRR abs\/1401.5292, 2014."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_43"},{"key":"e_1_3_2_1_18_1","first-page":"34","volume-title":"6th International Workshop on Constraint Handling Rules (CHR)","author":"Raiser F.","year":"2009","unstructured":"F. Raiser , H. Betz , and T. Fr\u00fchwirth . Equivalence of CHR states revisited. In F. Raiser and J. Sneyers, editors , 6th International Workshop on Constraint Handling Rules (CHR) , pages 34 -- 48 , 2009 . F. Raiser, H. Betz, and T. Fr\u00fchwirth. Equivalence of CHR states revisited. In F. Raiser and J. Sneyers, editors, 6th International Workshop on Constraint Handling Rules (CHR), pages 34--48, 2009."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792786.1792799"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02846-5_21"}],"event":{"name":"PPDP '15: 17th International Symposium on Principles and Practice of Declarative Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Siena Italy","acronym":"PPDP '15"},"container-title":["Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2790449.2790518","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2790449.2790518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:06Z","timestamp":1750223226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2790449.2790518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,14]]},"references-count":20,"alternative-id":["10.1145\/2790449.2790518","10.1145\/2790449"],"URL":"https:\/\/doi.org\/10.1145\/2790449.2790518","relation":{},"subject":[],"published":{"date-parts":[[2015,7,14]]},"assertion":[{"value":"2015-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}