{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:09Z","timestamp":1759638249153},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319299990"},{"type":"electronic","value":"9783319300009"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-30000-9_11","type":"book-chapter","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T16:45:50Z","timestamp":1456418750000},"page":"143-155","source":"Crossref","is-referenced-by-count":1,"title":["Colored Nested Words"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Dana","family":"Fisman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-11319-2_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R Alur","year":"2010","unstructured":"Alur, R., Chaudhuri, S.: Temporal reasoning for procedural programs. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 45\u201360. Springer, Heidelberg (2010)"},{"issue":"1","key":"11_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/1111320.1111051","volume":"41","author":"Rajeev Alur","year":"2006","unstructured":"Alur, R., Chaudhuri, S., Madhusudan, P.: A fixpoint calculus for local and global program flows. In: POPL, pp. 153\u2013165 (2006)","journal-title":"ACM SIGPLAN Notices"},{"issue":"5","key":"11_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2039346.2039347","volume":"33","author":"R Alur","year":"2011","unstructured":"Alur, R., Chaudhuri, S., Madhusudan, P.: Software model checking using languages of nested trees. ACM Trans. Program. Lang. Syst. 33(5), 15 (2011)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-79709-8_14","volume-title":"Computer Science \u2013 Theory and Applications","author":"D Caucal","year":"2008","unstructured":"Caucal, D., Hassen, S.: Synchronization of grammars. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) Computer Science \u2013 Theory and Applications. LNCS, vol. 5010, pp. 110\u2013121. Springer, Heidelberg (2008)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73370-6_20","volume-title":"Model Checking Software","author":"S Chaudhuri","year":"2007","unstructured":"Chaudhuri, S., Alur, R.: Instrumenting C programs with nested word monitors. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 279\u2013283. Springer, Heidelberg (2007)"},{"issue":"6","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1016\/j.jcss.2011.12.006","volume":"78","author":"S Crespi-Reghizzi","year":"2012","unstructured":"Crespi-Reghizzi, S., Mandrioli, D.: Operator precedence and the visibly pushdown property. J. Comput. Syst. Sci. 78(6), 1837\u20131867 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Debarbieux, D., Gauwin, O., Niehren, J., Sebastian, T., Zergaoui, M.: Early nested word automata for xpath query answering on XML streams. In: CIAA 2013","DOI":"10.1007\/978-3-642-39274-0_26"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Driscoll, E., Burton, A., Reps, T.W.: Checking conformance of a producer and a consumer. In: SIGSOFT\/FSE, pp. 113\u2013123 (2011)","DOI":"10.1145\/2025113.2025132"},{"key":"11_CR10","unstructured":"Filiot, E., Gauwin, O., Reynier, P-A., Servais, F.: Streamability of nested word transductions. In: Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, pp. 312\u2013324 (2011)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-15155-2_32","volume-title":"Mathematical Foundations of Computer Science 2010","author":"E Filiot","year":"2010","unstructured":"Filiot, E., Raskin, J.-F., Reynier, P.-A., Servais, F., Talbot, J.-M.: Properties of visibly pushdown transducers. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 355\u2013367. Springer, Heidelberg (2010)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-27660-6_21","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"E Filiot","year":"2012","unstructured":"Filiot, E., Servais, F.: Visibly pushdown transducers with look-ahead. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 251\u2013263. Springer, Heidelberg (2012)"},{"key":"11_CR13","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 (2008)","DOI":"10.1109\/LICS.2008.34"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-03816-7_48","volume-title":"Mathematical Foundations of Computer Science 2009","author":"P Madhusudan","year":"2009","unstructured":"Madhusudan, P., Viswanathan, M.: Query automata for nested words. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 561\u2013573. Springer, Heidelberg (2009)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Mozafari, B., Zeng, K., Zaniolo, C.: High-performance complex event processing over xml streams. In: SIGMOD Conference, pp. 253\u2013264 (2012)","DOI":"10.1145\/2213836.2213866"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-74456-6_13","volume-title":"Mathematical Foundations of Computer Science 2007","author":"D Nowotka","year":"2007","unstructured":"Nowotka, D., Srba, J.: Height-deterministic pushdown automata. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 125\u2013134. Springer, Heidelberg (2007)"},{"key":"11_CR17","volume-title":"Handbook of Model Checking","author":"J Esparza","year":"2015","unstructured":"Esparza, J., Alur, R., Bouajjani, A.: Model checking of procedural programs. In: Clarke, E.M., Henzinger, T.A., Veith, H. (eds.) Handbook of Model Checking. Springer, Heidelberg (2015)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70583-3_32","volume-title":"Automata, Languages and Programming","author":"J-F Raskin","year":"2008","unstructured":"Raskin, J.-F., Servais, F.: Visibly pushdown transducers. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 386\u2013397. Springer, Heidelberg (2008)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-03409-1_28","volume-title":"Fundamentals of Computation Theory","author":"S Staworko","year":"2009","unstructured":"Staworko, S., Laurence, G., Lemay, A., Niehren, J.: Equivalence of deterministic nested word to word transducers. In: Kuty\u0142owski, M., Charatonik, W., G\u0119bala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 310\u2013322. Springer, Heidelberg (2009)"},{"issue":"39","key":"11_CR20","doi-asserted-by":"publisher","first-page":"5285","DOI":"10.1016\/j.tcs.2011.05.047","volume":"412","author":"A Thomo","year":"2011","unstructured":"Thomo, A., Venkatesh, S.: Rewriting of visibly pushdown languages for XML data integration. Theoret. Comput. Sci. 412(39), 5285\u20135297 (2011)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30000-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:43:02Z","timestamp":1559389382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30000-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319299990","9783319300009"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30000-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}