{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:13:37Z","timestamp":1784837617589,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"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":[[2017,6,14]]},"DOI":"10.1145\/3062341.3062384","type":"proceedings-article","created":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T10:01:04Z","timestamp":1497434464000},"page":"602-617","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Flatten and conquer: a framework for efficient analysis of string constraints"],"prefix":"10.1145","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[{"name":"Uppsala University, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed Faouzi","family":"Atig","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu-Fang","family":"Chen","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bui Phi","family":"Diep","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luk\u00e1\u0161","family":"Hol\u00edk","sequence":"additional","affiliation":[{"name":"Brno University of Technology, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmed","family":"Rezine","sequence":"additional","affiliation":[{"name":"Link\u00f6ping University, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philipp","family":"R\u00fcmmer","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"e_1_3_2_2_1_1","series-title":"LNCS","first-page":"360","volume-title":"CONCUR\u201904","author":"Abdulla P. A.","unstructured":"P. A. Abdulla , B. Jonsson , M. Nilsson , and M. Saksena . A survey of regular model checking . In CONCUR\u201904 , volume 170 of LNCS , pages 348\u2013 360 . Springer, 2004. P. A. Abdulla, B. Jonsson, M. Nilsson, and M. Saksena. A survey of regular model checking. In CONCUR\u201904, volume 170 of LNCS, pages 348\u2013360. Springer, 2004."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_10"},{"key":"e_1_3_2_2_3_1","series-title":"LNCS","first-page":"469","volume-title":"CAV\u201915","author":"Abdulla P. A.","unstructured":"P. A. Abdulla , M. F. Atig , Y. Chen , L. Hol\u00b4\u0131k , A. Rezine , P. R\u00fcmmer , and J. Stenman . Norn: An SMT solver for string constraints . In CAV\u201915 , volume 9206 of LNCS , pages 462\u2013 469 . Springer, 2015. P. A. Abdulla, M. F. Atig, Y. Chen, L. Hol\u00b4\u0131k, A. Rezine, P. R\u00fcmmer, and J. Stenman. Norn: An SMT solver for string constraints. In CAV\u201915, volume 9206 of LNCS, pages 462\u2013 469. Springer, 2015."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85361-9_29"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_45"},{"key":"e_1_3_2_2_6_1","first-page":"177","volume-title":"LNCS","author":"Barrett C.","unstructured":"C. Barrett , C. L. Conway , M. Deters , L. Hadarean , D. Jovanovi\u00b4c , T. King , A. Reynolds , and C. Tinelli . CVC4. In TACAS\u201911 , LNCS , pages 171\u2013 177 . Springer, 2011. C. Barrett, C. L. Conway, M. Deters, L. Hadarean, D. Jovanovi\u00b4c, T. King, A. Reynolds, and C. Tinelli. CVC4. In TACAS\u201911, LNCS, pages 171\u2013177. Springer, 2011."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-011-9237-y"},{"key":"e_1_3_2_2_8_1","volume-title":"Definability in the existential theory of concatenation and undecidable extensions of this theory. Z. Math. Logik Grundlagen Math., 34(4)","author":"B\u00fcchi J. R.","year":"1988","unstructured":"J. R. B\u00fcchi and S. Senger . Definability in the existential theory of concatenation and undecidable extensions of this theory. Z. Math. Logik Grundlagen Math., 34(4) , 1988 . J. R. B\u00fcchi and S. Senger. Definability in the existential theory of concatenation and undecidable extensions of this theory. Z. Math. Logik Grundlagen Math., 34(4), 1988."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_7"},{"key":"e_1_3_2_2_10_1","volume-title":"On constructing obstruction sets of words. Bulletin of the EATCS, (44):178\u2013186","author":"Courcelle B.","year":"1991","unstructured":"B. Courcelle . On constructing obstruction sets of words. Bulletin of the EATCS, (44):178\u2013186 , 1991 . B. Courcelle. On constructing obstruction sets of words. Bulletin of the EATCS, (44):178\u2013186, 1991."},{"key":"e_1_3_2_2_11_1","series-title":"LNCS","first-page":"340","volume-title":"TACAS\u201908","author":"De Moura L.","unstructured":"L. De Moura and N. Bj\u00f8rner . Z3: An efficient SMT solver . In TACAS\u201908 , volume 4963 of LNCS , pages 337\u2013 340 . Springer, 2008. L. De Moura and N. Bj\u00f8rner. Z3: An efficient SMT solver. In TACAS\u201908, volume 4963 of LNCS, pages 337\u2013340. Springer, 2008."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_49"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926443"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.03.019"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.39"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629644"},{"key":"e_1_3_2_2_17_1","volume-title":"Undecidability of a theory of strings, linear arithmetic over length, and string-number conversion. CoRR, abs\/1605.09442","author":"Ganesh V.","year":"2016","unstructured":"V. Ganesh and M. Berzish . Undecidability of a theory of strings, linear arithmetic over length, and string-number conversion. CoRR, abs\/1605.09442 , 2016 . V. Ganesh and M. Berzish. Undecidability of a theory of strings, linear arithmetic over length, and string-number conversion. CoRR, abs\/1605.09442, 2016."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39611-3_21"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-011-0136-y"},{"key":"e_1_3_2_2_20_1","volume-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg S.","year":"1966","unstructured":"S. Ginsburg . The Mathematical Theory of Context-Free Languages . McGraw-Hill, Inc. , 1966 . S. Ginsburg. The Mathematical Theory of Context-Free Languages. McGraw-Hill, Inc., 1966."},{"issue":"2","key":"e_1_3_2_2_21_1","first-page":"333","article-title":"Bounded algol-like languages","volume":"113","author":"Ginsburg S.","year":"1964","unstructured":"S. Ginsburg and E. H. Spanier . Bounded algol-like languages . Transactions of the American Mathematical Society , 113 ( 2 ): 333 \u2013 368 , 1964 . S. Ginsburg and E. H. Spanier. Bounded algol-like languages. Transactions of the American Mathematical Society, 113(2): 333\u2013368, 1964.","journal-title":"Transactions of the American Mathematical Society"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379022.1375607"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2643003"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572286"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_43"},{"key":"e_1_3_2_2_26_1","volume-title":"CVC4","author":"Liang T.","year":"2016","unstructured":"T. Liang , A. Reynolds , C. Tinelli , C. Barrett , and M. Deters . CVC4 , 2016 . T. Liang, A. Reynolds, C. Tinelli, C. Barrett, and M. Deters. CVC4, 2016."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837641"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28872-2_25"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814304"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"e_1_3_2_2_31_1","first-page":"85","volume-title":"New Computational Paradigms","author":"Matiyasevich Y.","unstructured":"Y. Matiyasevich . Computation paradigms in light of hilberts tenth problem . In New Computational Paradigms , pages 59\u2013 85 . Springer, New York, 2008. Y. Matiyasevich. Computation paradigms in light of hilberts tenth problem. In New Computational Paradigms, pages 59\u2013 85. Springer, New York, 2008."},{"key":"e_1_3_2_2_32_1","volume-title":"Springer Netherlands","author":"Mohri M.","year":"2001","unstructured":"M. Mohri and M.-J. Nederhof . Regular Approximation of Context-Free Grammars through Transformation, pages 153\u2013 163 . Springer Netherlands , Dordrecht , 2001 . M. Mohri and M.-J. Nederhof. Regular Approximation of Context-Free Grammars through Transformation, pages 153\u2013 163. Springer Netherlands, Dordrecht, 2001."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796529"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132584"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.2307\/2268308"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764919"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.38"},{"key":"e_1_3_2_2_39_1","volume-title":"FLAX: Systematic discovery of client-side validation vulnerabilities in rich web applications","author":"Saxena P.","year":"2010","unstructured":"P. Saxena , S. Hanna , P. Poosankam , and D. Song . FLAX: Systematic discovery of client-side validation vulnerabilities in rich web applications . In NDSS. The Internet Society , 2010 . P. Saxena, S. Hanna, P. Poosankam, and D. Song. FLAX: Systematic discovery of client-side validation vulnerabilities in rich web applications. In NDSS. The Internet Society, 2010."},{"key":"e_1_3_2_2_40_1","first-page":"150","volume-title":"IWWERT","author":"Schulz K. U.","year":"1990","unstructured":"K. U. Schulz . Makanin\u2019s algorithm for word equations - two improvements and a generalization . In IWWERT , pages 85\u2013 150 , 1990 . K. U. Schulz. Makanin\u2019s algorithm for word equations - two improvements and a generalization. In IWWERT, pages 85\u2013 150, 1990."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111320.1111070"},{"key":"e_1_3_2_2_42_1","series-title":"LNCS","first-page":"240","volume-title":"CAV\u201916","author":"Trinh M.","unstructured":"M. Trinh , D. Chu , and J. Jaffar . Progressive reasoning over recursively-defined strings . In CAV\u201916 , volume 9779 of LNCS , pages 218\u2013 240 . Springer, 2016. M. Trinh, D. Chu, and J. Jaffar. Progressive reasoning over recursively-defined strings. In CAV\u201916, volume 9779 of LNCS, pages 218\u2013240. Springer, 2016."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660372"},{"key":"e_1_3_2_2_44_1","series-title":"LNCS","first-page":"26","volume-title":"ICALP","author":"van Leeuwen J.","year":"1974","unstructured":"J. van Leeuwen . A generalisation of parikhs theorem in formal language theory. In ICALP , volume 14 of LNCS , pages 17\u2013 26 , 1974 . J. van Leeuwen. A generalisation of parikhs theorem in formal language theory. In ICALP, volume 14 of LNCS, pages 17\u201326, 1974."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90156-5"},{"key":"e_1_3_2_2_46_1","series-title":"LNCS","first-page":"260","volume-title":"CAV\u201916","author":"Wang H.","unstructured":"H. Wang , T. Tsai , C. Lin , F. Yu , and J. R. Jiang . String analysis via automata manipulation with logic circuit representation . In CAV\u201916 , volume 9779 of LNCS , pages 241\u2013 260 . Springer, 2016. H. Wang, T. Tsai, C. Lin, F. Yu, and J. R. Jiang. String analysis via automata manipulation with logic circuit representation. In CAV\u201916, volume 9779 of LNCS, pages 241\u2013260. Springer, 2016."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273442.1250739"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_13"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491456"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491456"},{"key":"e_1_3_2_2_51_1","series-title":"LNCS","first-page":"254","volume-title":"CAV\u201915","author":"Zheng Y.","unstructured":"Y. Zheng , V. Ganesh , S. Subramanian , O. Tripp , J. Dolby , and X. Zhang . Effective search-space pruning for solvers of string equations, regular expressions and length constraints . In CAV\u201915 , volume 9206 of LNCS , pages 235\u2013 254 . Springer, 2015. Y. Zheng, V. Ganesh, S. Subramanian, O. Tripp, J. Dolby, and X. Zhang. Effective search-space pruning for solvers of string equations, regular expressions and length constraints. In CAV\u201915, volume 9206 of LNCS, pages 235\u2013254. Springer, 2015."}],"event":{"name":"PLDI '17: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Barcelona Spain","acronym":"PLDI '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3062341.3062384","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3062341.3062384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:36:32Z","timestamp":1750203392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3062341.3062384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,14]]},"references-count":51,"alternative-id":["10.1145\/3062341.3062384","10.1145\/3062341"],"URL":"https:\/\/doi.org\/10.1145\/3062341.3062384","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3140587.3062384","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,6,14]]},"assertion":[{"value":"2017-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}