{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T14:06:00Z","timestamp":1776261960992,"version":"3.50.1"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227485","type":"print"},{"value":"9783032227492","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22749-2_8","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:13:52Z","timestamp":1776258832000},"page":"151-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Integrating String Reasoning in Symbolic Execution of C Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6306-9502","authenticated-orcid":false,"given":"Rachel","family":"Cleaveland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9522-3084","authenticated-orcid":false,"given":"Clark","family":"Barrett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"https:\/\/doi.org\/10.5281\/zenodo.18262988","DOI":"10.5281\/zenodo.18262988"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"https:\/\/doi.org\/10.5281\/zenodo.18225511","DOI":"10.5281\/zenodo.18225511"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3484198","volume":"55","author":"R Amadini","year":"2021","unstructured":"Amadini, R.: A survey on string constraint solving. ACM Computing Surveys (CSUR) 55(1), 1\u201338 (2021)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Amadini, R.: A survey on string constraint solving. ACM Comput. Surv. 55(2), 16:1\u201316:38 (2023). https:\/\/doi.org\/10.1145\/3484198, https:\/\/doi.org\/10.1145\/3484198","DOI":"10.1145\/3484198"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Amadini, R., Andrlon, M., Gange, G., Schachte, P., S\u00f8ndergaard, H., Stuckey, P.J.: Constraint programming for dynamic symbolic execution of javascript. In: Rousseau, L., Stergiou, K. (eds.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4-7, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11494, pp. 1\u201319. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_1, https:\/\/doi.org\/10.1007\/978-3-030-19212-9_1","DOI":"10.1007\/978-3-030-19212-9_1"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Backes, J., Bolignano, P., Cook, B., Dodge, C., Gacek, A., Luckow, K.S., Rungta, N., Tkachuk, O., Varming, C.: Semantic-based automated reasoning for AWS access policies using SMT. In: Bj\u00f8rner, N.S., Gurfinkel, A. (eds.) 2018 Formal Methods in Computer Aided Design, FMCAD 2018, Austin, TX, USA, October 30 - November 2, 2018. pp.\u00a01\u20139. IEEE (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8602994, https:\/\/doi.org\/10.23919\/FMCAD.2018.8602994","DOI":"10.23919\/FMCAD.2018.8602994"},{"key":"8_CR7","unstructured":"Ball, T., Daniel, J.: Deconstructing dynamic symbolic execution. In: Dependable Software Systems Engineering, pp. 26\u201341. IOS Press (2015)"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Bang, L., Aydin, A., Phan, Q., Pasareanu, C.S., Bultan, T.: String analysis for side channels with segmented oracles. In: Zimmermann, T., Cleland-Huang, J., Su, Z. (eds.) Proceedings of the 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2016, Seattle, WA, USA, November 13-18, 2016. pp. 193\u2013204. ACM (2016). https:\/\/doi.org\/10.1145\/2950290.2950362, https:\/\/doi.org\/10.1145\/2950290.2950362","DOI":"10.1145\/2950290.2950362"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Barbosa, H., Barrett, C., Brain, M., Kremer, G., Lachnitt, H., Mann, M., Mohamed, A., Mohamed, M., Niemetz, A., N\u00f6tzli, A., et\u00a0al.: cvc5: A versatile and industrial-strength smt solver. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems. pp. 415\u2013442. Springer (2022)","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"8_CR10","unstructured":"Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB standard \u2013 version 2.0. In: Proceedings of the 8$$^{th}$$ International Workshop on Satisfiability Modulo Theories (SMT \u201910) (Jul 2010), http:\/\/theory.stanford.edu\/~barrett\/pubs\/BST10.pdf, edinburgh, Scotland"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Bj\u00f8rner, N.S., Tillmann, N., Voronkov, A.: Path feasibility analysis for string-manipulating programs. In: Kowalewski, S., Philippou, A. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, 15th International Conference, TACAS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings. Lecture Notes in Computer Science, vol.\u00a05505, pp. 307\u2013321. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_27, https:\/\/doi.org\/10.1007\/978-3-642-00768-2_27","DOI":"10.1007\/978-3-642-00768-2_27"},{"issue":"8","key":"8_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1722","volume":"29","author":"L Borzacchiello","year":"2019","unstructured":"Borzacchiello, L., Coppa, E., Cono\u00a0D\u2019Elia, D., Demetrescu, C.: Memory models in symbolic execution: key ideas and new thoughts. Software Testing, Verification and Reliability 29(8), e1722 (2019)","journal-title":"Software Testing, Verification and Reliability"},{"key":"8_CR13","unstructured":"Cadar, C., Dunbar, D., Engler, D.R., et\u00a0al.: Klee: unassisted and automatic generation of high-coverage tests for complex systems programs. In: OSDI. vol.\u00a08, pp. 209\u2013224 (2008)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Cha, S.K., Avgerinos, T., Rebert, A., Brumley, D.: Unleashing mayhem on binary code. In: 2012 IEEE Symposium on Security and Privacy. pp. 380\u2013394. IEEE (2012)","DOI":"10.1109\/SP.2012.31"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Chen, T., Flores-Lamas, A., Hague, M., Han, Z., Hu, D., Kan, S., Lin, A.W., R\u00fcmmer, P., Wu, Z.: Solving string constraints with regex-dependent functions through transducers with priorities and variables. Proc. ACM Program. Lang. 6(POPL), 1\u201331 (2022). https:\/\/doi.org\/10.1145\/3498707, https:\/\/doi.org\/10.1145\/3498707","DOI":"10.1145\/3498707"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Chen, T., Hague, M., Lin, A.W., R\u00fcmmer, P., Wu, Z.: Decision procedures for path feasibility of string-manipulating programs with complex operations. Proc. ACM Program. Lang. 3(POPL), 49:1\u201349:30 (2019). https:\/\/doi.org\/10.1145\/3290362, https:\/\/doi.org\/10.1145\/3290362","DOI":"10.1145\/3290362"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Chen, Y., Chocholat\u00fd, D., Havlena, V., Hol\u00edk, L., Leng\u00e1l, O., S\u00edc, J.: Z3-noodler: An automata-based string solver. In: Finkbeiner, B., Kov\u00e1cs, L. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14570, pp. 24\u201333. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57246-3_2, https:\/\/doi.org\/10.1007\/978-3-031-57246-3_2","DOI":"10.1007\/978-3-031-57246-3_2"},{"key":"8_CR18","unstructured":"Chipounov, V., Georgescu, V., Zamfir, C., Candea, G.: Selective symbolic execution. In: Proceedings of the 5th Workshop on Hot Topics in System Dependability (HotDep) (2009)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"David, R., Bardin, S., Ta, T.D., Mounier, L., Feist, J., Potet, M.L., Marion, J.Y.: Binsec\/se: A dynamic symbolic execution toolkit for binary-level analysis. In: 2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER). vol.\u00a01, pp. 653\u2013656. IEEE (2016)","DOI":"10.1109\/SANER.2016.43"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"De\u00a0Moura, L., Bj\u00f8rner, N.: Z3: An efficient smt solver. In: International conference on Tools and Algorithms for the Construction and Analysis of Systems. pp. 337\u2013340. Springer (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Ghosh, I., Shafiei, N., Li, G., Chiang, W.: JST: an automatic test generation tool for industrial java applications with strings. In: Notkin, D., Cheng, B.H.C., Pohl, K. (eds.) 35th International Conference on Software Engineering, ICSE \u201913, San Francisco, CA, USA, May 18-26, 2013. pp. 992\u20131001. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/ICSE.2013.6606649, https:\/\/doi.org\/10.1109\/ICSE.2013.6606649","DOI":"10.1109\/ICSE.2013.6606649"},{"key":"8_CR22","first-page":"151","volume":"8","author":"P Godefroid","year":"2008","unstructured":"Godefroid, P., Levin, M.Y., Molnar, D.A., et\u00a0al.: Automated whitebox fuzz testing. In: NDSS. vol.\u00a08, pp. 151\u2013166 (2008)","journal-title":"Automated whitebox fuzz testing. In: NDSS."},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Grossman, J.: XSS attacks: cross site scripting exploits and defense. Syngress (2007)","DOI":"10.1016\/B978-159749154-9\/50005-6"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Hadarean, L., Barrett, C., Jovanovi\u0107, D., Tinelli, C., Bansal, K.: A tale of two solvers: Eager and lazy approaches to bit-vectors. In: Biere, A., Bloem, R. (eds.) Proceedings of the $$26^{th}$$ International Conference on Computer Aided Verification (CAV \u201914). Lecture Notes in Computer Science, vol.\u00a08559, pp. 680\u2013695. Springer (Jul 2014), http:\/\/theory.stanford.edu\/~barrett\/pubs\/HBJ+14.pdf, vienna, Austria","DOI":"10.1007\/978-3-319-08867-9_45"},{"key":"8_CR25","unstructured":"Halfond, W.G.J., Viegas, J., Orso, A.: A classification of SQL injection attacks and countermeasures. In: Jr., S.T.R. (ed.) 2006 IEEE International Symposium on Secure Software Engineering, ISSSE 2006, Arlington, VA, USA, March 16 -17, 2006 (2006)"},{"key":"8_CR26","doi-asserted-by":"publisher","unstructured":"Hooimeijer, P., Weimer, W.: A decision procedure for subset constraints over regular languages. In: Hind, M., Diwan, A. (eds.) Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, June 15-21, 2009. pp. 188\u2013198. ACM (2009). https:\/\/doi.org\/10.1145\/1542476.1542498, https:\/\/doi.org\/10.1145\/1542476.1542498","DOI":"10.1145\/1542476.1542498"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Kausler, S., Sherman, E.: Evaluation of string constraint solvers in the context of symbolic execution. In: Crnkovic, I., Chechik, M., Gr\u00fcnbacher, P. (eds.) ACM\/IEEE International Conference on Automated Software Engineering, ASE \u201914, Vasteras, Sweden - September 15 - 19, 2014. pp. 259\u2013270. ACM (2014). https:\/\/doi.org\/10.1145\/2642937.2643003, https:\/\/doi.org\/10.1145\/2642937.2643003","DOI":"10.1145\/2642937.2643003"},{"issue":"4","key":"8_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2377656.2377662","volume":"21","author":"A Kiezun","year":"2013","unstructured":"Kiezun, A., Ganesh, V., Artzi, S., Guo, P.J., Hooimeijer, P., Ernst, M.D.: Hampi: A solver for word equations over strings, regular expressions, and context-free grammars. ACM Transactions on Software Engineering and Methodology (TOSEM) 21(4), 1\u201328 (2013)","journal-title":"ACM Transactions on Software Engineering and Methodology (TOSEM)"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Li, G., Ghosh, I.: PASS: string solving with parameterized array and interval automaton. In: Bertacco, V., Legay, A. (eds.) 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, vol.\u00a08244, pp. 15\u201331. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-319-03077-7_2, https:\/\/doi.org\/10.1007\/978-3-319-03077-7_2","DOI":"10.1007\/978-3-319-03077-7_2"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Liang, T., Reynolds, A., Tinelli, C., Barrett, C., Deters, M.: A dpll (t) theory solver for a theory of strings and regular expressions. 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 26. pp. 646\u2013662. Springer (2014)","DOI":"10.1007\/978-3-319-08867-9_43"},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s10703-016-0247-6","volume":"48","author":"T Liang","year":"2016","unstructured":"Liang, T., Reynolds, A., Tsiskaridze, N., Tinelli, C., Barrett, C., Deters, M.: An efficient smt solver for string constraints. Formal Methods in System Design 48, 206\u2013234 (2016)","journal-title":"Formal Methods in System Design"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Liang, T., Tsiskaridze, N., Reynolds, A., Tinelli, C., Barrett, C.: A decision procedure for regular membership and length constraints over unbounded strings. In: International Symposium on Frontiers of Combining Systems. pp. 135\u2013150. Springer (2015)","DOI":"10.1007\/978-3-319-24246-0_9"},{"key":"8_CR33","doi-asserted-by":"publisher","unstructured":"Loring, B., Mitchell, D., Kinder, J.: Expose: practical symbolic execution of standalone javascript. In: Erdogmus, H., Havelund, K. (eds.) Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, Santa Barbara, CA, USA, July 10-14, 2017. pp. 196\u2013199. ACM (2017). https:\/\/doi.org\/10.1145\/3092282.3092295, https:\/\/doi.org\/10.1145\/3092282.3092295","DOI":"10.1145\/3092282.3092295"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Lotz, K., Goel, A., Dutertre, B., Kiesl-Reiter, B., Kong, S., Nowotka, D.: Solving string constraints with concatenation using SAT. In: Narodytska, N., R\u00fcmmer, P. (eds.) Formal Methods in Computer-Aided Design, FMCAD 2024, Prague, Czech Republic, October 15-18, 2024. pp. 29\u201338. IEEE (2024).https:\/\/doi.org\/10.34727\/2024\/ISBN.978-3-85448-065-5_9, https:\/\/doi.org\/10.34727\/2024\/isbn.978-3-85448-065-5_9","DOI":"10.34727\/2024\/ISBN.978-3-85448-065-5_9"},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"Mann, M., Wilson, A., Zohar, Y., Stuntz, L., Irfan, A., Brown, K., Donovick, C., Guman, A., Tinelli, C., Barrett, C.W.: Smt-switch: A solver-agnostic C++ API for SMT solving. In: Li, C., Many\u00e0, F. (eds.) Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings. Lecture Notes in Computer Science, vol. 12831, pp. 377\u2013386. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-80223-3_26, https:\/\/doi.org\/10.1007\/978-3-030-80223-3_26","DOI":"10.1007\/978-3-030-80223-3_26"},{"key":"8_CR36","doi-asserted-by":"publisher","unstructured":"Pasareanu, C.S., Visser, W., Bushnell, D.H., Geldenhuys, J., Mehlitz, P.C., Rungta, N.: Symbolic pathfinder: integrating symbolic execution with model checking for java bytecode analysis. Autom. Softw. Eng. 20(3), 391\u2013425 (2013). https:\/\/doi.org\/10.1007\/S10515-013-0122-2, https:\/\/doi.org\/10.1007\/s10515-013-0122-2","DOI":"10.1007\/S10515-013-0122-2"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Poeplau, S., A.Francillon: Symqemu: Compilation-based symbolic execution for binaries. In: NDSS 2021, Network and Distributed System Security Symposium. Internet Society (2021)","DOI":"10.14722\/ndss.2021.24118"},{"key":"8_CR38","unstructured":"Poeplau, S., Francillon, A.: Symbolic execution with $$\\{$$SymCC$$\\}$$: Don\u2019t interpret, compile! In: 29th USENIX Security Symposium (USENIX Security 20). pp. 181\u2013198 (2020)"},{"key":"8_CR39","doi-asserted-by":"publisher","unstructured":"Redelinghuys, G., Visser, W., Geldenhuys, J.: Symbolic execution of programs with strings. In: Kroeze, J.H., de\u00a0Villiers, R. (eds.) 2012 South African Institute of Computer Scientists and Information Technologists Conference, SAICSIT \u201912, Pretoria, South Africa, October 1-3, 2012. pp. 139\u2013148. ACM (2012). https:\/\/doi.org\/10.1145\/2389836.2389853, https:\/\/doi.org\/10.1145\/2389836.2389853","DOI":"10.1145\/2389836.2389853"},{"key":"8_CR40","doi-asserted-by":"publisher","unstructured":"Reynolds, A., N\u00f6tzli, A., Barrett, C.W., Tinelli, C.: High-level abstractions for simplifying extended string constraints in SMT. In: Dillig, I., Tasiran, S. (eds.) 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, vol. 11562, pp. 23\u201342. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_2, https:\/\/doi.org\/10.1007\/978-3-030-25543-5_2","DOI":"10.1007\/978-3-030-25543-5_2"},{"key":"8_CR41","doi-asserted-by":"publisher","unstructured":"Reynolds, A., N\u00f6tzli, A., Barrett, C.W., Tinelli, C.: A decision procedure for string to code point conversion. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12166, pp. 218\u2013237. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-51074-9_13, https:\/\/doi.org\/10.1007\/978-3-030-51074-9_13","DOI":"10.1007\/978-3-030-51074-9_13"},{"key":"8_CR42","doi-asserted-by":"publisher","unstructured":"Reynolds, A., N\u00f6tzli, A., Barrett, C.W., Tinelli, C.: Reductions for strings and regular expressions revisited. In: 2020 Formal Methods in Computer Aided Design, FMCAD 2020, Haifa, Israel, September 21-24, 2020. pp. 225\u2013235. IEEE (2020). https:\/\/doi.org\/10.34727\/2020\/ISBN.978-3-85448-042-6_30, https:\/\/doi.org\/10.34727\/2020\/isbn.978-3-85448-042-6_30","DOI":"10.34727\/2020\/ISBN.978-3-85448-042-6_30"},{"key":"8_CR43","doi-asserted-by":"publisher","unstructured":"Reynolds, A., Woo, M., Barrett, C.W., Brumley, D., Liang, T., Tinelli, C.: Scaling up DPLL(T) string solvers using context-dependent simplification. In: Majumdar, R., Kuncak, V. (eds.) Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II. Lecture Notes in Computer Science, vol. 10427, pp. 453\u2013474. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_24, https:\/\/doi.org\/10.1007\/978-3-319-63390-9_24","DOI":"10.1007\/978-3-319-63390-9_24"},{"key":"8_CR44","doi-asserted-by":"publisher","unstructured":"Rungta, N.: A billion SMT queries a day (invited paper). In: Shoham, S., Vizel, Y. (eds.) Computer Aided Verification - 34th International Conference, CAV 2022, Haifa, Israel, August 7-10, 2022, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13371, pp. 3\u201318. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-13185-1_1, https:\/\/doi.org\/10.1007\/978-3-031-13185-1_1","DOI":"10.1007\/978-3-031-13185-1_1"},{"key":"8_CR45","doi-asserted-by":"publisher","unstructured":"Saxena, P., Akhawe, D., Hanna, S., Mao, F., McCamant, S., Song, D.: A symbolic execution framework for javascript. In: 31st IEEE Symposium on Security and Privacy, SP 2010, 16-19 May 2010, Berleley\/Oakland, California, USA. pp. 513\u2013528. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/SP.2010.38, https:\/\/doi.org\/10.1109\/SP.2010.38","DOI":"10.1109\/SP.2010.38"},{"key":"8_CR46","doi-asserted-by":"publisher","unstructured":"Scott, J.D., Flener, P., Pearson, J.: Bounded strings for constraint programming. In: 25th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2013, Herndon, VA, USA, November 4-6, 2013. pp. 1036\u20131043. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/ICTAI.2013.155, https:\/\/doi.org\/10.1109\/ICTAI.2013.155","DOI":"10.1109\/ICTAI.2013.155"},{"key":"8_CR47","unstructured":"Serebryany, K.: $$\\{$$OSS-Fuzz$$\\}$$-google\u2019s continuous fuzzing service for open source software (2017)"},{"key":"8_CR48","doi-asserted-by":"crossref","unstructured":"Shannon, D., Ghosh, I., Rajan, S., Khurshid, S.: Efficient symbolic execution of strings for validating web applications. In: Proceedings of the 2nd International Workshop on Defects in Large Software Systems: Held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2009). pp. 22\u201326 (2009)","DOI":"10.1145\/1555860.1555868"},{"key":"8_CR49","doi-asserted-by":"crossref","unstructured":"Shannon, D., Hajra, S., Lee, A., Zhan, D., Khurshid, S.: Abstracting symbolic execution with string analysis. In: Testing: Academic and Industrial Conference Practice and Research Techniques-MUTATION (TAICPART-MUTATION 2007). pp. 13\u201322. IEEE (2007)","DOI":"10.1109\/TAIC.PART.2007.34"},{"key":"8_CR50","doi-asserted-by":"crossref","unstructured":"Shoshitaishvili, Y., Wang, R., Salls, C., Stephens, N., Polino, M., Dutcher, A., Grosen, J., Feng, S., Hauser, C., Kruegel, C., et\u00a0al.: Sok:(state of) the art of war: Offensive techniques in binary analysis. In: 2016 IEEE symposium on security and privacy (SP). pp. 138\u2013157. IEEE (2016)","DOI":"10.1109\/SP.2016.17"},{"key":"8_CR51","doi-asserted-by":"crossref","unstructured":"Stephens, N., Grosen, J., Salls, C., Dutcher, A., Wang, R., Corbetta, J., Shoshitaishvili, Y., Kruegel, C., Vigna, G.: Driller: Augmenting fuzzing through selective symbolic execution. In: 23rd Annual Network and Distributed System Security Symposium, NDSS 2016, San Diego, California, USA, February 21-24, 2016. The Internet Society (2016), http:\/\/wp.internetsociety.org\/ndss\/wp-content\/uploads\/sites\/25\/2017\/09\/driller-augmenting-fuzzing-through-selective-symbolic-execution.pdf","DOI":"10.14722\/ndss.2016.23368"},{"key":"8_CR52","doi-asserted-by":"publisher","unstructured":"Zheng, Y., Zhang, X., Ganesh, V.: Z3-str: a z3-based string solver for web application analysis. In: Meyer, B., Baresi, L., Mezini, M. (eds.) Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC\/FSE\u201913, Saint Petersburg, Russian Federation, August 18-26, 2013. pp. 114\u2013124. ACM (2013). https:\/\/doi.org\/10.1145\/2491411.2491456, https:\/\/doi.org\/10.1145\/2491411.2491456","DOI":"10.1145\/2491411.2491456"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22749-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:13:58Z","timestamp":1776258838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22749-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227485","9783032227492"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22749-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"15 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}