{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T04:11:01Z","timestamp":1749787861710,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662540688"},{"type":"electronic","value":"9783662540695"}],"license":[{"start":{"date-parts":[[2016,12,3]],"date-time":"2016-12-03T00:00:00Z","timestamp":1480723200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54069-5_3","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T08:43:15Z","timestamp":1480668195000},"page":"23-26","source":"Crossref","is-referenced-by-count":0,"title":["Automata, Logic and Games for the $$\\lambda $$ -Calculus"],"prefix":"10.1007","author":[{"given":"C.-H. Luke","family":"Ong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"unstructured":"Clairambault, P., Murawski, A.S.: B\u00f6hm trees as higher-order recursive schemes. In: Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), LIPIcs, vol. 24, pp. 91\u2013102. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)","key":"3_CR1"},{"doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, vol. 1\u20134 , pp. 368\u2013377, October 1991","key":"3_CR2","DOI":"10.1109\/SFCS.1991.185392"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002). doi: 10.1007\/3-540-36387-4"},{"key":"3_CR4","first-page":"205","volume":"2002","author":"T Knapik","year":"2002","unstructured":"Knapik, T., Niwi\u0144ski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. FoSSaCS 2002, 205\u2013222 (2002)","journal-title":"FoSSaCS"},{"issue":"3","key":"3_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2487241.2487246","volume":"60","author":"N Kobayashi","year":"2013","unstructured":"Kobayashi, N.: Model checking higher-order programs. J. ACM 60(3), 1\u201362 (2013)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Ong, C.-H.L.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11\u201314 August 2009, Los Angeles, CA, USA, pp. 179\u2013188 (2009)","key":"3_CR6","DOI":"10.1109\/LICS.2009.29"},{"doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Sato, R., Unno, H.: Predicate abstraction and CEGAR for higher-order model checking. In: Hall, M.W., Padua, D.A. (eds.) PLDI, pp. 222\u2013233. ACM (2011)","key":"3_CR7","DOI":"10.1145\/1993498.1993525"},{"issue":"2","key":"3_CR8","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM 47(2), 312\u2013360 (2000)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: Proceedings of 21th IEEE Symposium on Logic in Computer Science (LICS 2006), pp. 81\u201390. IEEE Computer Society (2006)","key":"3_CR9","DOI":"10.1109\/LICS.2006.38"},{"doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L.: Higher-order model checking: an overview. In: 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, 6\u201310 July 2015, pp. 1\u201315 (2015)","key":"3_CR10","DOI":"10.1109\/LICS.2015.9"},{"doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L., Ramsay, S.J.: Verifying higher-order functional programs with pattern-matching algebraic data types. In: POPL 2011, vol. 46, pp. 587\u2013598, January 2011","key":"3_CR11","DOI":"10.1145\/1926385.1926453"},{"doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L., Tzevelekos, N.: Functional reachability. In: 2009 24th Annual IEEE Symposium on Logic in Computer Science (LICS 2009), pp. 286\u2013295, August 2009","key":"3_CR12","DOI":"10.1109\/LICS.2009.48"},{"unstructured":"Platek, R.A.: Foundations of recursion theory. Ph.D. thesis, Standford University (1966)","key":"3_CR13"},{"doi-asserted-by":"crossref","unstructured":"Ramsay, S.J., Neatherway, R.P., Ong, C.-H.L.: A type-directed abstraction refinement approach to higher-order model checking. In: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, 20\u201321 January 2014, pp. 61\u201372. ACM (2014)","key":"3_CR14","DOI":"10.1145\/2535838.2535873"},{"issue":"1&2","key":"3_CR15","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0304-3975(93)90095-B","volume":"121","author":"DS Scott","year":"1993","unstructured":"Scott, D.S.: A type-theoretical alternative to ISWIM, CUCH, OWHY. Theor. Comput. Sci. 121(1&2), 411\u2013440 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-00596-1_8","volume-title":"Foundations of Software Science and Computational Structures","author":"C Stirling","year":"2009","unstructured":"Stirling, C.: Dependency tree automata. In: Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 92\u2013106. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00596-1_8"},{"issue":"3","key":"3_CR17","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","volume":"81","author":"RS Streett","year":"1989","unstructured":"Streett, R.S., Emerson, E.A.: An automata theoretic decision procedure for the propositional mu-calculus. Inf. Comput. 81(3), 249\u2013264 (1989)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Tsukada, T., Ong, C.-H.L.: Compositional higher-order model checking via $$\\omega $$ -regular games over b\u00f6hm trees. In: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS 2014, Vienna, Austria, 14\u201318 July 2014, pp. 78:1\u201378:10 (2014)","key":"3_CR18","DOI":"10.1145\/2603088.2603133"},{"issue":"2","key":"3_CR19","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: games and model-checking. Inf. Comput. 164(2), 234\u2013263 (2001)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54069-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:57:14Z","timestamp":1749776234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-54069-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,3]]},"ISBN":["9783662540688","9783662540695"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54069-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,3]]}}}