{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:08:45Z","timestamp":1776305325336,"version":"3.50.1"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031572456","type":"print"},{"value":"9783031572463","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T00:00:00Z","timestamp":1712188800000},"content-version":"vor","delay-in-days":94,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:sc>Z3-Noodler<\/jats:sc>is a\u00a0fork of<jats:sc>Z3<\/jats:sc>that replaces its string theory solver with a\u00a0custom solver implementing the recently introduced stabilization-based algorithm for solving word equations with regular constraints. An extensive experimental evaluation shows that<jats:sc>Z3-Noodler<\/jats:sc>is a\u00a0fully-fledged solver that can compete with state-of-the-art solvers, surpassing them by far on many benchmarks. Moreover, it is often complementary to other solvers, making it a\u00a0suitable choice as a\u00a0candidate to a\u00a0solver portfolio.<\/jats:p>","DOI":"10.1007\/978-3-031-57246-3_2","type":"book-chapter","created":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T14:03:43Z","timestamp":1712153023000},"page":"24-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Z3-Noodler: An Automata-based String Solver"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2872-0336","authenticated-orcid":false,"given":"Yu-Fang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5614-1592","authenticated-orcid":false,"given":"David","family":"Chocholat\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4375-7954","authenticated-orcid":false,"given":"Vojt\u011bch","family":"Havlena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6957-1651","authenticated-orcid":false,"given":"Luk\u00e1\u0161","family":"Hol\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3038-5875","authenticated-orcid":false,"given":"Ond\u0159ej","family":"Leng\u00e1l","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7454-3751","authenticated-orcid":false,"given":"Juraj","family":"S\u00ed\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,4]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Chen, Y., Diep, B.P., Dolby, J., Jank\u016f, P., Lin, H., Hol\u00edk, L., Wu, W.: Efficient handling of string-number conversion. In: Proc. of PLDI\u201920. pp. 943\u2013957. ACM (2020). https:\/\/doi.org\/10.1145\/3385412, https:\/\/doi.org\/10.1145\/3385412","DOI":"10.1145\/3385412"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Chen, Y., Diep, B.P., Hol\u00edk, L., Rezine, A., R\u00fcmmer, P.: Trau: SMT solver for string constraints. 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\u20135. IEEE (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8602997, https:\/\/doi.org\/10.23919\/FMCAD.2018.8602997","DOI":"10.23919\/FMCAD.2018.8602997"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Chen, Y., Hol\u00edk, L., Rezine, A., R\u00fcmmer, P., Stenman, J.: String constraints for verification. In: Biere, A., Bloem, R. (eds.) 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, pp. 150\u2013166. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_10, https:\/\/doi.org\/10.1007\/978-3-319-08867-9_10","DOI":"10.1007\/978-3-319-08867-9_10"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Chen, Y., Hol\u00edk, L., Rezine, A., R\u00fcmmer, P., Stenman, J.: Norn: An SMT solver for string constraints. In: Kroening, D., Pasareanu, C.S. (eds.) Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I. Lecture Notes in Computer Science, vol.\u00a09206, pp. 462\u2013469. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_29, https:\/\/doi.org\/10.1007\/978-3-319-21690-4_29","DOI":"10.1007\/978-3-319-21690-4_29"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Diep, B.P., Hol\u00edk, L., Jank\u016f, P.: Chain-free string constraints. In: Chen, Y., Cheng, C., Esparza, J. (eds.) Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11781, pp. 277\u2013293. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_16, https:\/\/doi.org\/10.1007\/978-3-030-31784-3_16","DOI":"10.1007\/978-3-030-31784-3_16"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Chen, Y.F., Hol\u00edk, L., Mayr, R., Vojnar, T.: When simulation meets antichains. In: TACAS\u201910. LNCS, vol.\u00a06015, pp. 158\u2013174. Springer (2010)","DOI":"10.1007\/978-3-642-12002-2_14"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Alt, L., Blicha, M., Hyv\u00e4rinen, A.E.J., Sharygina, N.: SolCMC: Solidity compiler\u2019s model checker. 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. 325\u2013338. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-13185-1_16, https:\/\/doi.org\/10.1007\/978-3-031-13185-1_16","DOI":"10.1007\/978-3-031-13185-1_16"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Backes, J., Bolignano, P., Cook, B., Dodge, C., Gacek, A., Luckow, K., Rungta, N., Tkachuk, O., Varming, C.: Semantic-based automated reasoning for aws access policies using smt. In: 2018 Formal Methods in Computer Aided Design (FMCAD). pp.\u00a01\u20139 (2018). https:\/\/doi.org\/10.23919\/FMCAD.2018.8602994","DOI":"10.23919\/FMCAD.2018.8602994"},{"key":"2_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., Ozdemir, A., Preiner, M., Reynolds, A., Sheng, Y., Tinelli, C., Zohar, Y.: cvc5: A versatile and industrial-strength smt solver. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. pp. 415\u2013442. Springer International Publishing, Cham (2022)","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"2_CR10","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org (2016)"},{"key":"2_CR11","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB): Strings. https:\/\/smtlib.cs.uiowa.edu\/theories-UnicodeStrings.shtml (2023)"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Berzish, M., Day, J.D., Ganesh, V., Kulczynski, M., Manea, F., Mora, F., Nowotka, D.: Towards more efficient methods for solving regular-expression heavy string constraints. Theor. Comput. Sci. 943, 50\u201372 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2022.12.009, https:\/\/doi.org\/10.1016\/j.tcs.2022.12.009","DOI":"10.1016\/j.tcs.2022.12.009"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Berzish, M., Kulczynski, M., Mora, F., Manea, F., Day, J.D., Nowotka, D., Ganesh, V.: An SMT solver for regular expressions and linear arithmetic over string length. In: Silva, A., Leino, K.R.M. (eds.) Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II. Lecture Notes in Computer Science, vol. 12760, pp. 289\u2013312. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-81688-9_14, https:\/\/doi.org\/10.1007\/978-3-030-81688-9_14","DOI":"10.1007\/978-3-030-81688-9_14"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Blahoudek, F., Chen, Y.F., Chocholat\u00fd, D., Havlena, V., Hol\u00edk, L., Leng\u00e1l, O., S\u00ed\u010d, J.: 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)","DOI":"10.1007\/978-3-031-27481-7_23"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Blotsky, D., Mora, F., Berzish, M., Zheng, Y., Kabir, I., Ganesh, V.: StringFuzz: A fuzzer for string solvers. In: Chockler, H., Weissenbacher, G. (eds.) Computer Aided Verification. pp. 45\u201351. Springer International Publishing, Cham (2018)","DOI":"10.1007\/978-3-319-96142-2_6"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Bustan, D., Grumberg, O.: Simulation based minimization. In: Proceedings of CADE-17. LNCS, vol.\u00a01831, pp. 255\u2013270. Springer (2000)","DOI":"10.1007\/10721959_20"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"C\u00e9c\u00e9, G.: Foundation for a series of efficient simulation algorithms. In: LICS\u201917. pp. 1\u201312. IEEE Computer Society (2017)","DOI":"10.1109\/LICS.2017.8005069"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Chen, T., Hague, M., He, J., Hu, D., Lin, A.W., R\u00fcmmer, P., Wu, Z.: A decision procedure for path feasibility of string manipulating programs with integer data type. In: Hung, D.V., Sokolsky, O. (eds.) Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19-23, 2020, Proceedings. Lecture Notes in Computer Science, vol. 12302, pp. 325\u2013342. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_18, https:\/\/doi.org\/10.1007\/978-3-030-59152-6_18","DOI":"10.1007\/978-3-030-59152-6_18"},{"key":"2_CR19","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":"2_CR20","doi-asserted-by":"publisher","unstructured":"Chen, Y.F., Chocholat\u00fd, D., Havlena, V., Hol\u00edk, L., Leng\u00e1l, O., S\u00ed\u010d, J.: Solving string constraints with lengths by stabilization. Proc. ACM Program. Lang. 7(OOPSLA2) (oct 2023). https:\/\/doi.org\/10.1145\/3622872","DOI":"10.1145\/3622872"},{"key":"2_CR21","unstructured":"Chen, Y.F., Chocholat\u00fd, D., Havlena, V., Hol\u00edk, L., Leng\u00e1l, O., S\u00ed\u010d, J.: Z3-Noodler: An automata-based string solver (Oct 2023). https:\/\/doi.org\/10.5281\/zenodo, https:\/\/doi.org\/10.5281\/zenodo.10041441"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Chen, Y.F., Havlena, V., Leng\u00e1l, O., Turrini, A.: A symbolic algorithm for the case-split rule in solving word constraints with extensions. Journal of Systems and Software 201, 111673 (2023). https:\/\/doi.org\/10.1016\/j.jss.2023.111673, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0164121223000687","DOI":"10.1016\/j.jss.2023.111673"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Chocholat\u00fd, D., Fiedor, T., Havlena, V., Hol\u00edk, L., Hru\u0161ka, M., Leng\u00e1l, O., S\u00ed\u010d, J.: Mata: A\u00a0fast and simple finite automata library. In: Proc. of TACAS\u201924. LNCS, Springer (2024)","DOI":"10.1007\/978-3-031-57249-4_7"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Day, J.D., Ehlers, T., Kulczynski, M., Manea, F., Nowotka, D., Poulsen, D.B.: On solving word equations using SAT. In: Filiot, E., Jungers, R.M., Potapov, I. (eds.) Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11674, pp. 93\u2013106. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-30806-3_8, https:\/\/doi.org\/10.1007\/978-3-030-30806-3_8","DOI":"10.1007\/978-3-030-30806-3_8"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Le, Q.L., He, M.: A decision procedure for string logic with quadratic equations, regular expressions and length constraints. In: Ryu, S. (ed.) Programming Languages and Systems. pp. 350\u2013372. Springer International Publishing, Cham (2018)","DOI":"10.1007\/978-3-030-02768-1_19"},{"key":"2_CR26","unstructured":"Liana Hadarean: String solving at Amazon. https:\/\/mosca19.github.io\/program\/index.html (2019), presented at MOSCA\u201919"},{"key":"2_CR27","doi-asserted-by":"crossref","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(3), 206\u2013234 (2016)","DOI":"10.1007\/s10703-016-0247-6"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Lin, A.W., Majumdar, R.: Quadratic word equations with length constraints, counter systems, and presburger arithmetic with divisibility. In: Automated Technology for Verification and Analysis. pp. 352\u2013369. Springer International Publishing, Cham (2018)","DOI":"10.1007\/978-3-030-01090-4_21"},{"key":"2_CR29","unstructured":"Mata: An efficient automata library (2023), https:\/\/github.com\/VeriFIT\/mata"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Mora, F., Berzish, M., Kulczynski, M., Nowotka, D., Ganesh, V.: Z3str4: A multi-armed string solver. In: Huisman, M., Pasareanu, C.S., Zhan, N. (eds.) Formal Methods - 24th International Symposium, FM 2021, Virtual Event, November 20-26, 2021, Proceedings. Lecture Notes in Computer Science, vol. 13047, pp. 389\u2013406. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_21, https:\/\/doi.org\/10.1007\/978-3-030-90870-6_21","DOI":"10.1007\/978-3-030-90870-6_21"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"de\u00a0Moura, L.M., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: TACAS\u201908. LNCS, vol.\u00a04963, pp. 337\u2013340. Springer (2008), https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Nielsen, J.: Die isomorphismen der allgemeinen, unendlichen gruppe mit zwei erzeugenden. Mathematische Annalen 78(1), 385\u2013397 (1917)","DOI":"10.1007\/BF01457113"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"N\u00f6tzli, A., Reynolds, A., Barbosa, H., Niemetz, A., Preiner, M., Barrett, C., Tinelli, C.: Syntax-guided rewrite rule enumeration for SMT solvers. In: Janota, M., Lynce, I. (eds.) Theory and Applications of Satisfiability Testing \u2013 SAT 2019. pp. 279\u2013297. Springer International Publishing, Cham (2019)","DOI":"10.1007\/978-3-030-24258-9_20"},{"key":"2_CR34","unstructured":"OWASP: Top 10. https:\/\/www.owasp.org\/images\/f\/f8\/OWASP_Top_10_-_2013.pdf (2013)"},{"key":"2_CR35","unstructured":"OWASP: Top 10. https:\/\/owasp.org\/www-project-top-ten\/2017\/ (2017)"},{"key":"2_CR36","unstructured":"OWASP: Top 10. https:\/\/owasp.org\/Top10\/ (2021)"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Reynolds, A., Woo, M., Barrett, C., Brumley, D., Liang, T., Tinelli, C.: Scaling up DPLL(T) string solvers using context-dependent simplification. In: Majumdar, R., Kun\u010dak, V. (eds.) Computer Aided Verification. pp. 453\u2013474. Springer International Publishing, Cham (2017)","DOI":"10.1007\/978-3-319-63390-9_24"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Robson, J.M., Diekert, V.: On quadratic word equations. In: Annual Symposium on Theoretical Aspects of Computer Science. pp. 217\u2013226. Springer (1999)","DOI":"10.1007\/3-540-49116-3_20"},{"key":"2_CR39","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":"2_CR40","unstructured":"Saxena, P., Akhawe, D., Hanna, S., Mao, F., McCamant, S., Song, D.: Kaluza web site (2023), https:\/\/webblaze.cs.berkeley.edu\/2010\/kaluza\/"},{"key":"2_CR41","unstructured":"SMT-COMP\u201923: https:\/\/smt-comp.github.io\/2023\/ (2023)"},{"key":"2_CR42","unstructured":"SMT-LIB: https:\/\/clc-gitlab.cs.uiowa.edu:2443\/SMT-LIB-benchmarks\/QF_S (2023)"},{"key":"2_CR43","unstructured":"SMT-LIB: https:\/\/clc-gitlab.cs.uiowa.edu:2443\/SMT-LIB-benchmarks\/QF_SLIA (2023)"},{"key":"2_CR44","doi-asserted-by":"publisher","unstructured":"Wang, H.E., Chen, S.Y., Yu, F., Jiang, J.H.R.: A symbolic model checking approach to the analysis of string and length constraints. In: Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering. p. 623\u2013633. ASE 2018, Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3238147.3238189, https:\/\/doi.org\/10.1145\/3238147.3238189","DOI":"10.1145\/3238147.3238189"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Wang, H., Tsai, T., Lin, C., Yu, F., Jiang, J.R.: String analysis via automata manipulation with logic circuit representation. In: CAV\u201916. LNCS, vol.\u00a09779, pp. 241\u2013260. Springer (2016)","DOI":"10.1007\/978-3-319-41528-4_13"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Wulf, M.D., Doyen, L., Henzinger, T.A., Raskin, J.: Antichains: A new algorithm for checking universality of finite automata. In: CAV\u201906. LNCS, vol.\u00a04144, pp. 17\u201330. Springer (2006)","DOI":"10.1007\/11817963_5"},{"key":"2_CR47","unstructured":"Z3-Noodler: Automata-based string solver (2023), https:\/\/github.com\/VeriFIT\/z3-noodler"}],"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-031-57246-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T16:14:37Z","timestamp":1731687277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57246-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031572456","9783031572463"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57246-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"4 April 2024","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":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","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":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2024\/conferences\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"159","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}