{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:47:35Z","timestamp":1725670055859},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287282"},{"type":"electronic","value":"9783642287299"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28729-9_26","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:47:40Z","timestamp":1332449260000},"page":"391-405","source":"Crossref","is-referenced-by-count":13,"title":["Model Checking Languages of Data Words"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Aiswarya","family":"Cyriac","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Gastin","sequence":"additional","affiliation":[]},{"given":"K.","family":"Narayan Kumar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11266-9_1","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"P.A. Abdulla","year":"2010","unstructured":"Abdulla, P.A.: Forcing Monotonicity in Parameterized Verification: From Multisets to Words. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol.\u00a05901, pp. 1\u201315. Springer, Heidelberg (2010)"},{"issue":"4","key":"26_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1970398.1970403","volume":"12","author":"M. Boja\u0144czyk","year":"2011","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log.\u00a012(4), 27 (2011)","journal-title":"ACM Trans. Comput. Log."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and applications to XML reasoning. J.\u00a0ACM\u00a056(3) (2009)","DOI":"10.1145\/1516512.1516515"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-23217-6_12","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"B. Bollig","year":"2011","unstructured":"Bollig, B.: An automaton Over Data Words that Captures EMSO Logic. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011 \u2013 Concurrency Theory. LNCS, vol.\u00a06901, pp. 171\u2013186. Springer, Heidelberg (2011)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-13182-0_5","volume-title":"Computer Science \u2013 Theory and Applications","author":"B. Bollig","year":"2010","unstructured":"Bollig, B., H\u00e9lou\u00ebt, L.: Realizability of Dynamic MSC Languages. In: Ablayev, F.M., Mayr, E.W. (eds.) CSR 2010. LNCS, vol.\u00a06072, pp. 48\u201359. Springer, Heidelberg (2010)"},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"E.Y.C. Cheng","year":"1998","unstructured":"Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Inf.\u00a035(3), 245\u2013267 (1998)","journal-title":"Acta Inf."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 193\u2013242. MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-16242-8_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"C. David","year":"2010","unstructured":"David, C., Libkin, L., Tan, T.: On the Satisfiability of Two-Variable Logic Over Data Words. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 248\u2013262. Springer, Heidelberg (2010)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic\u00a010(3) (2009)","DOI":"10.1145\/1507244.1507246"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-540-78499-9_34","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Demri","year":"2008","unstructured":"Demri, S., Lazi\u0107, R., Sangnier, A.: Model Checking Freeze LTL Over One-Counter Automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 490\u2013504. Springer, Heidelberg (2008)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-12032-9_13","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Demri","year":"2010","unstructured":"Demri, S., Sangnier, A.: When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. In: Ong, C.-H.L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 176\u2013190. Springer, Heidelberg (2010)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-13089-2_47","volume-title":"Language and Automata Theory and Applications","author":"O. Grumberg","year":"2010","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable Automata over Infinite Alphabets. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 561\u2013572. Springer, Heidelberg (2010)"},{"issue":"2","key":"26_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science\u00a0134(2), 329\u2013363 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"26_CR14","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1142\/S0129054110007532","volume":"21","author":"M. Kaminski","year":"2010","unstructured":"Kaminski, M., Zeitlin, D.: Finite-memory automata with non-deterministic reassignment. Int. J. Found. Comput. Sci.\u00a021(5), 741\u2013760 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS 2007, pp. 161\u2013170. IEEE Computer Society Press (2007)","DOI":"10.1109\/LICS.2007.9"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-78800-3_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Torre La","year":"2008","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Context-Bounded Analysis of Concurrent Queue Systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 299\u2013314. Springer, Heidelberg (2008)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-36206-1_23","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"M. Leucker","year":"2002","unstructured":"Leucker, M., Madhusudan, P., Mukhopadhyay, S.: Dynamic Message Sequence Charts. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 253\u2013264. Springer, Heidelberg (2002)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: Ball, T., Sagiv, M. (eds.) POPL 2011, pp. 283\u2013294. ACM (2011)","DOI":"10.1145\/1925844.1926419"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Niewerth, M., Schwentick, T.: Two-variable logic and key constraints on data words. In: Milo, T. (ed.) ICDT 2011, pp. 138\u2013149. ACM (2011)","DOI":"10.1145\/1938551.1938571"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Tzevelekos, N.: Fresh-register automata. In: Ball, T., Sagiv, M. (eds.) POPL 2011, pp. 295\u2013306. ACM (2011)","DOI":"10.1145\/1925844.1926420"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:44:55Z","timestamp":1558313095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}