{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:01:29Z","timestamp":1762459289906,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319216898"},{"type":"electronic","value":"9783319216904"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21690-4_17","type":"book-chapter","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T06:08:27Z","timestamp":1436940507000},"page":"290-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tree Buffers"],"prefix":"10.1007","author":[{"given":"Radu","family":"Grigore","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Kiefer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-32759-9_9","volume-title":"FM 2012: Formal Methods","author":"H Barringer","year":"2012","unstructured":"Barringer, H., Falcone, Y., Havelund, K., Reger, G., Rydeheard, D.: Quantified event automata: towards expressive and efficient runtime monitors. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 68\u201384. Springer, Heidelberg (2012)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-40787-1_4","volume-title":"Runtime Verification","author":"A Bauer","year":"2013","unstructured":"Bauer, A., K\u00fcster, J.-C., Vegliach, G.: From propositional to first-order monitoring. In: Legay, A., Bensalem, S. (eds.) RV 2013. LNCS, vol. 8174, pp. 59\u201375. Springer, Heidelberg (2013)"},{"issue":"4\u20135","key":"17_CR3","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.tcs.2009.10.009","volume":"411","author":"H Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On notions of regularity for data languages. Theor. Comput. Sci. 411(4\u20135), 702\u2013715 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., Garner, R., Hoffmann, C., Khan, A.M., McKinley, K.S., Bentzur, R., Diwan, A., Feinberg, D., Frampton, D., Guyer, S.Z., Hirzel, M., Hosking, A.L., Jump, M., Lee, H.B., Moss, J.E.B., Phansalkar, A., Stefanovic, D., VanDrunen, T., von Dincklage, D., Wiedermann, B.: The DaCapo benchmarks: Java benchmarking development and analysis. In: Tarr, P.L., Cook, W.R. (eds.) Proceedings of the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2006, 22\u201326 Oct 2006, Portland, Oregon, USA, pp. 169\u2013190. ACM (2006)","DOI":"10.1145\/1167473.1167488"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bodden, E.: MOPBox: A library approach to runtime verification \u2013 (tool demonstration). In: Khurshid and Sen [17], pp. 365\u2013369","DOI":"10.1007\/978-3-642-29860-8_28"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12\u201315 Aug 2006, Seattle, WA, USA, pp. 7\u201316. IEEE Computer Society (2006)","DOI":"10.1109\/LICS.2006.51"},{"key":"17_CR7","volume-title":"CS49: Data Stream Algorithms. Lecture Notes","author":"C Amit","year":"2014","unstructured":"Amit, C.: CS49: Data Stream Algorithms. Lecture Notes. Dartmouth College, New Hampshire (2014)"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/B:FORM.0000017718.28096.48","volume":"24","author":"B Finkbeiner","year":"2004","unstructured":"Finkbeiner, B., Sipma, H.: Checking finite traces using alternating automata. Form. Methods Syst. Des. 24(2), 101\u2013127 (2004)","journal-title":"Form. Methods Syst. Des."},{"key":"17_CR9","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":"17_CR10","unstructured":"Grigore, R., Kiefer, S.: Tree buffers. http:\/\/arxiv.org\/abs\/1504.04757 . Full version, with proofs"},{"key":"17_CR11","unstructured":"Grigore, R., Kiefer, S.: Tree buffers. http:\/\/github.com\/rgrig\/treebuffers\/ . Implementation"},{"issue":"8","key":"17_CR12","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1109\/89.966081","volume":"9","author":"E G\u00fcnd\u00fczhan","year":"2001","unstructured":"G\u00fcnd\u00fczhan, E., Momtahan, K.: Linear prediction based packet loss concealment algorithm for PCM coded speech. IEEE Trans. Speech Audio Process. 9(8), 778\u2013785 (2001)","journal-title":"IEEE Trans. Speech Audio Process."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-662-45231-8_18","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation","author":"K Havelund","year":"2014","unstructured":"Havelund, K.: Monitoring with data automata. In: Margaria, T., Steffen, B. (eds.) ISoLA 2014, Part II. LNCS, vol. 8803, pp. 254\u2013273. Springer, Heidelberg (2014)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Jin, D., Meredith, P.O., Lee, C., Rosu, G.: JavaMOP: Efficient parametric runtime monitoring framework. In: Glinz, M., Murphy, G.C., Pezz\u00e8, M. (eds.) 34th International Conference on Software Engineering, ICSE 2012, 2\u20139 June 2012, Zurich, Switzerland, pp. 1427\u20131430. IEEE (2012)","DOI":"10.1109\/ICSE.2012.6227231"},{"key":"17_CR15","unstructured":"Kaashoek, M.F., Tanenbaum, A.S.: Group communication in the Amoeba distributed operating system. In: Distributed, Computing Systems, pp. 222\u2013230 (1991)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata (extended abstract). In: FOCS, pp. 683\u2013688. IEEE Computer Society (1990)","DOI":"10.1109\/FSCS.1990.89590"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-29860-8_15","volume-title":"Runtime Verification","author":"SD Stoller","year":"2012","unstructured":"Stoller, S.D., Bartocci, E., Seyster, J., Grosu, R., Havelund, K., Smolka, S.A., Zadok, E.: Runtime verification with state estimation. In: Khurshid, S., Sen, K. (eds.) RV 2011. LNCS, vol. 7186, pp. 193\u2013207. Springer, Heidelberg (2012)"},{"key":"17_CR18","unstructured":"Knuth, D.E.: The stanford graphBase \u2013 a platform for combinatorial computing. ACM (1993)"},{"issue":"1\u20133","key":"17_CR19","first-page":"209","volume":"55","author":"K Rustan","year":"2005","unstructured":"Rustan, K., Leino, M., Millstein, T.D.: Generating error traces from verification-condition counterexamples. Sci. Comput. Program. 55(1\u20133), 209\u2013226 (2005)","journal-title":"Sci. Comput. Program."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining Massive Datasets. http:\/\/mmds.org\/ (2014)","DOI":"10.1017\/CBO9781139924801"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-319-11164-3_24","volume-title":"Runtime Verification","author":"Q Luo","year":"2014","unstructured":"Luo, Q., Zhang, Y., Lee, C., Jin, D., Meredith, P.O.N., \u015eerb\u0103nu\u0163\u0103, T.F., Ro\u015fu, G.: RV-Monitor: efficient parametric runtime verification with simultaneous properties. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 285\u2013300. Springer, Heidelberg (2014)"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-29860-8_23","volume-title":"Runtime Verification","author":"L Pike","year":"2012","unstructured":"Pike, L., Niller, S., Wegmann, N.: Runtime verification for ultra-critical systems. In: Khurshid, S., Sen, K. (eds.) RV 2011. LNCS, vol. 7186, pp. 310\u2013324. Springer, Heidelberg (2012)"},{"issue":"1","key":"17_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-8(1:9)2012","volume":"8","author":"G Rosu","year":"2012","unstructured":"Rosu, G., Chen, F.: Semantics and algorithms for parametric monitoring. Log. Methods Comput. Sci. 8(1), 1\u201347 (2012)","journal-title":"Log. Methods Comput. Sci."},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 11\u201313 May 1981, Milwaukee, Wisconsin, USA, pp. 114\u2013122. ACM (1981)","DOI":"10.1145\/800076.802464"},{"issue":"5","key":"17_CR25","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1109\/12.4607","volume":"37","author":"JE Smith","year":"1988","unstructured":"Smith, J.E., Pleszkun, A.R.: Implementing precise interrupts in pipelined processors. IEEE Trans. Comput. 37(5), 562\u2013573 (1988)","journal-title":"IEEE Trans. Comput."},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-37075-5_2","volume-title":"Foundations of Software Science and Computation Structures","author":"N Tzevelekos","year":"2013","unstructured":"Tzevelekos, N., Grigore, R.: History-register automata. In: Pfenning, F. (ed.) FOSSACS 2013 (ETAPS 2013). LNCS, vol. 7794, pp. 17\u201333. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21690-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T06:28:39Z","timestamp":1748500119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21690-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319216898","9783319216904"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21690-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}