{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:45:20Z","timestamp":1780994720071,"version":"3.54.1"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030644369","type":"print"},{"value":"9783030644376","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64437-6_18","type":"book-chapter","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T13:02:45Z","timestamp":1606395765000},"page":"343-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving"],"prefix":"10.1007","author":[{"given":"Yu-Fang","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vojt\u011bch","family":"Havlena","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3038-5875","authenticated-orcid":false,"given":"Ond\u0159ej","family":"Leng\u00e1l","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4343-9323","authenticated-orcid":false,"given":"Andrea","family":"Turrini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,24]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10009-011-0216-8","volume":"14","author":"PA Abdulla","year":"2012","unstructured":"Abdulla, P.A.: Regular model checking. STTT 14(2), 109\u2013118 (2012)","journal-title":"STTT"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., et al.: Flatten and conquer: a framework for efficient analysis of string constraints. In: PLDI, pp. 602\u2013617 (2017)","DOI":"10.1145\/3140587.3062384"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., et al.: Trau: SMT solver for string constraints. In: FMCAD, pp. 1\u20135 (2018)","DOI":"10.23919\/FMCAD.2018.8602997"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-08867-9_10","volume-title":"Computer Aided Verification","author":"PA Abdulla","year":"2014","unstructured":"Abdulla, P.A., et al.: String constraints for verification. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 150\u2013166. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_10"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-319-21690-4_29","volume-title":"Computer Aided Verification","author":"PA Abdulla","year":"2015","unstructured":"Abdulla, P.A., et al.: Norn: an SMT solver for string constraints. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 462\u2013469. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_29"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-31784-3_16","volume-title":"Automated Technology for Verification and Analysis","author":"PA Abdulla","year":"2019","unstructured":"Abdulla, P.A., Atig, M.F., Diep, B.P., Hol\u00edk, L., Jank\u016f, P.: Chain-free string constraints. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 277\u2013293. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_16"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Aydin, A., et al.: Parameterized model counting for string and numeric constraints. In: SIGSOFT, pp. 400\u2013410 (2018)","DOI":"10.1145\/3236024.3236064"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Barcel\u00f3, P., Figueira, D., Libkin, L.: Graph logics with rational relations. arXiv preprint arXiv:1304.4150 (2013)","DOI":"10.2168\/LMCS-9(3:1)2013"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-22110-1_14","volume-title":"Computer Aided Verification","author":"C Barrett","year":"2011","unstructured":"Barrett, C., et al.: CVC4. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 171\u2013177. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_14"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and context-free languages. Vieweg+Teubner Verlag (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-00768-2_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Bj\u00f8rner","year":"2009","unstructured":"Bj\u00f8rner, N., Tillmann, N., Voronkov, A.: Path feasibility analysis for string-manipulating programs. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 307\u2013321. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_27"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10009-011-0205-y","volume":"14","author":"A Bouajjani","year":"2012","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular (tree) model checking. STTT 14(2), 167\u2013191 (2012)","journal-title":"STTT"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 403\u2013418. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_31"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"B\u00fcchi, J.R., Senger, S.: Definability in the existential theory of concatenation and undecidable extensions of this theory. In: Mac Lane, S., Siefkes, D. (eds.) The Collected Works of J. Richard B\u00fcchi, pp. 671\u2013683. Springer, New York (1990). https:\/\/doi.org\/10.1007\/978-1-4613-8928-6_37","DOI":"10.1007\/978-1-4613-8928-6_37"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Chen, T., Chen, Y., Hague, M., Lin, A.W., Wu, Z.: What is decidable about string constraints with the ReplaceAll function. PACMPL 2(POPL), 3:1\u20133:29 (2018)","DOI":"10.1145\/3158091"},{"key":"18_CR16","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. PACMPL 3(POPL), 49 (2019)","DOI":"10.1145\/3290362"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Diekert, V.: Makanin\u2019s Algorithm, pp. 387\u2013442 (2002)","DOI":"10.1017\/CBO9781107326019.013"},{"issue":"5","key":"18_CR18","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10958-009-9409-z","volume":"158","author":"VG Durnev","year":"2009","unstructured":"Durnev, V.G., Zetkina, O.V.: On equations in free semigroups with certain constraints on their solutions. J. Math. Sci. 158(5), 671\u2013676 (2009)","journal-title":"J. Math. Sci."},{"key":"18_CR19","unstructured":"Ganesh, V., Berzish, M.: Undecidability of a theory of strings, linear arithmetic over length, and string-number conversion. arXiv preprint arXiv:1605.09442 (2016)"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-39611-3_21","volume-title":"Hardware and Software: Verification and Testing","author":"V Ganesh","year":"2013","unstructured":"Ganesh, V., Minnes, M., Solar-Lezama, A., Rinard, M.: Word equations with length constraints: what\u2019s decidable? In: Biere, A., Nahir, A., Vos, T. (eds.) HVC 2012. LNCS, vol. 7857, pp. 209\u2013226. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39611-3_21"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: PLDI, pp. 213\u2013223 (2005)","DOI":"10.1145\/1064978.1065036"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Jha, S., Tiwari, A., Venkatesan, R.: Synthesis of loop-free programs. In: PLDI, pp. 62\u201373 (2011)","DOI":"10.1145\/1993316.1993506"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Srivastava, S., Venkatesan, R.: Program analysis as constraint solving. In: PLDI (2008)","DOI":"10.1145\/1375581.1375616"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Hol\u00edk, L., Jank\u016f, P., Lin, A.W., R\u00fcmmer, P., Vojnar, T.: String constraints with concatenation and transducers solved efficiently. PACMPL 2(POPL), 4 (2018)","DOI":"10.1145\/3158092"},{"issue":"2","key":"18_CR25","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. TCS 134(2), 329\u2013363 (1994)","journal-title":"TCS"},{"key":"18_CR26","doi-asserted-by":"crossref","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. TOSEM 21(4), 25:1\u201325:28 (2012)","DOI":"10.1145\/2377656.2377662"},{"issue":"7","key":"18_CR27","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"issue":"4","key":"18_CR28","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01084074","volume":"6","author":"NK Kosovskii","year":"1976","unstructured":"Kosovskii, N.K.: Properties of the solutions of equations in a free semigroup. J. Math. Sci. 6(4), 361\u2013367 (1976). https:\/\/doi.org\/10.1007\/BF01084074","journal-title":"J. Math. Sci."},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-030-02768-1_19","volume-title":"Programming Languages and Systems","author":"QL Le","year":"2018","unstructured":"Le, Q.L., He, M.: A decision procedure for string logic with quadratic equations, regular expressions and length constraints. In: Ryu, S. (ed.) APLAS 2018. LNCS, vol. 11275, pp. 350\u2013372. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02768-1_19"},{"key":"18_CR30","first-page":"141","volume":"36","author":"FW Levi","year":"1944","unstructured":"Levi, F.W.: On semigroups. Bull. Calcutta Math. Soc. 36, 141\u2013146 (1944)","journal-title":"Bull. Calcutta Math. Soc."},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/978-3-319-08867-9_43","volume-title":"Computer Aided Verification","author":"T Liang","year":"2014","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: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 646\u2013662. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_43"},{"key":"18_CR32","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: POPL, pp. 123\u2013136 (2016)","DOI":"10.1145\/2914770.2837641"},{"key":"18_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-030-01090-4_21","volume-title":"Automated Technology for Verification and Analysis","author":"AW Lin","year":"2018","unstructured":"Lin, A.W., Majumdar, R.: Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 352\u2013369. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_21"},{"issue":"2","key":"18_CR34","first-page":"147","volume":"145","author":"GS Makanin","year":"1977","unstructured":"Makanin, G.S.: The problem of solvability of equations in a free semigroup. Matematicheskii Sbornik 145(2), 147\u2013236 (1977)","journal-title":"Matematicheskii Sbornik"},{"key":"18_CR35","doi-asserted-by":"publisher","unstructured":"Matiyasevich, Y.: Computation paradigms in light of Hilbert\u2019s tenth problem. In: Cooper, S.B., Lowe, B., Sorbi, A. (eds.) New computational paradigms, pp. 59\u201385. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-68546-5_4","DOI":"10.1007\/978-0-387-68546-5_4"},{"key":"18_CR36","first-page":"132","volume":"8","author":"YV Matiyasevich","year":"1968","unstructured":"Matiyasevich, Y.V.: A connection between systems of word and length equations and Hilbert\u2019s tenth problem. Zap. Nauchnykh Semin. POMI 8, 132\u2013144 (1968)","journal-title":"Zap. Nauchnykh Semin. POMI"},{"issue":"1","key":"18_CR37","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01457113","volume":"78","author":"J Nielsen","year":"1917","unstructured":"Nielsen, J.: Die isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden. Mathematische Annalen 78(1), 385\u2013397 (1917)","journal-title":"Mathematische Annalen"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Osera, P.M.: Constraint-based type-directed program synthesis. In: TyDe, pp. 64\u201376 (2019)","DOI":"10.1145\/3331554.3342608"},{"key":"18_CR39","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. In: FOCS, pp. 495\u2013500 (1999)","DOI":"10.1145\/301250.301443"},{"key":"18_CR40","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: An efficient algorithm for solving word equations. In: STOC, pp. 467\u2013476 (2006)","DOI":"10.1145\/1132516.1132584"},{"issue":"4","key":"18_CR41","first-page":"105","volume":"11","author":"WV Quine","year":"1946","unstructured":"Quine, W.V.: Concatenation as a basis for arithmetic. JSYML 11(4), 105\u2013114 (1946)","journal-title":"JSYML"},{"key":"18_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-319-63390-9_24","volume-title":"Computer Aided Verification","author":"A Reynolds","year":"2017","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.) CAV 2017. LNCS, vol. 10427, pp. 453\u2013474. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_24"},{"key":"18_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49116-3_20","volume-title":"STACS 99","author":"JM Robson","year":"1999","unstructured":"Robson, J.M., Diekert, V.: On quadratic word equations. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 217\u2013226. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_20"},{"key":"18_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-55124-7_4","volume-title":"Word Equations and Related Topics","author":"KU Schulz","year":"1992","unstructured":"Schulz, K.U.: Makanin\u2019s algorithm for word equations-two improvements and a generalization. In: Schulz, K.U. (ed.) IWWERT 1990. LNCS, vol. 572, pp. 85\u2013150. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55124-7_4"},{"key":"18_CR45","doi-asserted-by":"crossref","unstructured":"Trinh, M.T., Chu, D.H., Jaffar, J.: S3: a symbolic string solver for vulnerability detection in web applications. In: CCS, pp. 1232\u20131243 (2014)","DOI":"10.1145\/2660267.2660372"},{"key":"18_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-319-41528-4_12","volume-title":"Computer Aided Verification","author":"M-T Trinh","year":"2016","unstructured":"Trinh, M.-T., Chu, D.-H., Jaffar, J.: Progressive reasoning over recursively-defined strings. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 218\u2013240. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_12"},{"key":"18_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-41528-4_13","volume-title":"Computer Aided Verification","author":"H-E Wang","year":"2016","unstructured":"Wang, H.-E., Tsai, T.-L., Lin, C.-H., Yu, F., Jiang, J.-H.R.: String analysis via automata manipulation with logic circuit representation. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 241\u2013260. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_13"},{"key":"18_CR48","doi-asserted-by":"crossref","unstructured":"Wang, Y., Zhou, M., Jiang, Y., Song, X., Gu, M., Sun, J.: A static analysis tool with optimizations for reachability determination. In: ASE, pp. 925\u2013930 (2017)","DOI":"10.1109\/ASE.2017.8115706"},{"key":"18_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-12002-2_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Yu","year":"2010","unstructured":"Yu, F., Alkhalaf, M., Bultan, T.: Stranger: an automata-based string analysis tool for PHP. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 154\u2013157. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_13"},{"issue":"1","key":"18_CR50","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10703-013-0189-1","volume":"44","author":"F Yu","year":"2014","unstructured":"Yu, F., Alkhalaf, M., Bultan, T., Ibarra, O.H.: Automata-based symbolic string analysis for vulnerability detection. FMSD 44(1), 44\u201370 (2014). https:\/\/doi.org\/10.1007\/s10703-013-0189-1","journal-title":"FMSD"},{"key":"18_CR51","doi-asserted-by":"crossref","unstructured":"Yu, F., Shueh, C.Y., Lin, C.H., Chen, Y.F., Wang, B.Y., Bultan, T.: Optimal sanitization synthesis for web application vulnerability repair. In: ISSTA, pp. 189\u2013200 (2016)","DOI":"10.1145\/2931037.2931050"},{"issue":"2\u20133","key":"18_CR52","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10703-016-0263-6","volume":"50","author":"Y Zheng","year":"2017","unstructured":"Zheng, Y., et al.: Z3str2: an efficient solver for strings, regular expressions, and length constraints. FMSD 50(2\u20133), 249\u2013288 (2017). https:\/\/doi.org\/10.1007\/s10703-016-0263-6","journal-title":"FMSD"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64437-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T20:09:44Z","timestamp":1619294984000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64437-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030644369","9783030644376"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64437-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fukuoka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2020\/","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":"Hotcrp.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","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":"17","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":"2","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":"37% - 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":"4","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}