{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:22:07Z","timestamp":1751660527497,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"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":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533329","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Satisfiability of Context-free String Constraints with Subword-Ordering"],"prefix":"10.1145","author":[{"given":"C.","family":"Aiswarya","sequence":"first","affiliation":[{"name":"Chennai Mathematical Institute, India and CNRS IRL ReLaX, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soumodev","family":"Mal","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Saivasan","sequence":"additional","affiliation":[{"name":"The Institute of Mathematical Sciences, HBNI, India and CNRS IRL ReLaX, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design","author":"Abdulla Parosh","year":"2019","unstructured":"A.\u00a0 Parosh Abdulla , F.\u00a0 Mohamed Atig , Yu-Fang Chen , Diep\u00a0Phi Bui , Luk\u00e1\u0161 Hol\u00edk , Ahmed Rezine , and Philipp Rummer . 2019 . Trau : SMT solver for string constraints . In Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design ( Austin, US). FMCAD Inc., 165\u2013169. https:\/\/doi.org\/10.23919\/FMCAD. 2018.8602997 10.23919\/FMCAD.2018.8602997 A.\u00a0Parosh Abdulla, F.\u00a0Mohamed Atig, Yu-Fang Chen, Diep\u00a0Phi Bui, Luk\u00e1\u0161 Hol\u00edk, Ahmed Rezine, and Philipp Rummer. 2019. Trau : SMT solver for string constraints. In Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design (Austin, US). FMCAD Inc., 165\u2013169. https:\/\/doi.org\/10.23919\/FMCAD.2018.8602997"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of 8th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society","author":"Abdulla P.","year":"1993","unstructured":"P. Abdulla and B. Jonsson . 1993. Verifying programs with unreliable channels . In Proceedings of 8th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society , Los Alamitos, CA, USA. https:\/\/doi.org\/10.1109\/LICS. 1993 .287591 10.1109\/LICS.1993.287591 P. Abdulla and B. Jonsson. 1993. Verifying programs with unreliable channels. In Proceedings of 8th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society, Los Alamitos, CA, USA. https:\/\/doi.org\/10.1109\/LICS.1993.287591"},{"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, Vol.\u00a08559)","author":"Abdulla Parosh\u00a0Aziz","year":"2014","unstructured":"Parosh\u00a0Aziz Abdulla , Mohamed\u00a0Faouzi 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, Vol.\u00a08559) , Armin Biere and Roderick Bloem (Eds.). Springer. https:\/\/doi.org\/10.1007\/978-3-319-08867-9_10 10.1007\/978-3-319-08867-9_10 Parosh\u00a0Aziz Abdulla, Mohamed\u00a0Faouzi 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, Vol.\u00a08559), Armin Biere and Roderick Bloem (Eds.). Springer. https:\/\/doi.org\/10.1007\/978-3-319-08867-9_10"},{"key":"e_1_3_2_1_4_1","volume-title":"On the Separability Problem of String Constraints. In 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)(LIPIcs, Vol.\u00a0171)","author":"Abdulla Parosh\u00a0Aziz","year":"2020","unstructured":"Parosh\u00a0Aziz Abdulla , Mohamed\u00a0Faouzi Atig , Vrunda Dave , and Shankara\u00a0Narayanan Krishna . 2020 . On the Separability Problem of String Constraints. In 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)(LIPIcs, Vol.\u00a0171) , Igor Konnov and Laura Kov\u00e1cs (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR. 2020.16 10.4230\/LIPIcs.CONCUR.2020.16 Parosh\u00a0Aziz Abdulla, Mohamed\u00a0Faouzi Atig, Vrunda Dave, and Shankara\u00a0Narayanan Krishna. 2020. On the Separability Problem of String Constraints. In 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)(LIPIcs, Vol.\u00a0171), Igor Konnov and Laura Kov\u00e1cs (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.16"},{"key":"e_1_3_2_1_5_1","volume-title":"ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings(Lecture Notes in Computer Science, Vol.\u00a011781)","author":"Abdulla Parosh\u00a0Aziz","year":"2019","unstructured":"Parosh\u00a0Aziz Abdulla , Mohamed\u00a0Faouzi Atig , Bui\u00a0Phi Diep , Luk\u00e1s Hol\u00edk , and Petr Janku . 2019 . 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, Vol.\u00a011781) , Yu-Fang Chen, Chih-Hong Cheng, and Javier Esparza (Eds.). Springer. https:\/\/doi.org\/10.1007\/978-3-030-31784-3_16 10.1007\/978-3-030-31784-3_16 Parosh\u00a0Aziz Abdulla, Mohamed\u00a0Faouzi Atig, Bui\u00a0Phi Diep, Luk\u00e1s Hol\u00edk, and Petr Janku. 2019. 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, Vol.\u00a011781), Yu-Fang Chen, Chih-Hong Cheng, and Javier Esparza (Eds.). Springer. https:\/\/doi.org\/10.1007\/978-3-030-31784-3_16"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13635-020-00113-y"},{"key":"e_1_3_2_1_7_1","volume-title":"NETYS 2020, Marrakech, Morocco, June 3-5, 2020, Proceedings(Lecture Notes in Computer Science, Vol.\u00a012129)","author":"Aiswarya C.","year":"2020","unstructured":"C. Aiswarya . 2020 . On Network Topologies and the Decidability of Reachability Problem. In Networked Systems - 8th International Conference , NETYS 2020, Marrakech, Morocco, June 3-5, 2020, Proceedings(Lecture Notes in Computer Science, Vol.\u00a012129) , Chryssis Georgiou and Rupak Majumdar (Eds.). Springer, 3\u201310. https:\/\/doi.org\/10.1007\/978-3-030-67087-0_1 10.1007\/978-3-030-67087-0_1 C. Aiswarya. 2020. On Network Topologies and the Decidability of Reachability Problem. In Networked Systems - 8th International Conference, NETYS 2020, Marrakech, Morocco, June 3-5, 2020, Proceedings(Lecture Notes in Computer Science, Vol.\u00a012129), Chryssis Georgiou and Rupak Majumdar (Eds.). Springer, 3\u201310. https:\/\/doi.org\/10.1007\/978-3-030-67087-0_1"},{"key":"e_1_3_2_1_8_1","volume-title":"19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings(Lecture Notes in Computer Science, Vol.\u00a05201)","author":"Atig Mohamed\u00a0Faouzi","year":"2008","unstructured":"Mohamed\u00a0Faouzi Atig , Ahmed Bouajjani , and Tayssir Touili . 2008 . On the Reachability Analysis of Acyclic Networks of Pushdown Systems. In Concurrency Theory , 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings(Lecture Notes in Computer Science, Vol.\u00a05201) , Franck van Breugel and Marsha Chechik (Eds.). Springer. https:\/\/doi.org\/10.1007\/978-3-540-85361-9_29 10.1007\/978-3-540-85361-9_29 Mohamed\u00a0Faouzi Atig, Ahmed Bouajjani, and Tayssir Touili. 2008. On the Reachability Analysis of Acyclic Networks of Pushdown Systems. In Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings(Lecture Notes in Computer Science, Vol.\u00a05201), Franck van Breugel and Marsha Chechik (Eds.). Springer. https:\/\/doi.org\/10.1007\/978-3-540-85361-9_29"},{"key":"e_1_3_2_1_9_1","volume-title":"DLT 2013, Marne-la-Vall\u00e9e, France, June 18-21, 2013. Proceedings(Lecture Notes in Computer Science, Vol.\u00a07907)","author":"Atig Mohamed\u00a0Faouzi","year":"2013","unstructured":"Mohamed\u00a0Faouzi Atig , K.\u00a0 Narayan Kumar , and Prakash Saivasan . 2013 . Adjacent Ordered Multi-Pushdown Systems. In Developments in Language Theory - 17th International Conference , DLT 2013, Marne-la-Vall\u00e9e, France, June 18-21, 2013. Proceedings(Lecture Notes in Computer Science, Vol.\u00a07907) , Marie-Pierre B\u00e9al and Olivier Carton (Eds.). Springer, 58\u201369. https:\/\/doi.org\/10.1007\/978-3-642-38771-5_7 10.1007\/978-3-642-38771-5_7 Mohamed\u00a0Faouzi Atig, K.\u00a0Narayan Kumar, and Prakash Saivasan. 2013. Adjacent Ordered Multi-Pushdown Systems. In Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vall\u00e9e, France, June 18-21, 2013. Proceedings(Lecture Notes in Computer Science, Vol.\u00a07907), Marie-Pierre B\u00e9al and Olivier Carton (Eds.). Springer, 58\u201369. https:\/\/doi.org\/10.1007\/978-3-642-38771-5_7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.23919\/FMCAD.2017.8102241"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/322374.322380"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455518.1455522"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158091"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Taolue Chen Alejandro Flores-Lamas Matthew Hague Zhilei Han Denghang Hu Shuanglong Kan Anthony\u00a0Widjaja Lin Philipp R\u00fcmmer and Zhilin Wu. 2021. Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorities And Variables. CoRR abs\/2111.04298(2021).  Taolue Chen Alejandro Flores-Lamas Matthew Hague Zhilei Han Denghang Hu Shuanglong Kan Anthony\u00a0Widjaja Lin Philipp R\u00fcmmer and Zhilin Wu. 2021. Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorities And Variables. CoRR abs\/2111.04298(2021).","DOI":"10.1145\/3462309"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290362"},{"key":"e_1_3_2_1_16_1","volume-title":"On the Complexity of Bounded Context Switching. In 25th Annual European Symposium on Algorithms, ESA 2017","author":"Chini Peter","year":"2017","unstructured":"Peter Chini , Jonathan Kolberg , Andreas Krebs , Roland Meyer , and Prakash Saivasan . 2017 . On the Complexity of Bounded Context Switching. In 25th Annual European Symposium on Algorithms, ESA 2017 , September 4-6, 2017, Vienna, Austria(LIPIcs, Vol.\u00a087), Kirk Pruhsand Christian Sohler (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.ESA. 2017.27 10.4230\/LIPIcs.ESA.2017.27 Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, and Prakash Saivasan. 2017. On the Complexity of Bounded Context Switching. In 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria(LIPIcs, Vol.\u00a087), Kirk Pruhsand Christian Sohler (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.27"},{"key":"e_1_3_2_1_17_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\u00a0 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, Vol.\u00a07857), Armin Biere, Amir Nahir, and Tanja E.\u00a0J. Vos (Eds.). Springer. https:\/\/doi.org\/10.1007\/978-3-642-39611-3_21 10.1007\/978-3-642-39611-3_21 Vijay Ganesh, Mia Minnes, Armando Solar-Lezama, and Martin\u00a0C. 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, Vol.\u00a07857), Armin Biere, Amir Nahir, and Tanja E.\u00a0J. Vos (Eds.). Springer. https:\/\/doi.org\/10.1007\/978-3-642-39611-3_21"},{"volume-title":"Computers and Intractability","author":"Garey R.","key":"e_1_3_2_1_18_1","unstructured":"Michael\u00a0 R. Garey and David\u00a0 S. Johnson . 1990. Computers and Intractability ; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. , USA. Michael\u00a0R. Garey and David\u00a0S. Johnson. 1990. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158092"},{"key":"e_1_3_2_1_20_1","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft E.","unstructured":"John\u00a0 E. Hopcroft , Rajeev Motwani , and Jeffrey\u00a0 D. Ullman . 2006. Introduction to Automata Theory, Languages, and Computation ( 3 rd Edition). Addison-Wesley Longman Publishing Co., Inc. , USA. John\u00a0E. Hopcroft, Rajeev Motwani, and Jeffrey\u00a0D. Ullman. 2006. Introduction to Automata Theory, Languages, and Computation (3rd Edition). Addison-Wesley Longman Publishing Co., Inc., USA.","edition":"3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3497775.3503691"},{"key":"e_1_3_2_1_22_1","article-title":"HAMPI: A Solver for Word Equations over Strings, Regular Expressions, and Context-Free Grammars","volume":"21","author":"Kiezun Adam","year":"2013","unstructured":"Adam Kiezun , Vijay Ganesh , Shay Artzi , Philip\u00a0 J. Guo , Pieter Hooimeijer , and Michael\u00a0 D. Ernst . 2013 . HAMPI: A Solver for Word Equations over Strings, Regular Expressions, and Context-Free Grammars . ACM Trans. Softw. Eng. Methodol. 21 , 4, Article 25 (feb 2013). Adam Kiezun, Vijay Ganesh, Shay Artzi, Philip\u00a0J. Guo, Pieter Hooimeijer, and Michael\u00a0D. Ernst. 2013. HAMPI: A Solver for Word Equations over Strings, Regular Expressions, and Context-Free Grammars. ACM Trans. Softw. Eng. Methodol. 21, 4, Article 25 (feb 2013).","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"e_1_3_2_1_23_1","volume-title":"An Efficient SMT Solver for String Constraints. Form. Methods Syst. Des. 48, 3","author":"Liang Tianyi","year":"2016","unstructured":"Tianyi Liang , Andrew Reynolds , Nestan Tsiskaridze , Cesare Tinelli , Clark Barrett , and Morgan Deters . 2016. An Efficient SMT Solver for String Constraints. Form. Methods Syst. Des. 48, 3 ( 2016 ). https:\/\/doi.org\/10.1007\/s10703-016-0247-6 10.1007\/s10703-016-0247-6 Tianyi Liang, Andrew Reynolds, Nestan Tsiskaridze, Cesare Tinelli, Clark Barrett, and Morgan Deters. 2016. An Efficient SMT Solver for String Constraints. Form. Methods Syst. Des. 48, 3 (2016). https:\/\/doi.org\/10.1007\/s10703-016-0247-6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837641"},{"key":"e_1_3_2_1_25_1","volume-title":"The problem of solvability of equations in a free smigroup. Mathematics of the USSR-Sbornik 32(2)","author":"Makanin G\u00a0S","year":"1977","unstructured":"G\u00a0S Makanin . 1977. The problem of solvability of equations in a free smigroup. Mathematics of the USSR-Sbornik 32(2) ( 1977 ). https:\/\/doi.org\/10.1070\/SM1977v032n02ABEH002376 10.1070\/SM1977v032n02ABEH002376 G\u00a0S Makanin. 1977. The problem of solvability of equations in a free smigroup. Mathematics of the USSR-Sbornik 32(2) (1977). https:\/\/doi.org\/10.1070\/SM1977v032n02ABEH002376"},{"key":"#cr-split#-e_1_3_2_1_26_1.1","doi-asserted-by":"crossref","unstructured":"Yu.\u00a0V. Matiyasevich. 1968. A connection between systems of words-and-lengths equations and Hilbert's tenth problem. Studies in constructive mathematics and mathematical logic. Part\u00a0II Zap. Nauchn. Sem. LOMI 8(1968). https:\/\/doi.org\/10.1070\/SM1977v032n02ABEH002376 10.1070\/SM1977v032n02ABEH002376","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"#cr-split#-e_1_3_2_1_26_1.2","doi-asserted-by":"crossref","unstructured":"Yu.\u00a0V. Matiyasevich. 1968. A connection between systems of words-and-lengths equations and Hilbert's tenth problem. Studies in constructive mathematics and mathematical logic. Part\u00a0II Zap. Nauchn. Sem. LOMI 8(1968). https:\/\/doi.org\/10.1070\/SM1977v032n02ABEH002376","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796529"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132584"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516696"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660372"},{"key":"e_1_3_2_1_31_1","volume-title":"CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I(Lecture Notes in Computer Science, Vol.\u00a09779)","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, Vol.\u00a09779) , Swarat Chaudhuri and Azadeh Farzan (Eds.). Springer. https:\/\/doi.org\/10.1007\/978-3-319-41528-4_12 10.1007\/978-3-319-41528-4_12 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, Vol.\u00a09779), Swarat Chaudhuri and Azadeh Farzan (Eds.). Springer. https:\/\/doi.org\/10.1007\/978-3-319-41528-4_12"},{"volume-title":"Genetic and Evolutionary Computing, Hui Sun, Chin-Yu Yang, Chun-Wei Lin, Jeng-Shyang Pan","author":"Wu Tsu-Yang","key":"e_1_3_2_1_32_1","unstructured":"Tsu-Yang Wu , Jeng-Shyang Pan , Chien-Ming Chen , and Chun-Wei Lin . 2015. Towards SQL Injection Attacks Detection Mechanism Using Parse Tree . In Genetic and Evolutionary Computing, Hui Sun, Chin-Yu Yang, Chun-Wei Lin, Jeng-Shyang Pan , Vaclav Snasel, and Ajith Abraham (Eds.). Springer International Publishing . https:\/\/doi.org\/10.1007\/978-3-319-12286-1_38 10.1007\/978-3-319-12286-1_38 Tsu-Yang Wu, Jeng-Shyang Pan, Chien-Ming Chen, and Chun-Wei Lin. 2015. Towards SQL Injection Attacks Detection Mechanism Using Parse Tree. In Genetic and Evolutionary Computing, Hui Sun, Chin-Yu Yang, Chun-Wei Lin, Jeng-Shyang Pan, Vaclav Snasel, and Ajith Abraham (Eds.). Springer International Publishing. https:\/\/doi.org\/10.1007\/978-3-319-12286-1_38"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Haifa Israel","acronym":"LICS '22"},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533329","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":33,"alternative-id":["10.1145\/3531130.3533329","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533329","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}