{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:24Z","timestamp":1759637784933,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662494974"},{"type":"electronic","value":"9783662494981"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49498-1_2","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T13:36:06Z","timestamp":1458567366000},"page":"15-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Regular Programming for Quantitative Properties of Data Streams"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Dana","family":"Fisman","sequence":"additional","affiliation":[]},{"given":"Mukund","family":"Raghothaman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s00778-003-0095-z","volume":"12","author":"D Abadi","year":"2003","unstructured":"Abadi, D., Carney, D., \u00c7etintemel, U., Cherniack, M., Convey, C., Lee, S., Stonebraker, M., Tatbul, N., Zdonik, S.: Aurora: a new model and architecture for data stream management. VLDB J. 12(2), 120\u2013139 (2003)","journal-title":"VLDB J."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proceedings of the 28th Annual Symposium on Theory of Computing, STOC 1996, pp. 20\u201329. ACM (1996)","DOI":"10.1145\/237814.237823"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., \u010cern\u00fd, P.: Streaming transducers for algorithmic verification of single-pass list-processing programs. In: Proceedings of the 38th Annual Symposium on Principles of Programming Languages, POPL 2011, pp. 599\u2013610. ACM (2011)","DOI":"10.1145\/1926385.1926454"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-31585-5_8","volume-title":"Automata, Languages, and Programming","author":"R Alur","year":"2012","unstructured":"Alur, R., D\u2019Antoni, L.: Streaming tree transducers. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 42\u201353. Springer, Heidelberg (2012)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: 28th Annual Symposium on Logic in Computer Science, pp. 13\u201322 (2013)","DOI":"10.1109\/LICS.2013.65"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Alur, R., D\u2019Antoni, L., Raghothaman, M.: DReX: a declarative language for efficiently evaluating regular string transformations. In: Proceedings of the 42nd Annual Symposium on Principles of Programming Languages, POPL 2015, pp. 125\u2013137. ACM (2015)","DOI":"10.1145\/2775051.2676981"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Alur, R., Freilich, A., Raghothaman, M.: Regular combinators for string transformations. In: The 29th Annual Symposium on Logic in Computer Science of Proceedings of the Joint Meeting of the 23rd Annual Conference on Computer Science Logic, CSL-LICS 2014, pp. 9:1\u20139:10. ACM (2014)","DOI":"10.1145\/2603088.2603151"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24607-7_1","volume-title":"Database Programming Languages","author":"A Arasu","year":"2004","unstructured":"Arasu, A., Babu, S., Widom, J.: CQL: a language for continuous queries over streams and relations. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 1\u201319. Springer, Heidelberg (2004)"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/603867.603884","volume":"30","author":"S Babu","year":"2001","unstructured":"Babu, S., Widom, J.: Continuous queries over data streams. SIGMOD Rec. 30(3), 109\u2013120 (2001)","journal-title":"SIGMOD Rec."},{"issue":"4\u20135","key":"2_CR10","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. Theoret. Comput. Sci. 411(4\u20135), 702\u2013715 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"2_CR11","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/1516512.1516515","volume":"56","author":"M Boja\u0144czyk","year":"2009","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees, XML reasoning. J. ACM 56(3), 13:1\u201313:48 (2009)","journal-title":"J. ACM"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/T-C.1971.223204","volume":"20","author":"R Book","year":"1971","unstructured":"Book, R., Even, S., Greibach, S., Ott, G.: Ambiguity in graphs and expressions. IEEE Trans. Comput. 20(2), 149\u2013153 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BFb0023820","volume-title":"LATIN \u201992","author":"A Br\u00fcggemann-Klein","year":"1992","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 87\u201398. Springer, Heidelberg (1992)"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/1805950.1805953","volume":"11","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.: Quantitative languages. ACM Trans. Comput. Logic 11(4), 23:1\u201323:38 (2010)","journal-title":"ACM Trans. Comput. Logic"},{"key":"2_CR15","unstructured":"Chen, Y., Davidson, S., Zheng, Y.: An efficient XPath query processor for XML streams. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006. IEEE Computer Society (2006)"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(94)90268-2","volume":"126","author":"B Courcelle","year":"1994","unstructured":"Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theoret. Comput. Sci. 126(1), 53\u201375 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/978-3-642-39799-8_41","volume-title":"Computer Aided Verification","author":"L D\u2019Antoni","year":"2013","unstructured":"D\u2019Antoni, L., Veanes, M.: Equivalence of extended symbolic finite transducers. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 624\u2013639. Springer, Heidelberg (2013)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Veanes, M.: Minimization of symbolic automata. In: Proceedings of the 41st Symposium on Principles of Programming Languages, POPL 2014, pp. 541\u2013553. ACM (2014)","DOI":"10.1145\/2535838.2535849"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Veanes, M., Livshits, B., Molnar, D.: Fast: a transducer-based language for tree manipulation. In: Proceedings of the 35th Conference on Programming Language Design and Implementation, PLDI 2014, pp. 384\u2013394. ACM (2014)","DOI":"10.1145\/2666356.2594309"},{"issue":"9","key":"2_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1995376.1995394","volume":"54","author":"L Moura de","year":"2011","unstructured":"de Moura, L., Bj\u00f8rner, N.: Satisfiability modulo theories: introduction and applications. Commun. ACM 54(9), 69\u201377 (2011)","journal-title":"Commun. ACM"},{"key":"2_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer, Heidelberg (2009)","edition":"1"},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/inco.1999.2807","volume":"154","author":"J Engelfriet","year":"1999","unstructured":"Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inf. Comput. 154(1), 34\u201391 (1999)","journal-title":"Inf. Comput."},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0022-0000(85)90066-2","volume":"31","author":"J Engelfriet","year":"1985","unstructured":"Engelfriet, J., Vogler, H.: Macro tree transducers. J. Comput. Syst. Sci. 31(1), 71\u2013146 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR24","unstructured":"Hooimeijer, P., Livshits, B., Molnar, D., Saxena, P., Veanes, M.: Fast and precise sanitizer analysis with BEK. In: Proceedings of the 20th USENIX Conference on Security, SEC 2011. USENIX Association (2011)"},{"issue":"2","key":"2_CR25","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. Theoret. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR26","doi-asserted-by":"crossref","first-page":"3634","DOI":"10.1007\/978-0-387-39940-9_473","volume-title":"Encyclopedia of Database Systems","author":"C Koch","year":"2009","unstructured":"Koch, C.: XML stream processing. In: Liu, L., \u00d6zsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 3634\u20133637. Springer, Heidelberg (2009)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Kulkarni, S., Bhagat, N., Fu, M., Kedigehalli, V., Kellogg, C., Mittal, S., Patel, J., Ramasamy, K., Taneja, S., Heron, T.: Stream processing at scale. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2015, pp. 239\u2013250. ACM (2015)","DOI":"10.1145\/2723372.2742788"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Mozafari, B., Zeng, K., Zaniolo, C.: High-performance complex event processing over XML streams. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2012, pp. 253\u2013264. ACM (2012)","DOI":"10.1145\/2213836.2213866"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Munro, I., Paterson, M.: Selection and sorting with limited storage. In: Proceedings of the 19th Annual Symposium on Foundations of Computer Science, SFCS 1978, pp. 253\u2013258. IEEE Computer Society (1978)","DOI":"10.1109\/SFCS.1978.32"},{"issue":"2","key":"2_CR30","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theoret. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Found. Trends Theoret. Comput. Sci."},{"issue":"2","key":"2_CR31","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/210376.197409","volume":"27","author":"J Paakki","year":"1995","unstructured":"Paakki, J.: Attribute grammar paradigms\u2013a high-level methodology in language implementation. ACM Comput. Surv. 27(2), 196\u2013255 (1995)","journal-title":"ACM Comput. Surv."},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-71389-0_24","volume-title":"Foundations of Software Science and Computational Structures","author":"G Ro\u015fu","year":"2007","unstructured":"Ro\u015fu, G.: An effective algorithm for the membership problem for extended regular expressions. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 332\u2013345. Springer, Heidelberg (2007)"},{"key":"2_CR33","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2012","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Cengage Learning, Boston (2012)","edition":"3"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Stearns, R., Hunt, H.: On the equivalence and containment problems for unambiguous regular expressions, grammars, and automata. In: Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, pp. 74\u201381. IEEE Computer Society (1981)","DOI":"10.1109\/SFCS.1981.29"},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/978-3-662-44202-9_15","volume-title":"ECOOP 2014 \u2013 Object-Oriented Programming","author":"M Vaziri","year":"2014","unstructured":"Vaziri, M., Tardieu, O., Rabbah, R., Suter, P., Hirzel, M.: Stream processing with a spreadsheet. In: Jones, R. (ed.) ECOOP 2014. LNCS, vol. 8586, pp. 360\u2013384. Springer, Heidelberg (2014)"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Veanes, M., Hooimeijer, P., Livshits, B., Molnar, D., Bjorner, N.: Symbolic finite state transducers: algorithms and applications. In: Proceedings of the 39th Annual Symposium on Principles of Programming Languages, pp. 137\u2013150. ACM (2012)","DOI":"10.1145\/2103656.2103674"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Zutshi, A., Sankaranarayanan, S., Deshmukh, J., Kapinski, J., Jin, X.: Falsification of safety properties for closed loop control systems. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, HSCC 2015, pp. 299\u2013300. ACM (2015)","DOI":"10.1145\/2728606.2728648"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49498-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:35:11Z","timestamp":1748813711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49498-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662494974","9783662494981"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49498-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}