{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:24Z","timestamp":1772163984098,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"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":[[2013,9,25]]},"DOI":"10.1145\/2500365.2500589","type":"proceedings-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T09:13:17Z","timestamp":1380100397000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["C-SHORe"],"prefix":"10.1145","author":[{"given":"Christopher","family":"Broadbent","sequence":"first","affiliation":[{"name":"LIAFA, Universite Paris Diderot -- Paris 7 & CNRS & University of Tokyo & Technische Universitat Munchen, Paris, Tokyo, Munich, Germany"}]},{"given":"Arnaud","family":"Carayol","sequence":"additional","affiliation":[{"name":"LIGM, Universite Paris-Est & CNRS, Paris, France"}]},{"given":"Matthew","family":"Hague","sequence":"additional","affiliation":[{"name":"Royal Holloway University of London & LIGM, Universite Paris-Est & LIAFA, Universite Paris Diderot -- Paris 7 & CNRS, London, United Kingdom"}]},{"given":"Olivier","family":"Serre","sequence":"additional","affiliation":[{"name":"LIAFA, Universite Paris Diderot -- Paris 7 & CNRS, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"FSTTCS","author":"Atig M. F.","year":"2010","unstructured":"M. F. Atig . Global model checking of ordered multi-pushdown systems . In FSTTCS , 2010 . M. F. Atig. Global model checking of ordered multi-pushdown systems. In FSTTCS, 2010."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503274"},{"key":"e_1_3_2_1_3_1","first-page":"1188","article-title":"Parties rationnelles du groupe libre. Comptes-Rendus de l'Acamdemie des Sciences de Paris","volume":"269","author":"Benois M.","year":"1969","unstructured":"M. Benois . Parties rationnelles du groupe libre. Comptes-Rendus de l'Acamdemie des Sciences de Paris , S\u00e9rie A , 269 : 1188 -- 1190 , 1969 . M. Benois. Parties rationnelles du groupe libre. Comptes-Rendus de l'Acamdemie des Sciences de Paris, S\u00e9rie A, 269:1188--1190, 1969.","journal-title":"S\u00e9rie A"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646732.701281"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30538-5_12"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.40"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_18"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759266"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.73"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.41"},{"key":"e_1_3_2_1_12_1","volume-title":"CAV","author":"Esparza J.","year":"2000","unstructured":"J. Esparza , D. Hansel , P. Rossmanith , and S. Schwoon . Efficient algorithms for model checking pushdown systems . In CAV , 2000 . J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In CAV, 2000."},{"key":"e_1_3_2_1_13_1","volume-title":"INFINITY","author":"Finkel A.","year":"1997","unstructured":"A. Finkel , B. Willems , and P. Wolper . A direct symbolic approach to model checking pushdown systems . In INFINITY , 1997 . A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. In INFINITY, 1997."},{"key":"e_1_3_2_1_14_1","volume-title":"Symbolic backwards-reachability analysis for higher-order pushdown systems. Logical Methods in Computer Science, 4(4)","author":"Hague M.","year":"2008","unstructured":"M. Hague and C.-H. L. Ong . Symbolic backwards-reachability analysis for higher-order pushdown systems. Logical Methods in Computer Science, 4(4) , 2008 . M. Hague and C.-H. L. Ong. Symbolic backwards-reachability analysis for higher-order pushdown systems. Logical Methods in Computer Science, 4(4), 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1928137.1928156"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.34"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_51"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_63"},{"key":"e_1_3_2_1_19_1","volume-title":"CAV","author":"Jhala R.","year":"2011","unstructured":"R. Jhala , R. Majumdar , and A. Rybalchenko . Hmc: Verifying functional programs using abstract interpreters . In CAV , 2011 . R. Jhala, R. Majumdar, and A. Rybalchenko. Hmc: Verifying functional programs using abstract interpreters. In CAV, 2011."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322016"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_117"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480933"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1599410.1599415"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.15"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987171.1987193"},{"key":"e_1_3_2_1_26_1","volume-title":"GTRECS2: A model checker for recursion schemes based on games and types. A tool","author":"Kobayashi N.","year":"2012","unstructured":"N. Kobayashi . GTRECS2: A model checker for recursion schemes based on games and types. A tool available at http:\/\/www-kb.is.s.u-tokyo.ac.jp\/~koba\/gtrecs2\/, 2012 . N. Kobayashi. GTRECS2: A model checker for recursion schemes based on games and types. A tool available at http:\/\/www-kb.is.s.u-tokyo.ac.jp\/~koba\/gtrecs2\/, 2012."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993525"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364578"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.38"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926453"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.009"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33512-9_2"},{"key":"e_1_3_2_1_34_1","first-page":"189","volume-title":"Two approaches to interprocedural data flow analysis","author":"Sharir M.","year":"1981","unstructured":"M. Sharir and A. Pnueli . Two approaches to interprocedural data flow analysis , chapter 7, pages 189 -- 234 . Prentice-Hall , 1981 . M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis, chapter 7, pages 189--234. Prentice-Hall, 1981."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11901914_13"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85114-1_19"},{"key":"e_1_3_2_1_38_1","volume-title":"APLAS","author":"Unno H.","year":"2010","unstructured":"H. Unno , N. Tabuchi , and N. Kobayashi . Verification of treeprocessing programs via higher-order model checking . In APLAS , 2010 . H. Unno, N. Tabuchi, and N. Kobayashi. Verification of treeprocessing programs via higher-order model checking. In APLAS, 2010."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034785"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","location":"Boston Massachusetts USA","acronym":"ICFP'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Northeastern University"]},"container-title":["Proceedings of the 18th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500589","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2500365.2500589","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:34:32Z","timestamp":1750217672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500589"}},"subtitle":["a collapsible approach to higher-order verification"],"short-title":[],"issued":{"date-parts":[[2013,9,25]]},"references-count":36,"alternative-id":["10.1145\/2500365.2500589","10.1145\/2500365"],"URL":"https:\/\/doi.org\/10.1145\/2500365.2500589","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544174.2500589","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,9,25]]},"assertion":[{"value":"2013-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}