{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:48:25Z","timestamp":1770295705334,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,16]],"date-time":"2017-01-16T00:00:00Z","timestamp":1484524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K040049\/1"],"award-info":[{"award-number":["EP\/K040049\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1,16]]},"DOI":"10.1145\/3018610.3018623","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T21:20:29Z","timestamp":1482441629000},"page":"53-65","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Automatic cyclic termination proofs for recursive procedures in separation logic"],"prefix":"10.1145","author":[{"given":"Reuben N. S.","family":"Rowe","sequence":"first","affiliation":[{"name":"University College London, UK"}]},{"given":"James","family":"Brotherston","sequence":"additional","affiliation":[{"name":"University College London, UK"}]}],"member":"320","published-online":{"date-parts":[[2017,1,16]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"C YCLIST : software distribution. http:\/\/www. cyclist-prover.org\/.  C YCLIST : software distribution. http:\/\/www. cyclist-prover.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"www.github.com\/ngorogiannis\/cyclist\/releases.  www.github.com\/ngorogiannis\/cyclist\/releases."},{"key":"e_1_3_2_1_3_1","first-page":"132","volume-title":"Proceedings of FMCO-6","author":"Albert E.","year":"2007","unstructured":"E. Albert , P. Arenas , S. Genaim , G. Puebla , and D. Zanardini . COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode . In Proceedings of FMCO-6 , pages 113\u2013 132 , 2007 . E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode. In Proceedings of FMCO-6, pages 113\u2013132, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30538-5_9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_35"},{"key":"e_1_3_2_1_7_1","first-page":"663","volume-title":"Proceedings of ECOOP-29","author":"Bostr\u00f6m P.","year":"2015","unstructured":"P. Bostr\u00f6m and P. M\u00fcller . Modular Verification of Finite Blocking in Non-terminating Programs . In Proceedings of ECOOP-29 , pages 639\u2013 663 , 2015 . P. Bostr\u00f6m and P. M\u00fcller. Modular Verification of Finite Blocking in Non-terminating Programs. In Proceedings of ECOOP-29, pages 639\u2013663, 2015."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11554554_8"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","first-page":"103","volume-title":"Proc. SAS-14","author":"Brotherston J.","unstructured":"J. Brotherston . Formalised Inductive Reasoning in the Logic of Bunched Implications . In Proc. SAS-14 , volume 4634 of LNCS , pages 87\u2013 103 . Springer-Verlag, 2007. J. Brotherston. Formalised Inductive Reasoning in the Logic of Bunched Implications. In Proc. SAS-14, volume 4634 of LNCS, pages 87\u2013103. Springer-Verlag, 2007."},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","first-page":"84","volume-title":"SAS-21","author":"Brotherston J.","unstructured":"J. Brotherston and N. Gorogiannis . Cyclic Abduction of Inductively Defined Safety and Termination Preconditions . In SAS-21 , volume 8723 of LNCS , pages 68\u2013 84 . Springer, 2014. J. Brotherston and N. Gorogiannis. Cyclic Abduction of Inductively Defined Safety and Termination Preconditions. In SAS-21, volume 8723 of LNCS, pages 68\u201384. Springer, 2014."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exq052"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328453"},{"key":"e_1_3_2_1_13_1","series-title":"LNAI","first-page":"146","volume-title":"Proceedings of CADE-23","author":"Brotherston J.","unstructured":"J. Brotherston , D. Distefano , and R. L. Petersen . Automated Cyclic Entailment Proofs in Separation Logic . In Proceedings of CADE-23 , volume 6803 of LNAI , pages 131\u2013 146 . Springer, 2011. J. Brotherston, D. Distefano, and R. L. Petersen. Automated Cyclic Entailment Proofs in Separation Logic. In Proceedings of CADE-23, volume 6803 of LNAI, pages 131\u2013146. Springer, 2011."},{"key":"e_1_3_2_1_14_1","first-page":"367","volume-title":"Proceedings of APLAS-10","author":"Brotherston J.","unstructured":"J. Brotherston , N. Gorogiannis , and R. L. Petersen . A Generic Cyclic Theorem Prover . In Proceedings of APLAS-10 , LNCS, pages 350\u2013 367 . Springer, 2012. J. Brotherston, N. Gorogiannis, and R. L. Petersen. A Generic Cyclic Theorem Prover. In Proceedings of APLAS-10, LNCS, pages 350\u2013367. Springer, 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837621"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049700"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49498-1_8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/12.2.255"},{"key":"e_1_3_2_1_19_1","series-title":"Symposia in Applied Mathematics","first-page":"31","volume-title":"Amer. Math. Soc.","author":"Floyd R. W.","year":"1967","unstructured":"R. W. Floyd . Assigning Meanings to Programs . In Proc . Amer. Math. Soc. , volume 19 of Symposia in Applied Mathematics , pages 19\u2013 31 , 1967 . R. W. Floyd. Assigning Meanings to Programs. In Proc. Amer. Math. Soc., volume 19 of Symposia in Applied Mathematics, pages 19\u201331, 1967."},{"key":"e_1_3_2_1_20_1","first-page":"191","volume-title":"IJCAR-7","author":"Giesl J.","year":"2014","unstructured":"J. Giesl , M. Brockschmidt , F. Emmes , F. Frohn , C. Fuhs , C. Otto , M. Pl\u00fccker , P. Schneider-Kamp , T. Str\u00f6der , S. Swiderski , and R. Thiemann . Proving Termination of Programs Automatically with AProVE . In IJCAR-7 , pages 184\u2013 191 , 2014 . J. Giesl, M. Brockschmidt, F. Emmes, F. Frohn, C. Fuhs, C. Otto, M. Pl\u00fccker, P. Schneider-Kamp, T. Str\u00f6der, S. Swiderski, and R. Thiemann. Proving Termination of Programs Automatically with AProVE. In IJCAR-7, pages 184\u2013191, 2014."},{"key":"e_1_3_2_1_21_1","first-page":"688","volume-title":"Proc. ECOOP-29","author":"Jacobs B.","year":"2015","unstructured":"B. Jacobs , D. Bosnacki , and R. Kuiper . Modular Termination Verification . In Proc. ECOOP-29 , pages 664\u2013 688 , 2015 . B. Jacobs, D. Bosnacki, and R. Kuiper. Modular Termination Verification. In Proc. ECOOP-29, pages 664\u2013688, 2015."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737993"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360210"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1939141.1939161"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706326"},{"key":"e_1_3_2_1_27_1","first-page":"74","volume-title":"Separation Logic: A Logic for Shared Mutable Data Structures. In Proceedings of LICS-17","author":"Reynolds J. C.","unstructured":"J. C. Reynolds . Separation Logic: A Logic for Shared Mutable Data Structures. In Proceedings of LICS-17 , pages 55\u2013 74 . IEEE Computer Society, 2002. J. C. Reynolds. Separation Logic: A Logic for Shared Mutable Data Structures. In Proceedings of LICS-17, pages 55\u201374. IEEE Computer Society, 2002."},{"key":"e_1_3_2_1_28_1","series-title":"LNCS","first-page":"371","volume-title":"Proc. FOSSACS","author":"Santocanale L.","unstructured":"L. Santocanale . A Calculus of Circular Proofs and its Categorical Semantics . In Proc. FOSSACS , volume 2303 of LNCS , pages 357\u2013 371 . Springer-Verlag, 2002. L. Santocanale. A Calculus of Circular Proofs and its Categorical Semantics. In Proc. FOSSACS, volume 2303 of LNCS, pages 357\u2013371. Springer-Verlag, 2002."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1709093.1709095"},{"key":"e_1_3_2_1_30_1","series-title":"LNCS","first-page":"440","volume-title":"Proceedings of FOSSACS-6","author":"Sprenger C.","unstructured":"C. Sprenger and M. Dam . On the Structure of Inductive Reasoning: Circular and Tree-shaped Proofs in the \u00b5-calculus . In Proceedings of FOSSACS-6 , volume 2620 of LNCS , pages 425\u2013 440 . Springer-Verlag, 2003. C. Sprenger and M. Dam. On the Structure of Inductive Reasoning: Circular and Tree-shaped Proofs in the \u00b5-calculus. In Proceedings of FOSSACS-6, volume 2620 of LNCS, pages 425\u2013440. Springer-Verlag, 2003."},{"issue":"4","key":"e_1_3_2_1_31_1","first-page":"365","article-title":"On Global Induction Mechanisms in a \u00b5-calculus with Explicit Approximations","volume":"37","author":"Sprenger C.","year":"2003","unstructured":"C. Sprenger and M. Dam . On Global Induction Mechanisms in a \u00b5-calculus with Explicit Approximations . ITA , 37 ( 4 ): 365 \u2013 391 , 2003 . C. Sprenger and M. Dam. On Global Induction Mechanisms in a \u00b5-calculus with Explicit Approximations. ITA, 37(4): 365\u2013391, 2003.","journal-title":"ITA"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10431-7_3"},{"key":"e_1_3_2_1_33_1","unstructured":"TPDB. Termination Problems Database. http:\/\/ termination-portal.org\/wiki\/TPDB.  TPDB. Termination Problems Database. http:\/\/ termination-portal.org\/wiki\/TPDB."},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. London Math. Soc.","author":"Turing A. M.","year":"1937","unstructured":"A. M. Turing . On Computable Numbers , with an Application to the Entscheidungsproblem . Proc. London Math. Soc. , 1937 . A. M. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London Math. Soc., 1937."},{"key":"e_1_3_2_1_35_1","first-page":"416","volume-title":"Proc. FOSSACS-5","author":"Yang H.","unstructured":"H. Yang and P. O\u2019Hearn . A Semantic Basis for Local Reasoning . In Proc. FOSSACS-5 , pages 402\u2013 416 . Springer, 2002. H. Yang and P. O\u2019Hearn. A Semantic Basis for Local Reasoning. In Proc. FOSSACS-5, pages 402\u2013416. Springer, 2002."}],"event":{"name":"CPP '17: Certified Proofs and Programs","location":"Paris France","acronym":"CPP '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation"]},"container-title":["Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018610.3018623","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3018610.3018623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:59Z","timestamp":1750220639000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018610.3018623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,16]]},"references-count":35,"alternative-id":["10.1145\/3018610.3018623","10.1145\/3018610"],"URL":"https:\/\/doi.org\/10.1145\/3018610.3018623","relation":{},"subject":[],"published":{"date-parts":[[2017,1,16]]},"assertion":[{"value":"2017-01-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}