{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:35:01Z","timestamp":1743057301782,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031191343"},{"type":"electronic","value":"9783031191350"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19135-0_8","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T23:03:49Z","timestamp":1665529429000},"page":"108-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Higher-Order Reachability Games Vs May Reachability"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8782-2119","authenticated-orcid":false,"given":"Kazuyuki","family":"Asada","sequence":"first","affiliation":[]},{"given":"Hiroyuki","family":"Katsura","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0537-0604","authenticated-orcid":false,"given":"Naoki","family":"Kobayashi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Asada, K., Katsura, H., Kobayashi, N.: On higher-order reachability games vs may reachability. CoRR abs\/2203.08416 (2022). https:\/\/doi.org\/10.48550\/arXiv.2203.08416","DOI":"10.48550\/arXiv.2203.08416"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Asada, K., Kobayashi, N.: On word and frontier languages of unsafe higher-order grammars. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, 11\u201315 July 2016, Rome, Italy. LIPIcs, vol. 55, pp. 111:1\u2013111:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.111","DOI":"10.4230\/LIPIcs.ICALP.2016.111"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Asada, K., Kobayashi, N.: Size-preserving translations from order-(n+1) word grammars to order-n tree grammars. In: Ariola, Z.M. (ed.) 5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020, June 29\u2013July 6 2020, Paris, France (Virtual Conference). LIPIcs, vol. 167, pp. 22:1\u201322:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2020.22","DOI":"10.4230\/LIPIcs.FSCD.2020.22"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Burn, T.C., Ong, C.L., Ramsay, S.J.: Higher-order constrained Horn clauses for verification. Proc. ACM Program. Lang. 2(POPL), 11:1\u201311:28 (2018). https:\/\/doi.org\/10.1145\/3158099","DOI":"10.1145\/3158099"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Champion, A., Chiba, T., Kobayashi, N., Sato, R.: ICE-based refinement type discovery for higher-order functional programs. J. Autom. Reason. 64(7), 1393\u20131418 (2020). https:\/\/doi.org\/10.1007\/s10817-020-09571-y","DOI":"10.1007\/s10817-020-09571-y"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Champion, A., Kobayashi, N., Sato, R.: HoIce: An ICE-based non-linear horn clause solver. In: Ryu, S. (ed.) Programming Languages and Systems - 16th Asian Symposium, APLAS 2018, Wellington, New Zealand, December 2\u20136, 2018, Proceedings. Lecture Notes in Computer Science, vol. 11275, pp. 146\u2013156. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-02768-1_8","DOI":"10.1007\/978-3-030-02768-1_8"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","volume":"20","author":"W Damm","year":"1982","unstructured":"Damm, W.: The IO- and OI-hierarchies. Theor. Comput. Sci. 20, 95\u2013207 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research, LNCS","author":"E Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T.: Automata, Logics, and Infinite Games: A Guide to Current Research, LNCS, vol. 2500. Springer, Cham (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Hojjat, H., R\u00fcmmer, P.: The ELDARICA horn solver. In: 2018 Formal Methods in Computer Aided Design (FMCAD), pp. 1\u20137 (2018)","DOI":"10.23919\/FMCAD.2018.8603013"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-030-65474-0_7","volume-title":"Static Analysis","author":"N Iwayama","year":"2020","unstructured":"Iwayama, N., Kobayashi, N., Suzuki, R., Tsukada, T.: Predicate abstraction and CEGAR for $$\\nu $$HFL$$_Z$$ validity checking. In: Pichardie, D., Sighireanu, M. (eds.) SAS 2020. LNCS, vol. 12389, pp. 134\u2013155. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65474-0_7"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-64437-6_5","volume-title":"Programming Languages and Systems","author":"H Katsura","year":"2020","unstructured":"Katsura, H., Iwayama, N., Kobayashi, N., Tsukada, T.: A new refinement type system for\u00a0automated $$\\nu $$HFL$$_Z$$ validity checking. In: Oliveira, B.C.S. (ed.) APLAS 2020. LNCS, vol. 12470, pp. 86\u2013104. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64437-6_5"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Dal Lago, U., Grellois, C.: On the termination problem for probabilistic higher-order recursive programs. In: Proceedings of LICS 2019. IEEE (2019)","DOI":"10.1109\/LICS.2019.8785679"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-030-32304-2_20","volume-title":"Static Analysis","author":"N Kobayashi","year":"2019","unstructured":"Kobayashi, N., Nishikawa, T., Igarashi, A., Unno, H.: Temporal verification of programs via first-order fixpoint logic. In: Chang, B.-Y.E. (ed.) SAS 2019. LNCS, vol. 11822, pp. 413\u2013436. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_20"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-02930-1_19","volume-title":"Automata, Languages and Programming","author":"N Kobayashi","year":"2009","unstructured":"Kobayashi, N., Ong, C.-H.L.: Complexity of model checking recursion schemes for fragments of the modal mu-calculus. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 223\u2013234. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_19"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Sato, R., Unno, H.: Predicate abstraction and CEGAR for higher-order model checking. In: PLDI 2011, pp. 222\u2013233. ACM Press (2011)","DOI":"10.1145\/1993316.1993525"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-319-89884-1_25","volume-title":"Programming Languages and Systems","author":"N Kobayashi","year":"2018","unstructured":"Kobayashi, N., Tsukada, T., Watanabe, K.: Higher-order program verification via HFL model checking. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 711\u2013738. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_25"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10703-016-0249-4","volume":"48","author":"A Komuravelli","year":"2016","unstructured":"Komuravelli, A., Gurfinkel, A., Chaki, S.: SMT-based model checking for recursive programs. Formal Methods Syst. Des. 48(3), 175\u2013205 (2016). https:\/\/doi.org\/10.1007\/s10703-016-0249-4","journal-title":"Formal Methods Syst. Des."},{"key":"8_CR18","unstructured":"Ong, C.H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS 2006, pp. 81\u201390. IEEE Computer Society Press (2006)"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Parys, P.: Higher-order model checking step by step. In: Bansal, N., Merelli, E., Worrell, J. (eds.) 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12\u201316, 2021, Glasgow, Scotland (Virtual Conference). LIPIcs, vol. 198, pp. 140:1\u2013140:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.140","DOI":"10.4230\/LIPIcs.ICALP.2021.140"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Rondon, P.M., Kawaguchi, M., Jhala, R.: Liquid types. In: PLDI 2008, pp. 159\u2013169 (2008)","DOI":"10.1145\/1379022.1375602"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Satake, Y., Unno, H., Yanagi, H.: Probabilistic inference for predicate constraint satisfaction. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, pp. 1644\u20131651. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5526"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Tsukada, T.: On computability of logical approaches to branching-time property verification of programs. In: Hermanns, H., Zhang, L., Kobayashi, N., Miller, D. (eds.) LICS 2020: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, Saarbr\u00fccken, Germany, 8\u201311 July 2020, pp. 886\u2013899. ACM (2020). https:\/\/doi.org\/10.1145\/3373718.3394766","DOI":"10.1145\/3373718.3394766"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-540-28644-8_33","volume-title":"CONCUR 2004 - Concurrency Theory","author":"M Viswanathan","year":"2004","unstructured":"Viswanathan, M., Viswanathan, R.: A higher order modal fixed point logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 512\u2013528. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_33"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Watanabe, K., Tsukada, T., Oshikawa, H., Kobayashi, N.: Reduction from branching-time property verification of higher-order programs to HFL validity checking. In: Hermenegildo, M.V., Igarashi, A. (eds.) Proceedings of the 2019 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM@POPL 2019, Cascais, Portugal, 14\u201315 January 2019, pp. 22\u201334. ACM (2019). https:\/\/doi.org\/10.1145\/3294032.3294077","DOI":"10.1145\/3294032.3294077"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19135-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T23:09:38Z","timestamp":1665529778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19135-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031191343","9783031191350"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19135-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaiserslautern","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp2022.mpi-sws.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited talks are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}