{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:36:45Z","timestamp":1747888605684,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466773"},{"type":"electronic","value":"9783662466780"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46678-0_22","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T13:42:21Z","timestamp":1427895741000},"page":"343-357","source":"Crossref","is-referenced-by-count":5,"title":["Typing Weak MSOL Properties"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Salvati","sequence":"first","affiliation":[]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"Abramsky, S.: Domain theory in logical form. Ann. Pure Appl. Logic\u00a051(1-2), 1\u201377 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"22_CR2","first-page":"1","volume":"3","author":"K. Aehlig","year":"2007","unstructured":"Aehlig, K.: A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science\u00a03(1), 1\u201323 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Amadio, R.M., Curien, P.-L.: Domains and Lambda-Calculi. Cambridge Tracts in Theoretical Computer Science, vol.\u00a046. Cambridge University Press (1998)","DOI":"10.1017\/CBO9780511983504"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2273659","volume":"4","author":"H. Barendregt","year":"1983","unstructured":"Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. J. Symb. Log.\u00a04, 931\u2013940 (1983)","journal-title":"J. Symb. Log."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs in Theoretical Computer Science. Springer (1993)","DOI":"10.1007\/978-3-642-78034-9_6"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(95)00010-0","volume":"155","author":"S.L. Bloom","year":"1996","unstructured":"Bloom, S.L., \u00c9sik, Z.: Fixed-point operations on CCC\u2019s. part I. Theoretical Computer Science\u00a0155, 1\u201338 (1996)","journal-title":"Theoretical Computer Science"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.01.026","volume":"478","author":"A. Blumensath","year":"2013","unstructured":"Blumensath, A.: An algebraic proof of Rabin\u2019s tree theorem. Theor. Comput. Sci.\u00a0478, 1\u201321 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Broadbent, C., Carayol, A., Ong, L., Serre, O.: Recursion schemes and logical reflection. In: LICS, pp. 120\u2013129 (2010)","DOI":"10.1109\/LICS.2010.40"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Broadbent, C.H., Carayol, A., Hague, M., Serre, O.: C-shore: a collapsible approach to higher-order verification. In: ICFP, pp. 13\u201324. ACM (2013)","DOI":"10.1145\/2544174.2500589"},{"key":"22_CR10","unstructured":"Broadbent, C.H., Kobayashi, N.: Saturation-based model checking of higher-order recursion schemes. In: CSL. LIPIcs, vol.\u00a023, pp. 129\u2013148. Schloss Dagstuhl (2013)"},{"key":"22_CR11","unstructured":"Chen, W., Hofmann, M.: Buchi abstraction. In: LICS (2014) (to appear)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-29420-4_12","volume-title":"Formal Aspects of Security and Trust","author":"R. Grabowski","year":"2012","unstructured":"Grabowski, R., Hofmann, M., Li, K.: Type-based enforcement of secure programming guidelines \u2014 code injection prevention at SAP. In: Barthe, G., Datta, A., Etalle, S. (eds.) FAST 2011. LNCS, vol.\u00a07140, pp. 182\u2013197. Springer, Heidelberg (2012)"},{"key":"22_CR13","unstructured":"Haddad, A.: Model checking and functional program transformations. In: FSTTCS. LIPIcs, vol.\u00a024, pp. 115\u2013126 (2013)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Hague, M., Murawski, A.S., Ong, C.-H.L., Serre, O.: Collapsible pushdown automata and recursion schemes. In: LICS, pp. 452\u2013461. IEEE Computer Society (2008)","DOI":"10.1109\/LICS.2008.34"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.S.A.: LTL types FRP: Linear-time Temporal Logic propositions as types, proofs as functional reactive programs. In: ACM Workshop Programming Languages meets Program Verification (2012)","DOI":"10.1145\/2103776.2103783"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.S.A.: Functional reactive types. In: LICS (2014) (to appear)","DOI":"10.1145\/2603088.2603106"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: POPL, pp. 416\u2013428 (2009)","DOI":"10.1145\/1594834.1480933"},{"issue":"3","key":"22_CR18","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2487241.2487246","volume":"60","author":"N. Kobayashi","year":"2013","unstructured":"Kobayashi, N.: Model checking higher-order programs. J. ACM\u00a060(3), 20\u201389 (2013)","journal-title":"J. ACM"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Ong, L.: A type system equivalent to modal mu-calculus model checking of recursion schemes. In: LICS, pp. 179\u2013188 (2009)","DOI":"10.1109\/LICS.2009.29"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Tabuchi, N., Unno, H.: Higher-order multi-parameter tree transducers and recursion schemes for program verification. In: POPL, pp. 495\u2013508 (2010)","DOI":"10.1145\/1707801.1706355"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Naik, M., Palsberg, J.: A type system equivalent to a model checker. ACM Trans. Program. Lang. Syst.\u00a030(5) (2008)","DOI":"10.1145\/1387673.1387678"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48092-7_6","volume-title":"Correct System Design","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Riis Nielson, H.: Type and effect systems. In: Olderog, E.-R., Steffen, B. (eds.) Correct System Design. LNCS, vol.\u00a01710, pp. 114\u2013136. Springer, Heidelberg (1999)"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS, pp. 81\u201390 (2006)","DOI":"10.1109\/LICS.2006.38"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L., Ramsay, S.: Verifying higher-order programs with pattern-matching algebraic data types. In: POPL, pp. 587\u2013598 (2011)","DOI":"10.1145\/1925844.1926453"},{"key":"22_CR25","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the AMS\u00a0141, 1\u201323 (1969)","journal-title":"Transactions of the AMS"},{"key":"22_CR26","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: POPL, pp. 61\u201372. ACM (2014)","DOI":"10.1145\/2535838.2535873"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-22012-8_12","volume-title":"Automata, Languages and Programming","author":"S. Salvati","year":"2011","unstructured":"Salvati, S., Walukiewicz, I.: Krivine machines and higher-order schemes. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 162\u2013173. Springer, Heidelberg (2011)"},{"key":"22_CR28","unstructured":"Salvati, S., Walukiewicz, I.: Evaluation is MSOL-compatible. In: FSTTCS. LIPIcs, vol.\u00a024, pp. 103\u2013114 (2013)"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-38946-7_15","volume-title":"Typed Lambda Calculi and Applications","author":"S. Salvati","year":"2013","unstructured":"Salvati, S., Walukiewicz, I.: Using models to model-check recursive schemes. In: Hasegawa, M. (ed.) TLCA 2013. LNCS, vol.\u00a07941, pp. 189\u2013204. Springer, Heidelberg (2013)"},{"key":"22_CR30","unstructured":"Salvati, S., Walukiewicz, I.: Typing weak MSOL properties (2014), https:\/\/hal.archives-ouvertes.fr\/hal-01061202"},{"key":"22_CR31","unstructured":"Terui, K.: Semantic evaluation, intersection types and complexity of simply typed lambda calculus. In: RTA. LIPIcs, vol.\u00a015, pp. 323\u2013338. Schloss Dagstuhl (2012)"},{"key":"22_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-29822-6_22","volume-title":"Functional and Logic Programming","author":"Y. Tobita","year":"2012","unstructured":"Tobita, Y., Tsukada, T., Kobayashi, N.: Exact flow analysis by higher-order model checking. In: Schrijvers, T., Thiemann, P. (eds.) FLOPS 2012. LNCS, vol.\u00a07294, pp. 275\u2013289. Springer, Heidelberg (2012)"},{"key":"22_CR33","unstructured":"Tsukada, T., Ong, C.-H.L.: Compositional higher-order model checking via \u03c9-regular games over B\u00f6hm trees. In: LICS (to appear, 2014)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46678-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T19:57:43Z","timestamp":1747857463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46678-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466773","9783662466780"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46678-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}