{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T17:50:18Z","timestamp":1777053018978,"version":"3.51.4"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031970993","type":"print"},{"value":"9783031971006","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-97100-6_8","type":"book-chapter","created":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T10:08:42Z","timestamp":1751278122000},"page":"108-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Decidability and\u00a0Expressive Power of\u00a0Several Theories Based on\u00a0String Constraints"],"prefix":"10.1007","author":[{"given":"Justus","family":"Greve-Kramer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6002-1581","authenticated-orcid":false,"given":"Tore","family":"Ko\u00df","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\/0009-0001-0175-8345","authenticated-orcid":false,"given":"Timo","family":"Specht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., et al.: Norn: an SMT solver for string constraints. In: Proceedings of CAV. vol. 9206, pp. 462\u2013469. Springer (2015)","DOI":"10.1007\/978-3-319-21690-4_29"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Alur, R., Kumar, V., Parthasarathy, M., Viswanathan, M.: Congruences for visibly pushdown languages. vol. 3580 (2005). https:\/\/doi.org\/10.1007\/11523468_89","DOI":"10.1007\/11523468_89"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of STOC (2004). https:\/\/api.semanticscholar.org\/CorpusID:7473479","DOI":"10.1145\/1007352.1007390"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009). https:\/\/doi.org\/10.1145\/1516512.1516518","DOI":"10.1145\/1516512.1516518"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Amadini, R.: A survey on string constraint solving. ACM Comput. Surv. 55(1) (2021). https:\/\/doi.org\/10.1145\/3484198","DOI":"10.1145\/3484198"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Barbosa, H., et al.: cvc5: a versatile and industrial-strength SMT solver. In: Proc. TACAS 2022, Part of ETAPS 2022, Lecture Notes in Computer Science, vol. 13243, pp. 415\u2013442. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Berzish, M., et al.: String theories involving regular membership predicates: from practice to theory and back. In: Proceedings of WORDS 2021. Lecture Notes in Computer Science, vol. 12847, pp. 50\u201364. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-85088-3_5","DOI":"10.1007\/978-3-030-85088-3_5"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Berzish, M., et al.: 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","DOI":"10.1016\/J.TCS.2022.12.009"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Berzish, M., et al.: An SMT solver for regular expressions and linear arithmetic over string length. In: Proceedings of CAV 2021. Lecture Notes in Computer Science, vol. 12760, pp. 289\u2013312. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-81688-9_14","DOI":"10.1007\/978-3-030-81688-9_14"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Bj\u00f8rner, N., Tillmann, N., Voronkov, A.: Path feasibility analysis for string-manipulating programs. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 307\u2013321. Springer (2009)","DOI":"10.1007\/978-3-642-00768-2_27"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"B\u00fcchi, J.R., Senger, S.: Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory, pp. 671\u2013683. Springer New York, New York, NY (1990). https:\/\/doi.org\/10.1007\/978-1-4613-8928-6_37","DOI":"10.1007\/978-1-4613-8928-6_37"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.08.012","volume":"656","author":"D Carotenuto","year":"2016","unstructured":"Carotenuto, D., Murano, A., Peron, A.: Ordered multi-stack visibly pushdown automata. Theoret. Comput. Sci. 656, 1\u201326 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.08.012","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Day, J., Ganesh, V., Grewal, N., Manea, F.: On the expressive power of string constraints. In: Proceedings of the ACM on Programming Languages, POPL 2023, vol. 7, pp. 278\u2013308 (2023). https:\/\/doi.org\/10.1145\/3571203","DOI":"10.1145\/3571203"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Day, J.D., Ganesh, V., Grewal, N., Konefal, M., Manea, F.: A closer look at the expressive power of logics based on word equations. Theory Comput. Syst. 68(3), 322\u2013379 (2024). https:\/\/doi.org\/10.1007\/S00224-023-10154-8","DOI":"10.1007\/S00224-023-10154-8"},{"key":"8_CR15","unstructured":"Day, J.D., Ganesh, V., Grewal, N., Manea, F.: Formal languages via theories over strings (2022). https:\/\/arxiv.org\/abs\/2205.00475"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Day, J.D., Ganesh, V., He, P., Manea, F., Nowotka, D.: The satisfiability of word equations: decidable and undecidable theories. In: Proceedings of RP 2018. Lecture Notes in Computer Science, vol. 11123, pp. 15\u201329. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-00250-3_2","DOI":"10.1007\/978-3-030-00250-3_2"},{"key":"8_CR17","unstructured":"Day, J.D., Ganesh, V., Manea, F.: Formal languages via theories over strings: an overview of some recent results. Bull. EATCS 140 (2023). http:\/\/eatcs.org\/beatcs\/index.php\/beatcs\/article\/view\/765"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Draghici, A., Haase, C., Manea, F.: Sem\u00ebnov arithmetic, affine VASS, and string constraints. In: Proceedings of 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"},{"issue":"2","key":"8_CR19","first-page":"333","volume":"113","author":"S Ginsburg","year":"1964","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded algol-like languages. Trans. Am. Math. Soc. 113(2), 333\u2013368 (1964)","journal-title":"Trans. Am. Math. Soc."},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Haase, C.: A survival guide to presburger arithmetic. ACM SIGLOG News 5(3), 67\u201382 (2018). https:\/\/doi.org\/10.1145\/3242953.3242964","DOI":"10.1145\/3242953.3242964"},{"issue":"4","key":"8_CR21","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/3373394.3373396","volume":"6","author":"M Hague","year":"2019","unstructured":"Hague, M.: Strings at MOSCA. ACM SIGLOG News 6(4), 4\u201322 (2019)","journal-title":"ACM SIGLOG News"},{"key":"8_CR22","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc, USA (2006)","edition":"3"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Kan, S., Lin, A.W., R\u00fcmmer, P., Schrader, M.: CertiStr: a certified string solver. In: Proceedings of CPP 2022. CPP \u201822, ACM (2022). https:\/\/doi.org\/10.1145\/3497775.3503691","DOI":"10.1145\/3497775.3503691"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Karhum\u00e4ki, J., Mignosi, F., Plandowski, W.: The expressibility of languages and relations by word equations. J. ACM 47(3), 483\u2013505 (2000). https:\/\/doi.org\/10.1145\/337244.337255","DOI":"10.1145\/337244.337255"},{"key":"8_CR25","doi-asserted-by":"publisher","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) (2013). https:\/\/doi.org\/10.1145\/2377656.2377662","DOI":"10.1145\/2377656.2377662"},{"key":"8_CR26","unstructured":"Lu, Z., Siemer, S., Jha, P., Day, J.D., Manea, F., Ganesh, V.: Layered and staged monte carlo tree search for SMT strategy synthesis. In: Proc. IJCAI 2024, pp. 1907\u20131915. ijcai.org (2024). https:\/\/www.ijcai.org\/proceedings\/2024\/211"},{"key":"8_CR27","volume-title":"Computation: finite and infinite machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall Inc, USA (1967)"},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Mora, F., Berzish, M., Kulczynski, M., Nowotka, D., Ganesh, V.: Z3str4: a multi-armed string solver. In: Proceedings of FM 2021, pp. 389\u2013406. Springer-Verlag, Berlin, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_21","DOI":"10.1007\/978-3-030-90870-6_21"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Parikh, R.J.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966).https:\/\/doi.org\/10.1145\/321356.321364","DOI":"10.1145\/321356.321364"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Redelinghuys, G., Visser, W., Geldenhuys, J.: Symbolic execution of programs with strings. In: Proceedings of SAICSIT 2012, pp. 139\u2013148. SAICSIT \u201912 (2012)","DOI":"10.1145\/2389836.2389853"},{"issue":"3","key":"8_CR31","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0166-218X(03)00335-4","volume":"131","author":"M Rigo","year":"2003","unstructured":"Rigo, M.: The commutative closure of a binary slip-language is context-free: a new proof. Discret. Appl. Math. 131(3), 665\u2013672 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(03)00335-4","journal-title":"Discret. Appl. Math."},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Lecture Notes in Computer Science, Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6","DOI":"10.1007\/978-3-642-59126-6"},{"key":"8_CR33","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. IEEE (2010)","DOI":"10.1109\/SP.2010.38"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97100-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T17:31:26Z","timestamp":1777051886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97100-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031970993","9783031971006"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97100-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Loughborough","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lboro.ac.uk\/departments\/compsci\/events\/dcfs-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}