{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:56Z","timestamp":1740122696946,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10703-021-00384-2","type":"journal-article","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T17:02:35Z","timestamp":1642698155000},"page":"347-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Colored nested words"],"prefix":"10.1007","volume":"58","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6015-4170","authenticated-orcid":false,"given":"Dana","family":"Fisman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"384_CR1","unstructured":"Alur R, Bouajjani A, Esparza J (2016) Model checking of procedural programs. In: Handbook of Model Checking. Springer. To Appear"},{"key":"384_CR2","doi-asserted-by":"crossref","unstructured":"Alur R, Chaudhuri S (2010) Temporal reasoning for procedural programs. In: VMCAI, pp. 45\u201360","DOI":"10.1007\/978-3-642-11319-2_7"},{"key":"384_CR3","doi-asserted-by":"crossref","unstructured":"Alur R, Chaudhuri S, Madhusudan P (2006) A fixpoint calculus for local and global program flows. In: POPL, pp. 153\u2013165","DOI":"10.1145\/1111320.1111051"},{"issue":"5","key":"384_CR4","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 (2011) Software model checking using languages of nested trees. ACM Trans. Program. Lang. Syst. 33(5):15","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"384_CR5","doi-asserted-by":"crossref","unstructured":"Alur R, Madhusudan P (2004) Visibly pushdown languages. In: STOC, pp. 202\u2013211","DOI":"10.1145\/1007352.1007390"},{"key":"384_CR6","doi-asserted-by":"crossref","unstructured":"Alur R, Madhusudan P (2009) Adding nesting structure to words. J. ACM 56(3). http:\/\/robotics.upenn.edu\/~alur\/Jacm09.pdf","DOI":"10.1145\/1516512.1516518"},{"key":"384_CR7","doi-asserted-by":"crossref","unstructured":"Caucal D, Hassen S (2008) Synchronization of grammars. In: CSR, pp. 110\u2013121","DOI":"10.1007\/978-3-540-79709-8_14"},{"key":"384_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhuri S, Alur R (2007) Instrumenting C programs with nested word monitors. In: SPIN, pp. 279\u2013283","DOI":"10.1007\/978-3-540-73370-6_20"},{"issue":"6","key":"384_CR9","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 (2012) Operator precedence and the visibly pushdown property. J. Comput. Syst. Sci. 78(6):1837\u20131867","journal-title":"J. Comput. Syst. Sci."},{"key":"384_CR10","doi-asserted-by":"crossref","unstructured":"Debarbieux D, Gauwin O, Niehren J, Sebastian T, Zergaoui M (2013) Early nested word automata for xpath query answering on XML streams. In: CIAA\u201913, pp. 292\u2013305","DOI":"10.1007\/978-3-642-39274-0_26"},{"key":"384_CR11","doi-asserted-by":"crossref","unstructured":"Driscoll E, Burton A, Reps TW (2011) Checking conformance of a producer and a consumer. In: SIGSOFT\/FSE, pp. 113\u2013123","DOI":"10.1145\/2025113.2025132"},{"key":"384_CR12","unstructured":"Filiot E, Gauwin O, Reynier PA, Servais F (2011) Streamability of nested word transductions. In: Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, pp. 312\u2013324"},{"key":"384_CR13","doi-asserted-by":"crossref","unstructured":"Filiot E, Raskin JF, Reynier PA, Servais F, Talbot JM (2010) Properties of visibly pushdown transducers. In: In Proc. 35th MFCS, pp. 355\u2013367","DOI":"10.1007\/978-3-642-15155-2_32"},{"key":"384_CR14","doi-asserted-by":"crossref","unstructured":"Filiot E, Servais F (2012) Visibly pushdown transducers with look-ahead. In: SOFSEM 2012: Conf. on Current Trends The. and Prac. of CS, pp. 251\u2013263","DOI":"10.1007\/978-3-642-27660-6_21"},{"key":"384_CR15","doi-asserted-by":"crossref","unstructured":"Hague M, Murawski AS, Ong CL, Serre O (2008) Collapsible pushdown automata and recursion schemes. In: LICS, pp. 452\u2013461","DOI":"10.1109\/LICS.2008.34"},{"key":"384_CR16","doi-asserted-by":"crossref","unstructured":"Madhusudan P, Viswanathan M (2009) Query automata for nested words. In: MFCS, pp. 561\u2013573","DOI":"10.1007\/978-3-642-03816-7_48"},{"key":"384_CR17","doi-asserted-by":"crossref","unstructured":"Mozafari B, Zeng K, Zaniolo C (2012) High-performance complex event processing over xml streams. In: SIGMOD Conference, pp. 253\u2013264","DOI":"10.1145\/2213836.2213866"},{"key":"384_CR18","doi-asserted-by":"crossref","unstructured":"Nowotka D, Srba J (2007) Height-deterministic pushdown automata. In: MFCS, pp. 125\u2013134","DOI":"10.1007\/978-3-540-74456-6_13"},{"key":"384_CR19","doi-asserted-by":"crossref","unstructured":"Raskin JF, Servais F (2008) Visibly pushdown transducers. In: Automata, Languages and Programming, ICALP 2008, pp. 386\u2013397","DOI":"10.1007\/978-3-540-70583-3_32"},{"key":"384_CR20","doi-asserted-by":"crossref","unstructured":"Staworko S, Laurence G, Lemay A, Niehren J (2009) Equivalence of deterministic nested word to word transducers. In: In Proc. 17th FCT, pp. 310\u2013322","DOI":"10.1007\/978-3-642-03409-1_28"},{"issue":"39","key":"384_CR21","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 (2011) Rewriting of visibly pushdown languages for XML data integration. Theor. Comput. Sci. 412(39):5285\u20135297","journal-title":"Theor. Comput. Sci."}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-021-00384-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10703-021-00384-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-021-00384-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T22:04:04Z","timestamp":1653689044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10703-021-00384-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["384"],"URL":"https:\/\/doi.org\/10.1007\/s10703-021-00384-2","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[2021,11]]},"assertion":[{"value":"2 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}