{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T05:34:54Z","timestamp":1790832894017,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"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":[[2011,6,4]]},"DOI":"10.1145\/1993498.1993525","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T07:53:52Z","timestamp":1307346832000},"page":"222-233","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":97,"title":["Predicate abstraction and CEGAR for higher-order model checking"],"prefix":"10.1145","author":[{"given":"Naoki","family":"Kobayashi","sequence":"first","affiliation":[{"name":"Tohoku University, Sendai, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryosuke","family":"Sato","sequence":"additional","affiliation":[{"name":"Tohoku University, Sendai, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroshi","family":"Unno","sequence":"additional","affiliation":[{"name":"Tohoku University, Sendai, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378846"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057387.1057391"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503274"},{"key":"e_1_3_2_1_5_1","series-title":"LNCS","first-page":"298","volume-title":"CAV '07","author":"Barrett C.","year":"2007","unstructured":"C. Barrett and C. Tinelli . CVC3 . In CAV '07 , volume 4590 of LNCS , pages 298 -- 302 . Springer , July 2007 . C. Barrett and C. Tinelli. CVC3. In CAV '07, volume 4590 of LNCS, pages 298--302. Springer, July 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_29"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012996816178"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876643"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90009-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111059"},{"key":"e_1_3_2_1_12_1","series-title":"LNCS","first-page":"72","volume-title":"CAV '97","author":"Graf S.","year":"1997","unstructured":"S. Graf and H. Sa\u00efdi . Construction of abstract state graphs with PVS . In CAV '97 , volume 1254 of LNCS , pages 72 -- 83 . Springer , June 1997 . S. Graf and H. Sa\u00efdi. Construction of abstract state graphs with PVS. In CAV '97, volume 1254 of LNCS, pages 72--83. Springer, June 1997."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706353"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964021"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503279"},{"key":"e_1_3_2_1_16_1","volume-title":"Counterexample refinement for functional programs. Manuscript, available from http:\/\/www.cs.ucla.edu\/ rupak\/Papers\/CEGARFunctional.ps","author":"Jhala R.","year":"2009","unstructured":"R. Jhala and R. Majumdar . Counterexample refinement for functional programs. Manuscript, available from http:\/\/www.cs.ucla.edu\/ rupak\/Papers\/CEGARFunctional.ps , 2009 . R. Jhala and R. Majumdar. Counterexample refinement for functional programs. Manuscript, available from http:\/\/www.cs.ucla.edu\/ rupak\/Papers\/CEGARFunctional.ps, 2009."},{"key":"e_1_3_2_1_17_1","volume-title":"Refinement type inference via abstract interpretation. arXiv:1004.2884v1","author":"Jhala R.","year":"2010","unstructured":"R. Jhala , R. Majumdar , and A. Rybalchenko . Refinement type inference via abstract interpretation. arXiv:1004.2884v1 , 2010 . R. Jhala, R. Majumdar, and A. Rybalchenko. Refinement type inference via abstract interpretation. arXiv:1004.2884v1, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11691372_33"},{"key":"e_1_3_2_1_19_1","series-title":"LNCS","first-page":"205","volume-title":"FoSSaCS '02","author":"Knapik T.","year":"2002","unstructured":"T. Knapik , D. Niwinski , and P. Urzyczyn . Higher-order pushdown trees are easy . In FoSSaCS '02 , volume 2303 of LNCS , pages 205 -- 222 . Springer , 2002 . T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS '02, volume 2303 of LNCS, pages 205--222. Springer, 2002."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1599410.1599415"},{"key":"e_1_3_2_1_21_1","volume-title":"http:\/\/www.kb.ecei.tohoku.ac.jp\/koba\/trecs\/","author":"Kobayashi N.","year":"2009","unstructured":"N. Kobayashi . TRec S. http:\/\/www.kb.ecei.tohoku.ac.jp\/koba\/trecs\/ , 2009 . N. Kobayashi. TRecS. http:\/\/www.kb.ecei.tohoku.ac.jp\/koba\/trecs\/, 2009."},{"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","volume-title":"FoSSaCS '11","author":"Kobayashi N.","year":"2011","unstructured":"N. Kobayashi . A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes . In FoSSaCS '11 . Springer , 2011 . N. Kobayashi. A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes. In FoSSaCS '11. Springer, 2011."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.29"},{"key":"e_1_3_2_1_25_1","volume-title":"Predicate abstraction and CEGAR for higher-order model checking. An extended version, available from http:\/\/www.kb.ecei.tohoku.ac.jp\/ uhiro\/","author":"Kobayashi N.","year":"2011","unstructured":"N. Kobayashi , R. Sato , and H. Unno . Predicate abstraction and CEGAR for higher-order model checking. An extended version, available from http:\/\/www.kb.ecei.tohoku.ac.jp\/ uhiro\/ , 2011 . N. Kobayashi, R. Sato, and H. Unno. Predicate abstraction and CEGAR for higher-order model checking. An extended version, available from http:\/\/www.kb.ecei.tohoku.ac.jp\/ uhiro\/, 2011."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706355"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.07.003"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.38"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926453"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/800194.805852"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375602"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706315"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1599410.1599445"},{"key":"e_1_3_2_1_34_1","series-title":"LNCS","first-page":"312","volume-title":"APLAS '10","author":"Unno H.","year":"2010","unstructured":"H. Unno , N. Tabuchi , and N. Kobayashi . Verification of tree-processing programs via higher-order model checking . In APLAS '10 , volume 6461 of LNCS , pages 312 -- 327 . Springer , October\/December 2010 . H. Unno, N. Tabuchi, and N. Kobayashi. Verification of tree-processing programs via higher-order model checking. In APLAS '10, volume 6461 of LNCS, pages 312--327. Springer, October\/December 2010."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292560"}],"event":{"name":"PLDI '11: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"San Jose California USA","acronym":"PLDI '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993498.1993525","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993498.1993525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:05:46Z","timestamp":1750230346000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993498.1993525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":35,"alternative-id":["10.1145\/1993498.1993525","10.1145\/1993498"],"URL":"https:\/\/doi.org\/10.1145\/1993498.1993525","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1993316.1993525","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}