{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T22:56:45Z","timestamp":1769727405083,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:00:00Z","timestamp":1591833600000},"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":[[2020,6,11]]},"DOI":"10.1145\/3385412.3386034","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:40:10Z","timestamp":1591494010000},"page":"943-957","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Efficient handling of string-number conversion"],"prefix":"10.1145","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[{"name":"Uppsala University, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Faouzi","family":"Atig","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Fang","family":"Chen","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bui Phi","family":"Diep","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Dolby","sequence":"additional","affiliation":[{"name":"IBM Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Jank\u016f","sequence":"additional","affiliation":[{"name":"Brno University of Technology, Czechia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsin-Hung","family":"Lin","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luk\u00e1\u0161","family":"Hol\u00edk","sequence":"additional","affiliation":[{"name":"Brno University of Technology, Czechia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Cheng","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Southern California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062384"},{"key":"e_1_3_2_1_2_1","volume-title":"FMCAD 2018","author":"Abdulla Parosh Aziz","year":"2018","unstructured":"Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Luk\u00e1s Hol\u00edk, Ahmed Rezine, and Philipp R\u00fcmmer. 2018. Trau: SMT solver for string constraints. In 2018 Formal Methods in Computer Aided Design, FMCAD 2018, Austin, TX, USA, October 30 - November 2, 2018, Nikolaj Bj\u00f8rner and Arie Gurfinkel (Eds.). IEEE, 1\u20135."},{"key":"e_1_3_2_1_3_1","volume-title":"CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Proceedings (Lecture Notes in Computer Science), Armin Biere and Roderick Bloem (Eds.)","volume":"8559","author":"Abdulla Parosh Aziz","year":"2014","unstructured":"Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Luk\u00e1s Hol\u00edk, Ahmed Rezine, Philipp R\u00fcmmer, and Jari Stenman. 2014. String Constraints for Verification. In Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Proceedings (Lecture Notes in Computer Science), Armin Biere and Roderick Bloem (Eds.), Vol. 8559. Springer, 150\u2013166."},{"key":"e_1_3_2_1_4_1","volume-title":"CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I (Lecture Notes in Computer Science), Daniel Kroening and Corina S. Pasareanu (Eds.)","volume":"9206","author":"Abdulla Parosh Aziz","year":"2015","unstructured":"Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Luk\u00e1s Hol\u00edk, Ahmed Rezine, Philipp R\u00fcmmer, and Jari Stenman. 2015. Norn: An SMT Solver for String Constraints. In Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I (Lecture Notes in Computer Science), Daniel Kroening and Corina S. Pasareanu (Eds.), Vol. 9206. Springer, 462\u2013469."},{"key":"e_1_3_2_1_5_1","volume-title":"Bui Phi Diep, Luk\u00e1s Hol\u00edk, and Petr Janku.","author":"Abdulla Parosh Aziz","year":"2019","unstructured":"Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Luk\u00e1s Hol\u00edk, and Petr Janku. 2019."},{"key":"e_1_3_2_1_6_1","volume-title":"ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings (Lecture Notes in Computer Science), Yu-Fang Chen, Chih-Hong Cheng, and Javier Esparza (Eds.)","volume":"11781","author":"String Constraints Chain-Free","unstructured":"Chain-Free String Constraints. In Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings (Lecture Notes in Computer Science), Yu-Fang Chen, Chih-Hong Cheng, and Javier Esparza (Eds.), Vol. 11781. Springer, 277\u2013293."},{"key":"e_1_3_2_1_7_1","unstructured":"Abdulbaki Aydin William Eiers Lucas Bang Tegan Brennan Miroslav Gavrilov Tevfik Bultan and Fang Yu. 2018."},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 2018 ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/SIGSOFT FSE 2018, Lake Buena Vista, FL, USA","author":"Parameterized","year":"2018","unstructured":"Parameterized model counting for string and numeric constraints. In Proceedings of the 2018 ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/SIGSOFT FSE 2018, Lake Buena Vista, FL, USA, November 04-09, 2018, Gary T. Leavens, Alessandro Garcia, and Corina S. Pasareanu (Eds.). ACM, 400\u2013410."},{"key":"e_1_3_2_1_9_1","volume-title":"Graph Logics with Rational Relations. Logical Methods in Computer Science 9, 3","author":"Barcel\u00f3 Pablo","year":"2013","unstructured":"Pablo Barcel\u00f3, Diego Figueira, and Leonid Libkin. 2013. Graph Logics with Rational Relations. Logical Methods in Computer Science 9, 3 (2013)."},{"key":"e_1_3_2_1_10_1","volume-title":"CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings (Lecture Notes in Computer Science), Ganesh Gopalakrishnan and Shaz Qadeer (Eds.)","volume":"6806","author":"Barrett Clark W.","year":"2011","unstructured":"Clark W. Barrett, Christopher L. Conway, Morgan Deters, Liana Hadarean, Dejan Jovanovic, Tim King, Andrew Reynolds, and Cesare Tinelli. 2011. CVC4. In Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings (Lecture Notes in Computer Science), Ganesh Gopalakrishnan and Shaz Qadeer (Eds.), Vol. 6806. Springer, 171\u2013177."},{"key":"e_1_3_2_1_11_1","volume-title":"FMCAD 2017","author":"Berzish Murphy","year":"2017","unstructured":"Murphy Berzish, Vijay Ganesh, and Yunhui Zheng. 2017. Z3str3: A string solver with theory-aware heuristics. In 2017 Formal Methods in Computer Aided Design, FMCAD 2017, Vienna, Austria, October 2-6, 2017, Daryl Stewart and Georg Weissenbacher (Eds.). IEEE, 55\u201359."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96142-2_6"},{"key":"e_1_3_2_1_13_1","unstructured":"Springer 45\u201351."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19880340410"},{"key":"e_1_3_2_1_15_1","unstructured":"Taolue Chen Yan Chen Matthew Hague Anthony W. Lin and Zhilin Wu. 2018."},{"key":"e_1_3_2_1_16_1","volume-title":"3:1\u20133:29","author":"What","year":"2018","unstructured":"What is decidable about string constraints with the ReplaceAll function. PACMPL 2, POPL (2018), 3:1\u20133:29."},{"key":"e_1_3_2_1_17_1","unstructured":"Taolue Chen Matthew Hague Anthony W. Lin Philipp R\u00fcmmer and Zhilin Wu. 2019."},{"key":"e_1_3_2_1_18_1","volume-title":"49:1\u201349:30","author":"Decision","year":"2019","unstructured":"Decision procedures for path feasibility of stringmanipulating programs with complex operations. PACMPL 3, POPL (2019), 49:1\u201349:30."},{"key":"e_1_3_2_1_19_1","volume-title":"RP 2018, Marseille, France, September 24-26, 2018, Proceedings (Lecture Notes PLDI \u201920","volume":"11123","author":"Day Joel D.","year":"2018","unstructured":"Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, and Dirk Nowotka. 2018. The Satisfiability of Word Equations: Decidable and Undecidable Theories. In Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings (Lecture Notes PLDI \u201920, June 15\u201320, 2020, London, UK P.A. Abdulla, M.F. Atig, Y-F. Chen, B.P. Diep, P. Jank\u016f, H-H. Lin, L. Hol\u00edk, and W-C. Wu in Computer Science), Igor Potapov and Pierre-Alain Reynier (Eds.), Vol. 11123. Springer, 15\u201329."},{"key":"e_1_3_2_1_20_1","unstructured":"Leonardo Mendon\u00e7a de Moura and Nikolaj Bj\u00f8rner. 2008."},{"key":"e_1_3_2_1_21_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS","year":"2008","unstructured":"Z3: An Efficient SMT Solver. In Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings (Lecture Notes in Computer Science), C. R. Ramakrishnan and Jakob Rehof (Eds.), Vol. 4963. Springer, 337\u2013340."},{"key":"e_1_3_2_1_22_1","volume-title":"European Computer Manufacturers Association, et al","author":"Script ECMA","year":"2019","unstructured":"ECMA ECMAScript, European Computer Manufacturers Association, et al. 2019. Ecmascript language specification. https:\/\/www.ecmainternational.org\/ecma-262\/"},{"key":"e_1_3_2_1_23_1","volume-title":"ATVA 2015, Shanghai, China, October 12-15, 2015, Proceedings (Lecture Notes in Computer Science), Bernd Finkbeiner, Geguang Pu, and Lijun Zhang (Eds.)","volume":"9364","author":"Gan Ting","year":"2015","unstructured":"Ting Gan, Mingshuai Chen, Liyun Dai, Bican Xia, and Naijun Zhan. 2015. Decidability of the Reachability for a Family of Linear Vector Fields. In Automated Technology for Verification and Analysis - 13th International Symposium, ATVA 2015, Shanghai, China, October 12-15, 2015, Proceedings (Lecture Notes in Computer Science), Bernd Finkbeiner, Geguang Pu, and Lijun Zhang (Eds.), Vol. 9364. Springer, 482\u2013499."},{"key":"e_1_3_2_1_24_1","unstructured":"Ting Gan Mingshuai Chen Yangjia Li Bican Xia and Naijun Zhan. 2018."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Reachability Analysis for Solvable Dynamical Systems. IEEE Trans. Automat. Contr. 63 7 (2018) 2003\u20132018.","DOI":"10.1109\/TAC.2017.2763785"},{"key":"e_1_3_2_1_26_1","unstructured":"Vijay Ganesh and Murphy Berzish. 2016."},{"key":"e_1_3_2_1_27_1","volume-title":"Linear Arithmetic over Length, and String-Number Conversion. CoRR abs\/1605.09442","author":"Strings Undecidability","year":"2016","unstructured":"Undecidability of a Theory of Strings, Linear Arithmetic over Length, and String-Number Conversion. CoRR abs\/1605.09442 (2016). arXiv: 1605.09442 http: \/\/arxiv.org\/abs\/1605.09442"},{"key":"e_1_3_2_1_28_1","volume-title":"8th International Haifa Verification Conference, HVC 2012","author":"Ganesh Vijay","year":"2012","unstructured":"Vijay Ganesh, Mia Minnes, Armando Solar-Lezama, and Martin C. Rinard. 2012. Word Equations with Length Constraints: What\u2019s Decidable?. In Hardware and Software: Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Haifa, Israel, November 6-8, 2012. Revised Selected Papers (Lecture Notes in Computer Science), Armin Biere, Amir Nahir, and Tanja E. J. Vos (Eds.), Vol. 7857. Springer, 209\u2013226."},{"key":"e_1_3_2_1_29_1","volume-title":"POPL","author":"Hol\u00edk Luk\u00e1s","year":"2018","unstructured":"Luk\u00e1s Hol\u00edk, Petr Janku, Anthony W. Lin, Philipp R\u00fcmmer, and Tom\u00e1s Vojnar. 2018. String constraints with concatenation and transducers solved efficiently. PACMPL 2, POPL (2018), 4:1\u20134:32."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2643003"},{"key":"e_1_3_2_1_31_1","volume-title":"Ernst","author":"Kiezun Adam","year":"2009","unstructured":"Adam Kiezun, Vijay Ganesh, Philip J. Guo, Pieter Hooimeijer, and Michael D. Ernst. 2009."},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009","author":"HAMPI","year":"2009","unstructured":"HAMPI: a solver for string constraints. In Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009, Chicago, IL, USA, July 19-23, 2009, Gregg Rothermel and Laura K. Dillon (Eds.). ACM, 105\u2013116."},{"key":"e_1_3_2_1_33_1","volume-title":"Reps","author":"Kincaid Zachary","year":"2019","unstructured":"Zachary Kincaid, Jason Breck, John Cyphert, and Thomas W. Reps. 2019."},{"key":"e_1_3_2_1_34_1","volume-title":"55:1\u201355:29","author":"Closed","year":"2019","unstructured":"Closed forms for numerical loops. PACMPL 3, POPL (2019), 55:1\u201355:29."},{"key":"e_1_3_2_1_35_1","unstructured":"Leetcode. 2019. LeetCode. https:\/\/leetcode.com\/"},{"key":"e_1_3_2_1_36_1","volume-title":"HVC 2013, Haifa, Israel, November 5-7, 2013, Proceedings (Lecture Notes in Computer Science), Valeria Bertacco and Axel Legay (Eds.)","volume":"8244","author":"Li Guodong","year":"2013","unstructured":"Guodong Li and Indradeep Ghosh. 2013. PASS: String Solving with Parameterized Array and Interval Automaton. In Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, HVC 2013, Haifa, Israel, November 5-7, 2013, Proceedings (Lecture Notes in Computer Science), Valeria Bertacco and Axel Legay (Eds.), Vol. 8244."},{"key":"e_1_3_2_1_37_1","unstructured":"Springer 15\u201331."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837641"},{"key":"e_1_3_2_1_39_1","first-page":"147","article-title":"The problem of solvability of equations in a free semigroup","volume":"145","author":"Makanin Gennadiy Semenovich","year":"1977","unstructured":"Gennadiy Semenovich Makanin. 1977. The problem of solvability of equations in a free semigroup. Matematicheskii Sbornik 145, 2 (1977), 147\u2013236.","journal-title":"Matematicheskii Sbornik"},{"key":"e_1_3_2_1_40_1","volume-title":"New Computational Paradigms: Changing Conceptions of What is Computable","author":"Matiyasevich Yuri","unstructured":"Yuri Matiyasevich. 2008. Computation Paradigms in Light of Hilbert\u2019s Tenth Problem. In New Computational Paradigms: Changing Conceptions of What is Computable, S. Barry Cooper, Benedikt L\u00f6we, and Andrea Sorbi (Eds.). Springer New York, New York, NY, 59\u201385."},{"key":"e_1_3_2_1_41_1","unstructured":"Wojciech Plandowski. 1999."},{"key":"e_1_3_2_1_42_1","volume-title":"40th Annual Symposium on Foundations of Computer Science, FOCS \u201999","author":"Word Satisfiability","year":"1999","unstructured":"Satisfiability of Word Equations with Constants is in PSPACE. In 40th Annual Symposium on Foundations of Computer Science, FOCS \u201999, 17-18 October, 1999, New York, NY, USA. IEEE Computer Society, 495\u2013500."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132584"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.2307\/2268308"},{"key":"e_1_3_2_1_45_1","volume-title":"CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II (Lecture Notes in Computer Science), Isil Dillig and Serdar Tasiran (Eds.)","volume":"11562","author":"Reynolds Andrew","year":"2019","unstructured":"Andrew Reynolds, Andres N\u00f6tzli, Clark W. Barrett, and Cesare Tinelli. 2019. High-Level Abstractions for Simplifying Extended String Constraints in SMT. In Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II (Lecture Notes in Computer Science), Isil Dillig and Serdar Tasiran (Eds.), Vol. 11562. Springer, 23\u201342."},{"key":"e_1_3_2_1_46_1","unstructured":"Andrew Reynolds Maverick Woo Clark W. Barrett David Brumley Tianyi Liang and Cesare Tinelli. 2017."},{"key":"e_1_3_2_1_47_1","volume-title":"CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II (Lecture Notes in Computer Science), Rupak Majumdar and Viktor Kuncak (Eds.)","volume":"10427","author":"String Solvers Using Scaling Up","unstructured":"Scaling Up DPLL(T) String Solvers Using Context-Dependent Simplification. In Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II (Lecture Notes in Computer Science), Rupak Majumdar and Viktor Kuncak (Eds.), Vol. 10427."},{"key":"e_1_3_2_1_48_1","unstructured":"Springer 453\u2013474."},{"key":"e_1_3_2_1_49_1","volume-title":"16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings (Lecture Notes in Computer Science), Christoph Meinel and Sophie Tison (Eds.)","volume":"1563","author":"Robson John Michael","year":"1999","unstructured":"John Michael Robson and Volker Diekert. 1999. On Quadratic Word Equations. In STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings (Lecture Notes in Computer Science), Christoph Meinel and Sophie Tison (Eds.), Vol. 1563. Springer, 217\u2013226."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236950.3236956"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.38"},{"key":"e_1_3_2_1_52_1","volume-title":"Proceedings of the Network and Distributed System Security Symposium, NDSS 2010","author":"Saxena Prateek","year":"2010","unstructured":"Prateek Saxena, Steve Hanna, Pongsin Poosankam, and Dawn Song. 2010. FLAX: Systematic Discovery of Client-side Validation Vulnerabilities in Rich Web Applications. In Proceedings of the Network and Distributed System Security Symposium, NDSS 2010, San Diego, California, USA, 28th February - 3rd March 2010. The Internet Society."},{"key":"e_1_3_2_1_53_1","unstructured":"Klaus U. Schulz. 1990."},{"key":"e_1_3_2_1_54_1","volume-title":"First International Workshop, IWWERT \u201990","author":"Word Makanin\u2019s Algorithm","year":"1990","unstructured":"Makanin\u2019s Algorithm for Word Equations - Two Improvements and a Generalization. In Word Equations and Related Topics, First International Workshop, IWWERT \u201990, T\u00fcbingen, Germany, October 1-3, 1990, Proceedings (Lecture Notes in Computer Science), Klaus U. Schulz (Ed.), Vol. 572. Springer, 85\u2013150."},{"key":"e_1_3_2_1_55_1","volume-title":"Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas] (Texts in Logic and Games), J\u00f6rg Flum, Erich Gr\u00e4del","author":"Seidl Helmut","unstructured":"Helmut Seidl, Thomas Schwentick, and Anca Muscholl. 2008. Counting in trees. In Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas] (Texts in Logic and Games), J\u00f6rg Flum, Erich Gr\u00e4del, and Thomas Wilke (Eds.), Vol. 2. Amsterdam University Press, 575\u2013 612."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660372"},{"key":"e_1_3_2_1_57_1","unstructured":"Efficient Handling of String-Number Conversion PLDI \u201920 June 15\u201320 2020 London UK"},{"key":"e_1_3_2_1_58_1","volume-title":"CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I (Lecture Notes in Computer Science), Swarat Chaudhuri and Azadeh Farzan (Eds.)","volume":"9779","author":"Trinh Minh-Thai","year":"2016","unstructured":"Minh-Thai Trinh, Duc-Hiep Chu, and Joxan Jaffar. 2016. Progressive Reasoning over Recursively-Defined Strings. In Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I (Lecture Notes in Computer Science), Swarat Chaudhuri and Azadeh Farzan (Eds.), Vol. 9779. Springer, 218\u2013240."},{"key":"e_1_3_2_1_59_1","volume-title":"CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I (Lecture Notes in Computer Science), Swarat Chaudhuri and Azadeh Farzan (Eds.)","volume":"9779","author":"Wang Hung-En","unstructured":"Hung-En Wang, Tzung-Lin Tsai, Chun-Han Lin, Fang Yu, and Jie-Hong R. Jiang. 2016. String Analysis via Automata Manipulation with Logic Circuit Representation. In Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I (Lecture Notes in Computer Science), Swarat Chaudhuri and Azadeh Farzan (Eds.), Vol. 9779. Springer, 241\u2013260."},{"key":"e_1_3_2_1_60_1","unstructured":"Fang Yu Muath Alkhalaf and Tevfik Bultan. 2010."},{"key":"e_1_3_2_1_61_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS","author":"Stranger","year":"2010","unstructured":"Stranger: An Automata-Based String Analysis Tool for PHP. In Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings (Lecture Notes in Computer Science), Javier Esparza and Rupak Majumdar (Eds.), Vol. 6015. Springer, 154\u2013157."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2931037.2931050"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-016-0263-6"}],"event":{"name":"PLDI '20: 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation","location":"London UK","acronym":"PLDI '20","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385412.3386034","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3385412.3386034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:49Z","timestamp":1750199929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385412.3386034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,11]]},"references-count":63,"alternative-id":["10.1145\/3385412.3386034","10.1145\/3385412"],"URL":"https:\/\/doi.org\/10.1145\/3385412.3386034","relation":{},"subject":[],"published":{"date-parts":[[2020,6,11]]},"assertion":[{"value":"2020-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}