{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:58:48Z","timestamp":1725562728649},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152047"},{"type":"electronic","value":"9783642152054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15205-4_29","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T10:48:24Z","timestamp":1281696504000},"page":"366-380","source":"Crossref","is-referenced-by-count":5,"title":["New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Ganzow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kaiser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","first-page":"1","volume-title":"International Congress on Logic, Methodology and Philosophy of Science","author":"J.R. B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311. Stanford University Press, Standford (1962)"},{"key":"29_CR2","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 American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02088013","volume":"21","author":"B. Courcelle","year":"1989","unstructured":"Courcelle, B.: The monadic second order logic of graphs, II: Infinite graphs of bounded width. Mathematical System Theory\u00a021, 187\u2013222 (1989)","journal-title":"Mathematical System Theory"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-60045-0_38","volume-title":"Computer Aided Verification","author":"D.A. Basin","year":"1995","unstructured":"Basin, D.A., Klarlund, N.: Hardware verification using monadic second-order logic. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 31\u201341. Springer, Heidelberg (1995)"},{"doi-asserted-by":"crossref","unstructured":"Jensen, J.L., J\u00f8rgensen, M.E., Klarlund, N., Schwartzbach, M.I.: Automatic verification of pointer programs using monadic second-order logic. In: Proceedings of PLDI\u00a01997, pp. 226\u2013236 (1997)","key":"29_CR5","DOI":"10.1145\/258915.258936"},{"doi-asserted-by":"crossref","unstructured":"Zee, K., Kuncak, V., Rinard, M.C.: An integrated proof language for imperative programs. In: PLDI, pp. 338\u2013351 (2009)","key":"29_CR6","DOI":"10.1145\/1542476.1542514"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"Shelah, S.: The monadic second order theory of order. Annals of Mathematics\u00a0102, 379\u2013419 (1975)","journal-title":"Annals of Mathematics"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-63246-8_8","volume-title":"Structures in Logic and Computer Science","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol.\u00a01261, pp. 118\u2013143. Springer, Heidelberg (1997)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0049-237X(08)70525-1","volume-title":"Proceedings of the Logic Colloquium 1966","author":"H. L\u00e4uchli","year":"1968","unstructured":"L\u00e4uchli, H.: A decision procedure for the weak second order theory of linear order. In: Arnold, H., Schmidt, K.S., Thiele, H.J. (eds.) Proceedings of the Logic Colloquium 1966, vol.\u00a050, pp. 189\u2013197. Elsevier, Amsterdam (1968)"},{"doi-asserted-by":"crossref","unstructured":"Blumensath, A., Colcombet, T., L\u00f6ding, C.: Logical theories and compatible operations. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and automata: History and Perspectives, pp. 72\u2013106. Amsterdam University Press, Amsterdam (2007)","key":"29_CR10","DOI":"10.5117\/9789053565766"},{"issue":"1-3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.apal.2003.11.002","volume":"126","author":"J.A. Makowsky","year":"2004","unstructured":"Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic\u00a0126(1-3), 159\u2013213 (2004)","journal-title":"Annals of Pure and Applied Logic"},{"unstructured":"Bojanczyk, M.: Weak MSO with the unbounding quantifier. In: Proceedings of STACS 2009, Schloss Dagstuhl (IBFI). LIPIcs, vol.\u00a009001, pp. 159\u2013170 (2009)","key":"29_CR12"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-30124-0_7","volume-title":"Computer Science Logic","author":"M. Bojanczyk","year":"2004","unstructured":"Bojanczyk, M.: A bounding quantifier. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45657-0_19","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"2002","unstructured":"McMillan, K.L.: Applying sat methods in unbounded symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 250\u2013264. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15205-4_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:30Z","timestamp":1606168950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15205-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152047","9783642152054"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15205-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}