{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T21:01:18Z","timestamp":1751662878193,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1919197"],"award-info":[{"award-number":["1919197"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,2,17]]},"DOI":"10.1145\/3437801.3441617","type":"proceedings-article","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T23:04:20Z","timestamp":1613862260000},"page":"47-61","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Reasoning about recursive tree traversals"],"prefix":"10.1145","author":[{"given":"Yanjun","family":"Wang","sequence":"first","affiliation":[{"name":"Purdue University"}]},{"given":"Jinwei","family":"Liu","sequence":"additional","affiliation":[{"name":"Beijing Jiaotong University, Beijing, China"}]},{"given":"Dalin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Beijing Jiaotong University, Beijing, China"}]},{"given":"Xiaokang","family":"Qiu","sequence":"additional","affiliation":[{"name":"Purdue University"}]}],"member":"320","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"volume-title":"Static Analysis","author":"Amiranoff Pierre","key":"e_1_3_2_1_1_1","unstructured":"Pierre Amiranoff , Albert Cohen , and Paul Feautrier . 2006. Beyond Iteration Vectors: Instancewise Relational Abstract Domains . In Static Analysis , Kwangkeun Yi (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 161--180. Pierre Amiranoff, Albert Cohen, and Paul Feautrier. 2006. Beyond Iteration Vectors: Instancewise Relational Abstract Domains. In Static Analysis, Kwangkeun Yi (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 161--180."},{"key":"e_1_3_2_1_2_1","unstructured":"Johan Bleuzen. 2015. cssmin. https:\/\/www.npmjs.com\/package\/cssmin  Johan Bleuzen. 2015. cssmin. https:\/\/www.npmjs.com\/package\/cssmin"},{"key":"e_1_3_2_1_3_1","unstructured":"Ben Briggs. 2015. cssnano. https:\/\/cssnano.co\/  Ben Briggs. 2015. cssnano. https:\/\/cssnano.co\/"},{"key":"e_1_3_2_1_4_1","unstructured":"Steve Clay. 2007. minify. https:\/\/github.com\/mrclay\/minify  Steve Clay. 2007. minify. https:\/\/github.com\/mrclay\/minify"},{"key":"e_1_3_2_1_5_1","first-page":"6","article-title":"Fast","volume":"49","author":"D'Antoni Loris","year":"2014","unstructured":"Loris D'Antoni , Margus Veanes , Benjamin Livshits , and David Molnar . 2014 . Fast : A Transducer-based Language for Tree Manipulation. SIGPLAN Not. 49 , 6 (jun 2014), 384--394. Loris D'Antoni, Margus Veanes, Benjamin Livshits, and David Molnar. 2014. Fast: A Transducer-based Language for Tree Manipulation. SIGPLAN Not. 49, 6 (jun 2014), 384--394.","journal-title":"A Transducer-based Language for Tree Manipulation. SIGPLAN Not."},{"key":"e_1_3_2_1_6_1","unstructured":"Roman Dvornov. 2011. csso. https:\/\/github.com\/css\/csso  Roman Dvornov. 2011. csso. https:\/\/github.com\/css\/csso"},{"volume-title":"Computer Aided Verification","author":"Elgaard Jacob","key":"e_1_3_2_1_7_1","unstructured":"Jacob Elgaard , Nils Klarlund , and Anders M\u00f8ller . 1998. MONA 1.x : New techniques for WS1S and WS2S . In Computer Aided Verification , Alan J. Hu and Moshe Y. Vardi (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 516--520. Jacob Elgaard, Nils Klarlund, and Anders M\u00f8ller. 1998. MONA 1.x: New techniques for WS1S and WS2S. In Computer Aided Verification, Alan J. Hu and Moshe Y. Vardi (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 516--520."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/647474.727598"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3310337"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048104"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384643"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/582153.582161"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2012.09.002"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772763"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442535"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1095587"},{"key":"e_1_3_2_1_18_1","unstructured":"Jakub Pawlowicz. 2011. clean-css. https:\/\/github.com\/jakubpawlowicz\/clean-css  Jakub Pawlowicz. 2011. clean-css. https:\/\/github.com\/jakubpawlowicz\/clean-css"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062346"},{"key":"e_1_3_2_1_20_1","unstructured":"Xiaokang Qiu. 2020. Streaming Transformations of Infinite Ordered-Data Words. arXiv:2001.06952 [cs.FL] https:\/\/arxiv.org\/abs\/2001.06952  Xiaokang Qiu. 2020. Streaming Transformations of Infinite Ordered-Data Words. arXiv:2001.06952 [cs.FL] https:\/\/arxiv.org\/abs\/2001.06952"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.39"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2892208.2892228"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429128"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349325"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133900"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314592"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00179-2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0023"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00183-2"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90147-A"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737972"}],"event":{"name":"PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Virtual Event Republic of Korea","acronym":"PPoPP '21"},"container-title":["Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441617","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437801.3441617","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437801.3441617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:26Z","timestamp":1750191446000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,17]]},"references-count":31,"alternative-id":["10.1145\/3437801.3441617","10.1145\/3437801"],"URL":"https:\/\/doi.org\/10.1145\/3437801.3441617","relation":{},"subject":[],"published":{"date-parts":[[2021,2,17]]},"assertion":[{"value":"2021-02-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}