{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:07:55Z","timestamp":1773655675959,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T00:00:00Z","timestamp":1296000000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,1,26]]},"DOI":"10.1145\/1926385.1926454","type":"proceedings-article","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T09:58:22Z","timestamp":1295863102000},"page":"599-610","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Streaming transducers for algorithmic verification of single-pass list-processing programs"],"prefix":"10.1145","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Pavol","family":"\u010cern\u00fd","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]}],"member":"320","published-online":{"date-parts":[[2011,1,26]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"FSTTCS","author":"Alur R.","year":"2010","unstructured":"R. Alur and P. \u010cern\u00fd . Expressivness of streaming string transducers. Invited paper . In FSTTCS , 2010 . R. Alur and P. \u010cern\u00fd. Expressivness of streaming string transducers. Invited paper. In FSTTCS, 2010."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1807662.1807674"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.51"},{"key":"e_1_3_2_2_4_1","first-page":"403","volume-title":"CAV","author":"Bouajjani A.","year":"2000","unstructured":"A. Bouajjani , B. Jonsson , M. Nilsson , and T. Touili . Regular model checking . In CAV , pages 403 -- 418 , 2000 . A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In CAV, pages 403--418, 2000."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_2"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_47"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763048.1763061"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_41"},{"key":"e_1_3_2_2_9_1","unstructured":"S. Chakraborty. Reasoning about heap manipulating programs using automata techniques. To appear in IISc-World Scientific Review Volume on Modern Applications of Automata Theory.  S. Chakraborty. Reasoning about heap manipulating programs using automata techniques. To appear in IISc-World Scientific Review Volume on Modern Applications of Automata Theory."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11691372_19"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/371316.371512"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/161494.161501"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_13"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763507.1763512"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013560.1013562"},{"key":"e_1_3_2_2_16_1","volume-title":"Types and programming languages","author":"Pierce B.","year":"2002","unstructured":"B. Pierce . Types and programming languages . MIT Press , 2002 . B. Pierce. Types and programming languages. MIT Press, 2002."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706330"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/186025.186041"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/514188.514190"},{"key":"e_1_3_2_2_20_1","volume-title":"Regular model checking using widening techniques. Electr. Notes Theor. Comput. Sci., 50 (4)","author":"Touili T.","year":"2001","unstructured":"T. Touili . Regular model checking using widening techniques. Electr. Notes Theor. Comput. Sci., 50 (4) , 2001 . T. Touili. Regular model checking using widening techniques. Electr. Notes Theor. Comput. Sci., 50 (4), 2001."}],"event":{"name":"POPL '11: The 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Austin Texas USA","acronym":"POPL '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926454","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1926385.1926454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:52:46Z","timestamp":1750229566000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,26]]},"references-count":20,"alternative-id":["10.1145\/1926385.1926454","10.1145\/1926385"],"URL":"https:\/\/doi.org\/10.1145\/1926385.1926454","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1925844.1926454","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,1,26]]},"assertion":[{"value":"2011-01-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}