{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:05:16Z","timestamp":1767927916334,"version":"3.49.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031377020","type":"print"},{"value":"9783031377037","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"vor","delay-in-days":198,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which permit a wealth of operations including append, map, split, and concatenation. In spite of the growing amount of tool support for theories of sequences by leading SMT-solvers, little is known about the decidability of sequence theories, which is in stark contrast to the state of the theories of strings. We show that the decidable theory of strings with concatenation and regular constraints can be extended to the world of sequences over an alphabet theory that forms a Boolean algebra, while preserving decidability. In particular, decidability holds when regular constraints are interpreted as parametric automata (which extend both symbolic automata and variable automata), but fails when interpreted as register automata (even over the alphabet theory of equality). When length constraints are added, the problem is Turing-equivalent to word equations with length (and regular) constraints. Similar investigations are conducted in the presence of symbolic transducers, which naturally model sequence functions like map, split, filter, <jats:italic>etc<\/jats:italic>. We have developed a new sequence solver, <jats:sc>SeCo<\/jats:sc>, based on parametric automata, and show its efficacy on two classes of benchmarks: (i)\u00a0invariant checking on array-manipulating programs and parameterized systems, and (ii)\u00a0benchmarks on symbolic register automata.<\/jats:p>","DOI":"10.1007\/978-3-031-37703-7_2","type":"book-chapter","created":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T17:02:15Z","timestamp":1689613335000},"page":"18-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Decision Procedures for\u00a0Sequence Theories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4321-3105","authenticated-orcid":false,"given":"Artur","family":"Je\u017c","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4715-5096","authenticated-orcid":false,"given":"Anthony W.","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4817-4563","authenticated-orcid":false,"given":"Oliver","family":"Markgraf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2733-7098","authenticated-orcid":false,"given":"Philipp","family":"R\u00fcmmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,18]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-319-08867-9_10"},{"key":"2_CR2","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.-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","DOI":"10.1007\/978-3-030-31784-3_16"},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/3484198","volume":"55","author":"R Amadini","year":"2023","unstructured":"Amadini, R.: A survey on string constraint solving. ACM Comput. Surv. 55(2), 16:1-16:38 (2023). https:\/\/doi.org\/10.1145\/3484198","journal-title":"ACM Comput. Surv."},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Barbosa, H., et al.: cvc5: a versatile and industrial-strength SMT solver. In: TACAS 2022. LNCS, vol. 13243, pp. 415\u2013442. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Barcel\u00f3, P., Figueira, D., Libkin, L.: Graph logics with rational relations. Log. Methods Comput. Sci. 9(3) (2013). https:\/\/doi.org\/10.2168\/LMCS-9(3:1)2013","DOI":"10.2168\/LMCS-9(3:1)2013"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Bj\u00f8rner, N., de Moura, L., Nachmanson, L., Wintersteiger, C.M.: Programming Z3. In: Bowen, J.P., Liu, Z., Zhang, Z. (eds.) SETSS 2018. LNCS, vol. 11430, pp. 148\u2013201. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17601-3_4","DOI":"10.1007\/978-3-030-17601-3_4"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Bojanczyk, M., Stefanski, R.: Single-use automata and transducers for infinite alphabets. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8\u201311, 2020, Saarbr\u00fccken, Germany (Virtual Conference). LIPIcs, vol. 168, pp. 113:1\u2013113:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.113","DOI":"10.4230\/LIPIcs.ICALP.2020.113"},{"key":"2_CR8","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":"2_CR9","doi-asserted-by":"publisher","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: What\u2019s decidable about arrays? In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 427\u2013442. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11609773_28","DOI":"10.1007\/11609773_28"},{"key":"2_CR10","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: 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":"2_CR11","doi-asserted-by":"publisher","unstructured":"Chen, T., et al.: 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","DOI":"10.1145\/3498707"},{"key":"2_CR12","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","DOI":"10.1145\/3290362"},{"key":"2_CR13","unstructured":"D\u2019Antoni, L.: SVPAlib. Symbolic Automata Library (2018). https:\/\/github.com\/lorisdanto\/symbolicautomata. Accessed 2 Feb 2023"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"D\u2019Antoni, L., Ferreira, T., Sammartino, M., Silva, A.: Symbolic register automata. In: Dillig, I., Tasiran, S. (eds.) CAV. vol. 11561, pp. 3\u201321. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_1","DOI":"10.1007\/978-3-030-25540-4_1"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"D\u2019Antoni, L., Veanes, M.: The power of symbolic automata and transducers. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 47\u201367. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_3","DOI":"10.1007\/978-3-319-63387-9_3"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"D\u2019Antoni, L., Veanes, M.: Automata modulo theories. Commun. ACM 64(5), 86\u201395 (2021). https:\/\/doi.org\/10.1145\/3419404","DOI":"10.1145\/3419404"},{"key":"2_CR17","unstructured":"Diekert, V.: Makanin\u2019s algorithm. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 90, chap. 12, pp. 387\u2013442. Cambridge University Press (2002)"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.ic.2005.04.002","volume":"202","author":"V Diekert","year":"2005","unstructured":"Diekert, V., Guti\u00e9rrez, C., Hagenah, C.: The existential theory of equations with rational constraints in free groups is PSPACE-complete. Inf. Comput. 202(2), 105\u2013140 (2005). https:\/\/doi.org\/10.1016\/j.ic.2005.04.002","journal-title":"Inf. Comput."},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Diekert, V., Je\u017c, A., Plandowski, W.: Finding all solutions of equations in free groups and monoids with involution. Inf. Comput. 251, 263\u2013286 (2016). https:\/\/doi.org\/10.1016\/j.ic.2016.09.009","DOI":"10.1016\/j.ic.2016.09.009"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974). https:\/\/doi.org\/10.1145\/361179.361202","DOI":"10.1145\/361179.361202"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Faran, R., Kupferman, O.: On synthesis of specifications with arithmetic. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 161\u2013173. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_14","DOI":"10.1007\/978-3-030-38919-2_14"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Faran, R., Kupferman, O.: On synthesis of specifications with arithmetic. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 161\u2013173. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_14","DOI":"10.1007\/978-3-030-38919-2_14"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Figueira, D., Je\u017c, A., Lin, A.W.: Data path queries over embedded graph databases. In: PODS \u201922: International Conference on Management of Data, Philadelphia, 12\u201317 June, 2022. pp. 189\u2013201 (2022). https:\/\/doi.org\/10.1145\/3517804.3524159","DOI":"10.1145\/3517804.3524159"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Figueira, D., Lin, A.W.: Reasoning on data words over numeric domains. In: LICS \u201922: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2\u20135 August 2022, pp. 37:1\u201337:13 (2022). https:\/\/doi.org\/10.1145\/3531130.3533354","DOI":"10.1145\/3531130.3533354"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Furia, C.A.: What\u2019s decidable about sequences? In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 128\u2013142. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15643-4_11","DOI":"10.1007\/978-3-642-15643-4_11"},{"key":"2_CR26","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-39611-3_21"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 561\u2013572. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13089-2_47","DOI":"10.1007\/978-3-642-13089-2_47"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Hoare, C.A.R.: Quicksort. Comput. J. 5(1), 10\u201315 (1962). https:\/\/doi.org\/10.1093\/comjnl\/5.1.10","DOI":"10.1093\/comjnl\/5.1.10"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Je\u017c, A.: Recompression: a simple and powerful technique for word equations. J. ACM 63(1), 4:1\u20134:51 (2016). https:\/\/doi.org\/10.1145\/2743014","DOI":"10.1145\/2743014"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Jhala, R., Majumdar, R.: Software model checking. ACM Comput. Surv. 41(4), 21:1\u201321:54 (2009). https:\/\/doi.org\/10.1145\/1592434.1592438","DOI":"10.1145\/1592434.1592438"},{"issue":"2","key":"2_CR31","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. Theor. Comput. Sci. 134(2), 329\u2013363 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90242-9","journal-title":"Theor. Comput. Sci."},{"key":"2_CR32","unstructured":"Kroening, D., Strichman, O.: Decision Procedures. Springer (2008)"},{"issue":"8","key":"2_CR33","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Commun. ACM 17(8), 453\u2013455 (1974). https:\/\/doi.org\/10.1145\/361082.361093","journal-title":"Commun. ACM"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Lin, A.W., R\u00fcmmer, P.: Regular model checking revisited. In: Olderog, E.-R., Steffen, B., Yi, W. (eds.) Model Checking, Synthesis, and Learning. LNCS, vol. 13030, pp. 97\u2013114. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91384-7_6","DOI":"10.1007\/978-3-030-91384-7_6"},{"key":"2_CR35","doi-asserted-by":"publisher","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, POPL 2016, St. Petersburg, 20\u201322 January 2016, pp. 123\u2013136 (2016). https:\/\/doi.org\/10.1145\/2837614.2837641","DOI":"10.1145\/2837614.2837641"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Makanin, G.S.: The problem of solvability of equations in a free semigroup. Sbornik: Mathematics 32(2), 129\u2013198 (1977)","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Meyer, B.: Applying \u201cDesign by contract.\u201d IEEE Comput. 25(10), 40\u201351 (1992). https:\/\/doi.org\/10.1109\/2.161279","DOI":"10.1109\/2.161279"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"de Moura, L.M., Bj\u00f8rner, N.: Z3: An efficient SMT solver. In: TACAS (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"2_CR39","unstructured":"None: RegExLib (2017). https:\/\/regexlib.com\/. Accessed 2 Feb 2023"},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Plandowski, W.: On PSPACE generation of a solution set of a word equation and its applications. Theor. Comput. Sci. 792, 20\u201361 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.10.023","DOI":"10.1016\/j.tcs.2018.10.023"},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"R\u00fcmmer, P.: A constraint sequent calculus for first-order logic with linear integer arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 274\u2013289. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89439-1_20","DOI":"10.1007\/978-3-540-89439-1_20"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Safari, M., Huisman, M.: A generic approach to the verification of the permutation property of sequential and parallel swap-based sorting algorithms. In: Dongol, B., Troubitsyna, E. (eds.) IFM 2020. LNCS, vol. 12546, pp. 257\u2013275. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63461-2_14","DOI":"10.1007\/978-3-030-63461-2_14"},{"key":"2_CR43","doi-asserted-by":"publisher","unstructured":"Schulz, K.U.: Makanin\u2019s algorithm for word equations\u2013two improvements and a generalization. In: Schulz, K.U. (ed.) IWWERT. Lecture Notes in Computer Science, vol. 572, pp. 85\u2013150. Springer, Cham (1990). https:\/\/doi.org\/10.1007\/3-540-55124-7_4","DOI":"10.1007\/3-540-55124-7_4"},{"key":"2_CR44","doi-asserted-by":"publisher","unstructured":"Veanes, M., Hooimeijer, P., Livshits, B., Molnar, D., Bjorner, N.: Symbolic finite state transducers: algorithms and applications. SIGPLAN Not. 47(1), 137\u2013150 (2012). https:\/\/doi.org\/10.1145\/2103621.2103674","DOI":"10.1145\/2103621.2103674"},{"key":"2_CR45","doi-asserted-by":"publisher","unstructured":"Wang, Q., Appel, A.W.: A solver for arrays with concatenation. J. Autom. Reason. 67(1), 4 (2023). https:\/\/doi.org\/10.1007\/s10817-022-09654-y","DOI":"10.1007\/s10817-022-09654-y"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37703-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T11:02:50Z","timestamp":1693047770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37703-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031377020","9783031377037"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37703-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i-cav.org\/2023\/","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"261","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":"67","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":"0","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":"26% - 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":"11","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)"}}]}}