{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T13:40:04Z","timestamp":1748785204428,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319268491"},{"type":"electronic","value":"9783319268507"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26850-7_2","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T09:14:46Z","timestamp":1455959686000},"page":"15-31","source":"Crossref","is-referenced-by-count":3,"title":["Verification of Buffered Dynamic Register Automata"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[]},{"given":"Mohamed Faouzi","family":"Atig","sequence":"additional","affiliation":[]},{"given":"Ahmet","family":"Kara","sequence":"additional","affiliation":[]},{"given":"Othmane","family":"Rezine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,23]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-38592-6_14","volume-title":"Formal Techniques for Distributed Systems","author":"PA Abdulla","year":"2013","unstructured":"Abdulla, P.A., Atig, M.F., Rezine, O.: Verification of directed acyclic ad hoc networks. In: Beyer, D., Boreale, M. (eds.) FORTE 2013 and FMOODS 2013. LNCS, vol. 7892, pp. 193\u2013208. Springer, Heidelberg (2013)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P., Cerans, K., Jonsson, B., Tsay, Y.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313\u2013321. IEEE Computer Society (1996)","DOI":"10.1109\/LICS.1996.561359"},{"key":"2_CR3","unstructured":"Abdulla, P.A., Atig, M.F., Kara, A., Rezine, O.: Verification of dynamic register automata. In: FSTTCS 2014, pp. 653\u2013665 (2014)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-15205-4_12","volume-title":"Computer Science Logic","author":"M Benedikt","year":"2010","unstructured":"Benedikt, M., Ley, C., Puppis, G.: Automata vs. logics on data words. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 110\u2013124. Springer, Heidelberg (2010)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-37064-9_17","volume-title":"Language and Automata Theory and Applications","author":"B Bollig","year":"2013","unstructured":"Bollig, B., Cyriac, A., H\u00e9lou\u00ebt, L., Kara, A., Schwentick, T.: Dynamic communicating automata and branching high-level MSCs. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 177\u2013189. Springer, Heidelberg (2013)"},{"key":"2_CR6","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., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 48\u201359. Springer, Heidelberg (2010)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-15375-4_22","volume-title":"CONCUR 2010 - Concurrency Theory","author":"G Delzanno","year":"2010","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 313\u2013327. Springer, Heidelberg (2010)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazic, R.: LTL with the freeze quantifier and register automata. In: LICS, pp. 17\u201326. IEEE Computer Society (2006)","DOI":"10.1109\/LICS.2006.31"},{"issue":"5","key":"2_CR9","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/jgt.3190160509","volume":"16","author":"G Ding","year":"1992","unstructured":"Ding, G.: Subgraphs and well quasi ordering. J. Graph Theory 16(5), 489\u2013502 (1992)","journal-title":"J. Graph Theory"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.2168\/LMCS-8(1:22)2012","volume":"8","author":"D Figueira","year":"2012","unstructured":"Figueira, D.: Alternating register automata on finite words and trees. Logical Methods in Computer Science 8(1), 22 (2012)","journal-title":"Logical Methods in Computer Science"},{"issue":"1\u20132","key":"2_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-36742-7_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Grigore","year":"2013","unstructured":"Grigore, R., Distefano, D., Petersen, R.L., Tzevelekos, N.: Runtime verification based on register automata. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013 (ETAPS 2013). LNCS, vol. 7795, pp. 260\u2013276. Springer, Heidelberg (2013)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Jurdzinski, M., Lazic, R.: Alternation-free modal mu-calculus for data trees. In: LICS, pp. 131\u2013140. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.11"},{"issue":"2","key":"2_CR14","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. Theor. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/11944836_35","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"RS Lazi\u0107","year":"2006","unstructured":"Lazi\u0107, R.S.: Safely freezing LTL. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 381\u2013392. Springer, Heidelberg (2006)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Meyer, R.: On boundedness in depth in the pi-calculus. In: IFIP TCS, pp. 477\u2013489 (2008)","DOI":"10.1007\/978-0-387-09680-3_32"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3), 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(99)00105-X","volume":"231","author":"H Sakamoto","year":"2000","unstructured":"Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231(2), 297\u2013308 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Tzevelekos, N.: Fresh-register automata. In: POPL. ACM (2011)","DOI":"10.1145\/1926385.1926420"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26850-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T13:04:47Z","timestamp":1748783087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26850-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319268491","9783319268507"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26850-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}