{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:04Z","timestamp":1776333484412,"version":"3.51.2"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031781155","type":"print"},{"value":"9783031781162","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78116-2_2","type":"book-chapter","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T07:31:58Z","timestamp":1732779118000},"page":"22-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SMTQuery: Analysing SMT-LIB String Benchmarks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4650-1110","authenticated-orcid":false,"given":"Mitja","family":"Kulczynski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6759-3304","authenticated-orcid":false,"given":"Kevin","family":"Lotz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6094-3324","authenticated-orcid":false,"given":"Florin","family":"Manea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9623-0748","authenticated-orcid":false,"given":"Danny B\u00f8gsted","family":"Poulsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Sarnighausen-Cahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,29]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., et al.: Norn: An SMT solver for string constraints. In: International conference on Computer Aided Verification, pp. 462\u2013469. Springer (2015)","DOI":"10.1007\/978-3-319-21690-4_29"},{"issue":"1","key":"2_CR2","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 Comput. Surv. (CSUR) 55(1), 1\u201338 (2021)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Aydin, A., Bang, L., Bultan, T.: Automata-based model counting for string constraints. In: Computer Aided Verification: 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I, pp. 255\u2013272. Springer (2015)","DOI":"10.1007\/978-3-319-21690-4_15"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Backes, J., et al.: Semantic-based automated reasoning for AWS access policies using SMT. In: 2018 Formal Methods in Computer Aided Design (FMCAD), pp.\u00a01\u20139 (2018)","DOI":"10.23919\/FMCAD.2018.8602994"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Barbosa, H., 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":"2_CR6","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-030-85088-3_5","volume-title":"Combinatorics on Words","author":"M Berzish","year":"2021","unstructured":"Berzish, M., et al.: String theories involving regular membership predicates: from practice to theory and back. In: Lecroq, T., Puzynina, S. (eds.) Combinatorics on Words, pp. 50\u201364. Springer International Publishing, Cham (2021)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2022.12.009","volume":"943","author":"M Berzish","year":"2023","unstructured":"Berzish, M., et al.: Towards more efficient methods for solving regular-expression heavy string constraints. Theor. Comput. Sci. 943, 50\u201372 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Berzish, M., Ganesh, V., Zheng, Y.: Z3str3: a string solver with theory-aware heuristics. In: 2017 Formal Methods in Computer Aided Design (FMCAD), pp. 55\u201359. IEEE (2017)","DOI":"10.23919\/FMCAD.2017.8102241"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-031-27481-7_23","volume-title":"Formal Methods","author":"F Blahoudek","year":"2023","unstructured":"Blahoudek, F., et al.: Word equations in synergy with regular constraints. In: Chechik, M., Katoen, J.P., Leucker, M. (eds.) Formal Methods, pp. 403\u2013423. Springer International Publishing, Cham (2023)"},{"key":"2_CR10","doi-asserted-by":"crossref","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-49:30 (2019)","DOI":"10.1145\/3290362"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Day, J.D., Ehlers, T., Kulczynski, M., Manea, F., Nowotka, D., Poulsen, D.B.: On solving word equations using SAT. In: International Conference on Reachability Problems, pp. 93\u2013106. Springer (2019)","DOI":"10.1007\/978-3-030-30806-3_8"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Day, J.D., Ganesh, V., Grewal, N., Manea, F.: On the expressive power of string constraints. Proc. ACM Program. Lang. 7(POPL), 278\u2013308 (2023). https:\/\/doi.org\/10.1145\/3571203","DOI":"10.1145\/3571203"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Day, J.D., Kulczynski, M., Manea, F., Nowotka, D., Poulsen, D.B.: Rule-based word equation solving. In: Proceedings of the 8th International Conference on Formal Methods in Software Engineering, pp. 87\u201397 (2020)","DOI":"10.1145\/3372020.3391556"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"De\u00a0Moura, L., Bj\u00f8rner, N.: Z3: An efficient SMT solver. In: TACAS 2008, pp. 337\u2013340. Springer (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Draghici, A., Haase, C., Manea, F.: Sem\u00ebnov arithmetic, affine VASS, and string constraints. In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024. LIPIcs, vol.\u00a0289, pp. 29:1\u201329:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2024.29","DOI":"10.4230\/LIPIcs.STACS.2024.29"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-030-34175-6_2","volume-title":"Programming Languages and Systems","author":"H Hojjat","year":"2019","unstructured":"Hojjat, H., R\u00fcmmer, P., Shamakhi, A.: On strings in software model checking. In: Lin, A.W. (ed.) Programming Languages and Systems, pp. 19\u201330. Springer International Publishing, Cham (2019)"},{"key":"2_CR17","unstructured":"Jez, A.: Word Equations in Nondeterministic Linear Space. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a080, pp. 95:1\u201395:13. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/7408"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Kan, S., Lin, A.W., R\u00fcmmer, P., Schrader, M.: Certistr: A certified string solver (technical report) (2021, to appear in CPP 2022). CoRR arxiv.org\/abs\/2208.08806","DOI":"10.1145\/3497775.3503691"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Kausler, S., Sherman, E.: Evaluation of string constraint solvers in the context of symbolic execution. In: Proceedings of the 29th ACM\/IEEE International Conference on Automated Software Engineering. p. 259-270. ASE \u201914, Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2642937.2643003","DOI":"10.1145\/2642937.2643003"},{"issue":"4","key":"2_CR20","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 Trans. Softw. Eng. Methodol. 21(4), 1 (2013). https:\/\/doi.org\/10.1145\/2377656.2377662","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-031-15077-7_8","volume-title":"Model Checking Software","author":"M Kulczynski","year":"2022","unstructured":"Kulczynski, M., Lotz, K., Nowotka, D., Poulsen, D.B.: Solving string theories involving regular membership predicates using sat. In: Legunsen, O., Rosu, G. (eds.) Model Checking Software, pp. 134\u2013151. Springer International Publishing, Cham (2022)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Kulczynski, M., Manea, F., Nowotka, D., Poulsen, D.B.: ZaligVinder: a generic test framework for string solvers. J. Softw. Evol. Process, e2400 (2021)","DOI":"10.1002\/smr.2400"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Lin, A.W., Barcel\u00f3, P.: String solving with word equations and transducers: towards a logic for analysing mutation xss. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 123\u2013136 (2016)","DOI":"10.1145\/2837614.2837641"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-031-37703-7_9","volume-title":"Computer Aided Verification","author":"K Lotz","year":"2023","unstructured":"Lotz, K., et al.: Solving string constraints using sat. In: Enea, C., Lal, A. (eds.) Computer Aided Verification, pp. 187\u2013208. Springer Nature Switzerland, Cham (2023)"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Mora, F., Berzish, M., Kulczynski, M., Nowotka, D., Ganesh, V.: Z3str4: a multi-armed string solver. In: FM 2021, pp. 389\u2013406. Springer (2021)","DOI":"10.1007\/978-3-030-90870-6_21"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Plandowski, W., Rytter, W.: Application of Lempel-Ziv Encodings to the Solution of Word Equations, pp. 731\u2013742. Springer Berlin Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055097","DOI":"10.1007\/BFb0055097"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976). https:\/\/doi.org\/10.1016\/S0065-2458(08)60520-3","journal-title":"Adv. Comput."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Saxena, P., Akhawe, D., Hanna, S., Mao, F., McCamant, S., Song, D.: A symbolic execution framework for javascript. In: 2010 IEEE Symposium on Security and Privacy, pp. 513\u2013528 (2010)","DOI":"10.1109\/SP.2010.38"},{"issue":"5","key":"2_CR29","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s10009-023-00714-1","volume":"25","author":"J Scott","year":"2023","unstructured":"Scott, J., Niemetz, A., Preiner, M., Nejati, S., Ganesh, V.: Publisher correction: algorithm selection for SMT. Int. J. Softw. Tools Technol. Transf. 25(5), 799\u2013800 (2023). https:\/\/doi.org\/10.1007\/s10009-023-00714-1","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Stanford, C., Veanes, M., Bj\u00f8rner, N.: Symbolic boolean derivatives for efficiently solving extended regular expression constraints. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. pp. 620\u2013635. PLDI 2021, Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3453483.3454066","DOI":"10.1145\/3453483.3454066"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Yu, F., Alkhalaf, M., Bultan, T.: STRANGER: an automata-based string analysis tool for PHP. In: Proceedings of the 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 154\u2013157. TACAS\u201910, Springer-Verlag, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-12002-2_13"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Zhang, X., Ganesh, V.: Z3-str: a z3-based string solver for web application analysis. In: ESEC\/SIGSOFT FSE 2013, pp. 114\u2013124 (2013)","DOI":"10.1145\/2491411.2491456"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78116-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T09:03:39Z","timestamp":1732784619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78116-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,29]]},"ISBN":["9783031781155","9783031781162"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78116-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,29]]},"assertion":[{"value":"29 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SBMF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vit\u00f3ria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sbmf2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}