{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:58Z","timestamp":1750306258286,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,2]],"date-time":"2017-01-02T00:00:00Z","timestamp":1483315200000},"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":[[2017,1,2]]},"DOI":"10.1145\/3018882.3018886","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T21:20:29Z","timestamp":1482441629000},"page":"59-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Verification of code generators via higher-order model checking"],"prefix":"10.1145","author":[{"given":"Takashi","family":"Suwa","sequence":"first","affiliation":[{"name":"University of Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tsukada","sequence":"additional","affiliation":[{"name":"University of Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Kobayashi","sequence":"additional","affiliation":[{"name":"University of Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsushi","family":"Igarashi","sequence":"additional","affiliation":[{"name":"Kyoto University, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,1,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Program logics for homogeneous generative run-time meta-programming. Logical Methods in Computer Science, 11(1)","author":"Berger M.","year":"2015","unstructured":"M. Berger and L. Tratt . Program logics for homogeneous generative run-time meta-programming. Logical Methods in Computer Science, 11(1) , 2015 . M. Berger and L. Tratt. Program logics for homogeneous generative run-time meta-programming. Logical Methods in Computer Science, 11(1), 2015."},{"key":"e_1_3_2_1_2_1","first-page":"148","volume-title":"Proceedings of CSL 2013","volume":"23","author":"Broadbent C. H.","year":"2013","unstructured":"C. H. Broadbent and N. Kobayashi . Saturation-based model checking of higher-order recursion schemes . In Proceedings of CSL 2013 , volume 23 of LIPIcs, pages 129\u2013 148 , 2013 . C. H. Broadbent and N. Kobayashi. Saturation-based model checking of higher-order recursion schemes. In Proceedings of CSL 2013, volume 23 of LIPIcs, pages 129\u2013148, 2013."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004598"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/954186.954190"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944730"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926397"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190257"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/788018.788825"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/788018.788825"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/382780.382785"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244381.1244400"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057387.1057390"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111060"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480933"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487241.2487246"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_24"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993525"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706355"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060809"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680500568X"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.38"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926453"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535873"},{"key":"e_1_3_2_1_24_1","first-page":"183","volume-title":"TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings","volume":"6690","author":"Rehof J.","unstructured":"J. Rehof and P. Urzyczyn . Finite combinatory logic with intersection types. In Typed Lambda Calculi and Applications - 10th International Conference , TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings , volume 6690 , pages 169\u2013 183 . Springer, 2011. J. Rehof and P. Urzyczyn. Finite combinatory logic with intersection types. In Typed Lambda Calculi and Applications - 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings, volume 6690, pages 169\u2013183. Springer, 2011."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2426890.2426900"},{"key":"e_1_3_2_1_26_1","first-page":"227","volume-title":"CEFP 2007","author":"Sheard T.","year":"2007","unstructured":"T. Sheard and N. Linger . Programming in \u03a9mega. In Central European Functional Programming School, Second Summer School , CEFP 2007 , pages 158\u2013 227 , 2007 . T. Sheard and N. Linger. Programming in \u03a9mega. In Central European Functional Programming School, Second Summer School, CEFP 2007, pages 158\u2013227, 2007."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268970"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/328690.328697"},{"key":"e_1_3_2_1_29_1","unstructured":"W. Taha Z. E.-A. Benaissa and T. Sheard. Multi-stage programming: Axiomatization and type-safety.  W. Taha Z. E.-A. Benaissa and T. Sheard. Multi-stage programming: Axiomatization and type-safety."},{"key":"e_1_3_2_1_30_1","unstructured":"In\n      Proc\n    .25th \n      International Colloquium\n       on \n      Automata Languages and Programming (ICALP\u201998) volume \n  1443\n   of \n  LNCS pages 918\u2013\n  929 Aalborg Denmark July \n  1998\n  .  In Proc.25th International Colloquium on Automata Languages and Programming (ICALP\u201998) volume 1443 of LNCS pages 918\u2013929 Aalborg Denmark July 1998."},{"key":"e_1_3_2_1_31_1","unstructured":"Springer.  Springer."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604134"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/258993.259019"},{"key":"e_1_3_2_1_34_1","volume-title":"Dec.","author":"Tsukada T.","year":"2010","unstructured":"T. Tsukada and A. Igarashi . A logical foundation for environment classifiers. Logical Methods in Computer Science, 6(4:8):1\u201343 , Dec. 2010 . T. Tsukada and A. Igarashi. A logical foundation for environment classifiers. Logical Methods in Computer Science, 6(4:8):1\u201343, Dec. 2010."},{"key":"e_1_3_2_1_35_1","series-title":"LNCS","first-page":"327","volume-title":"Proceedings of APLAS","author":"Unno H.","year":"2010","unstructured":"H. Unno , N. Tabuchi , and N. Kobayashi . Verification of treeprocessing programs via higher-order model checking . In Proceedings of APLAS 2010 , volume 6461 of LNCS , pages 312\u2013 327 . Springer, 2010. H. Unno, N. Tabuchi, and N. Kobayashi. Verification of treeprocessing programs via higher-order model checking. In Proceedings of APLAS 2010, volume 6461 of LNCS, pages 312\u2013327. Springer, 2010."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140335.1140360"}],"event":{"name":"POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Paris France","acronym":"POPL '17"},"container-title":["Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018882.3018886","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3018882.3018886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:12Z","timestamp":1750220652000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018882.3018886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,2]]},"references-count":36,"alternative-id":["10.1145\/3018882.3018886","10.1145\/3018882"],"URL":"https:\/\/doi.org\/10.1145\/3018882.3018886","relation":{},"subject":[],"published":{"date-parts":[[2017,1,2]]},"assertion":[{"value":"2017-01-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}