{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:32:47Z","timestamp":1742949167330,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031457838"},{"type":"electronic","value":"9783031457845"}],"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:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-45784-5_6","type":"book-chapter","created":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T17:01:40Z","timestamp":1697389300000},"page":"80-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Rule-Based Approach for\u00a0Designing and\u00a0Composing Abstract Domains"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Jurjo","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Morales","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Lopez-Garcia","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1017\/S1471068422000175","volume":"22","author":"E de Angelis","year":"2022","unstructured":"de Angelis, E., Proietti, M., Fioravanti, F., Pettorossi, A.: Verifying catamorphism-based contracts using constrained horn clauses. Theory Pract. Logic Program. 22(4), 555\u2013572 (2022). https:\/\/doi.org\/10.1017\/S1471068422000175","journal-title":"Theory Pract. Logic Program."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1017\/S1471068404002261","volume":"5","author":"F Benoy","year":"2005","unstructured":"Benoy, F., King, A., Mesnard, F.: Programming pearl: computing convex hulls with a linear solver. TPLP 5, 259\u2013271 (2005). https:\/\/doi.org\/10.1017\/S1471068404002261","journal-title":"TPLP"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-88806-0_11","volume-title":"Static Analysis","author":"J Braine","year":"2021","unstructured":"Braine, J., Gonnord, L., Monniaux, D.: Data abstraction: a general framework to handle program verification of data structures. In: Dr\u0103goi, C., Mukherjee, S., Namjoshi, K. (eds.) SAS 2021. LNCS, vol. 12913, pp. 215\u2013235. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88806-0_11"},{"issue":"10","key":"6_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/1639949.1640108","volume":"44","author":"M Bravenboer","year":"2009","unstructured":"Bravenboer, M., Smaragdakis, Y.: Strictly declarative specification of sophisticated points-to analyses. SIGPLAN Not. 44(10), 243\u2013262 (2009). https:\/\/doi.org\/10.1145\/1639949.1640108","journal-title":"SIGPLAN Not."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-57264-3_37","volume-title":"Static Analysis","author":"M Bruynooghe","year":"1993","unstructured":"Bruynooghe, M., Codish, M.: Freeness, sharing, linearity and correctness \u2014 all at once. In: Cousot, P., Falaschi, M., Fil\u00e9, G., Rauzy, A. (eds.) WSA 1993. LNCS, vol. 724, pp. 153\u2013164. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57264-3_37"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-61055-3_32","volume-title":"Programming Languages and Systems \u2014 ESOP \u201996","author":"F Bueno","year":"1996","unstructured":"Bueno, F., Cabeza, D., Hermenegildo, M., Puebla, G.: Global analysis of standard Prolog programs. In: Nielson, H.R. (ed.) ESOP 1996. LNCS, vol. 1058, pp. 108\u2013124. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61055-3_32"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Campion, M., Preda, M.D., Giacobazzi, R.: Partial (in)completeness in abstract interpretation: limiting the imprecision in program analysis. Proc. ACM Program. Lang. 6(POPL), 1\u201331 (2022). https:\/\/doi.org\/10.1145\/3498721","DOI":"10.1145\/3498721"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1109\/69.43410","volume":"1","author":"S Ceri","year":"1989","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: What you always wanted to know about datalog (and never dared to ask). IEEE TKDE 1(1), 146\u2013166 (1989). https:\/\/doi.org\/10.1109\/69.43410","journal-title":"IEEE TKDE"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Codish, M., Mulkers, A., Bruynooghe, M., Garc\u00eda de la Banda, M., Hermenegildo, M.: Improving abstract interpretations by combining domains. ACM TOPLAS 17(1), 28\u201344 (1995)","DOI":"10.1145\/200994.200998"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: ACM Symposium on Principles of Programming Languages (POPL 1977), pp. 238\u2013252. ACM Press (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL 1979, pp. 269\u2013282. ACM (1979)","DOI":"10.1145\/567752.567778"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-31987-0_3","volume-title":"Programming Languages and Systems","author":"P Cousot","year":"2005","unstructured":"Cousot, P., et al.: The ASTRE\u00c9 analyzer. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 21\u201330. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_3"},{"issue":"6","key":"6_CR13","first-page":"974","volume":"22","author":"E De Angelis","year":"2021","unstructured":"De Angelis, E., Fioravanti, F., Gallagher, J.P., Hermenegildo, M.V., Pettorossi, A., Proietti, M.: Analysis and transformation of constrained horn clauses for program verification. TPLP 22(6), 974\u20131042 (2021)","journal-title":"TPLP"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T.: Theory and practice of constraint handling rules. JLP Spec. Issue CLP 37(1\u20133) (1998)","DOI":"10.1016\/S0743-1066(98)10005-5"},{"issue":"2","key":"6_CR15","first-page":"196","volume":"21","author":"I Garcia-Contreras","year":"2021","unstructured":"Garcia-Contreras, I., Morales, J.F., Hermenegildo, M.V.: Incremental and modular context-sensitive analysis. TPLP 21(2), 196\u2013243 (2021)","journal-title":"TPLP"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-030-45260-5_3","volume-title":"Logic-Based Program Synthesis and Transformation","author":"I Garcia-Contreras","year":"2020","unstructured":"Garcia-Contreras, I., Morales, J.F., Hermenegildo, M.V.: Incremental analysis of logic programs with assertions and open predicates. In: Gabbrielli, M. (ed.) LOPSTR 2019. LNCS, vol. 12042, pp. 36\u201356. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45260-5_3"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Garc\u00eda de la Banda, M., Hermenegildo, M.V., Bruynooghe, M., Dumortier, V., Janssens, G., Simoens, W.: Global analysis of constraint logic programs. ACM Trans. Program. Lang. Syst. 18(5), 564\u2013615 (1996)","DOI":"10.1145\/232706.232734"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MAHC.2021.3133136","volume":"44","author":"R Giacobazzi","year":"2022","unstructured":"Giacobazzi, R., Ranzato, F.: History of abstract interpretation. IEEE Ann. Hist. Comput. 44(2), 33\u201343 (2022). https:\/\/doi.org\/10.1109\/MAHC.2021.3133136","journal-title":"IEEE Ann. Hist. Comput."},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Henriksen, K.S., Gallagher, J.P.: Abstract interpretation of PIC programs through logic programming. In: SCAM 2006, pp. 184\u2013196. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/SCAM.2006.1","DOI":"10.1109\/SCAM.2006.1"},{"issue":"1\u20132","key":"6_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2005.02.006","volume":"58","author":"M Hermenegildo","year":"2005","unstructured":"Hermenegildo, M., Puebla, G., Bueno, F., Garcia, P.L.: Integrated program debugging, verification, and optimization using abstract interpretation (and the ciao system preprocessor). Sci. Comput. Program. 58(1\u20132), 115\u2013140 (2005)","journal-title":"Sci. Comput. Program."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-60085-2_7","volume-title":"The Logic Programming Paradigm: a 25-Year Perspective","author":"MV Hermenegildo","year":"1999","unstructured":"Hermenegildo, M.V., Puebla, G., Bueno, F.: Using global analysis, partial specifications, and an extensible assertion language for program validation and debugging. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm: a 25-Year Perspective, pp. 161\u2013192. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-60085-2_7"},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/349214.349216","volume":"22","author":"MV Hermenegildo","year":"2000","unstructured":"Hermenegildo, M.V., Puebla, G., Marriott, K., Stuckey, P.: Incremental analysis of constraint logic programs. ACM TOPLAS 22(2), 187\u2013223 (2000). https:\/\/doi.org\/10.1145\/349214.349216","journal-title":"ACM TOPLAS"},{"key":"6_CR23","unstructured":"Jacobs, D., Langen, A.: Accurate and efficient approximation of variable aliasing in logic programs. In: North American Conference on Logic Programming (1989)"},{"key":"6_CR24","unstructured":"Jurjo, D., Morales, J.F., Lopez-Garcia, P., Hermenegildo, M.: A methodology for designing and composing abstract domains using rewriting rules. Technical report, CLIP-1\/2023.0, CLIP Lab, UPM and IMDEA Software Institute (2023). https:\/\/cliplab.org\/papers\/jurjo-domcons-tr.pdf"},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/(SICI)1097-024X(199802)28:2<199::AID-SPE150>3.0.CO;2-4","volume":"28","author":"A Kelly","year":"1998","unstructured":"Kelly, A., Marriott, K., S\u00f8ndergaard, H., Stuckey, P.: A practical object-oriented analysis engine for CLP. Softw. Pract. Exp. 28(2), 188\u2013224 (1998)","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"6_CR26","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/174625.174627","volume":"16","author":"B Le Charlier","year":"1994","unstructured":"Le Charlier, B., Van Hentenryck, P.: Experimental evaluation of a generic abstract interpretation algorithm for prolog. ACM TOPLAS 16(1), 35\u2013101 (1994)","journal-title":"ACM TOPLAS"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Madsen, M., Yee, M., Lhot\u00e1k, O.: From datalog to FLIX: a declarative language for fixed points on lattices. In: PLDI, pp. 194\u2013208. ACM (2016)","DOI":"10.1145\/2980983.2908096"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-78769-3_11","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M M\u00e9ndez-Lojo","year":"2008","unstructured":"M\u00e9ndez-Lojo, M., Navas, J., Hermenegildo, M.V.: A flexible, (C)LP-based approach to the analysis of object-oriented programs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol. 4915, pp. 154\u2013168. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78769-3_11"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"M\u00e9ndez-Lojo, M., Navas, J., Hermenegildo, M.V.: An efficient, parametric fixpoint algorithm for analysis of java bytecode. In: ETAPS Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE 2007) (2007)","DOI":"10.1016\/j.entcs.2007.02.060"},{"key":"6_CR30","unstructured":"Mesnard, F., Neumerkel, U.: CHR for Protoyping Abstract Interpretation (1997, unpublished note). http:\/\/lim.univ-reunion.fr\/staff\/fred\/Publications\/00-MesnardN.pdf"},{"key":"6_CR31","unstructured":"Muthukumar, K., Hermenegildo, M.: Determination of variable dependence information at compile-time through abstract interpretation. In: NACLP 1989, pp. 166\u2013189. MIT Press (1989)"},{"key":"6_CR32","unstructured":"Muthukumar, K., Hermenegildo, M.: Deriving a fixpoint computation algorithm for top-down abstract interpretation of logic programs. Technical report ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC) (1990). http:\/\/cliplab.org\/papers\/mcctr-fixpt.pdf"},{"issue":"2\/3","key":"6_CR33","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K Muthukumar","year":"1992","unstructured":"Muthukumar, K., Hermenegildo, M.: Compile-time derivation of variable dependency using abstract interpretation. JLP 13(2\/3), 315\u2013347 (1992)","journal-title":"JLP"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/10722311_2","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"G Puebla","year":"2000","unstructured":"Puebla, G., Bueno, F., Hermenegildo, M.: An assertion language for constraint logic programs. In: Deransart, P., Hermenegildo, M.V., Ma\u0142uszynski, J. (eds.) Analysis and Visualization Tools for Constraint Programming. LNCS, vol. 1870, pp. 23\u201361. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722311_2"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-61739-6_47","volume-title":"Static Analysis","author":"G Puebla","year":"1996","unstructured":"Puebla, G., Hermenegildo, M.: Optimized algorithms for incremental analysis of logic programs. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol. 1145, pp. 270\u2013284. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61739-6_47"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/BFb0036944","volume-title":"Automata, Languages and Programming","author":"T Sato","year":"1983","unstructured":"Sato, T., Tamaki, H.: Enumeration of success patterns in logic programs. In: Diaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 640\u2013652. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/BFb0036944"},{"issue":"9","key":"6_CR37","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1017\/S0960129521000499","volume":"31","author":"H Seidl","year":"2021","unstructured":"Seidl, H., Vogler, R.: Three improvements to the top-down solver. Math. Struct. Comput. Sci. 31(9), 1090\u20131134 (2021). https:\/\/doi.org\/10.1017\/S0960129521000499","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR38","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-981-19-9601-6_9","volume-title":"Challenges of Software Verification","author":"S Tilscher","year":"2023","unstructured":"Tilscher, S., Stade, Y., Schwarz, M., Vogler, R., Seidl, H.: The top-down solver-an exercise in A$$^2$$I. In: Arceri, V., Cortesi, A., Ferrara, P., Olliaro, M. (eds.) Challenges of Software Verification. Intelligent Systems Reference Library, vol. 238, pp. 157\u2013179. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-19-9601-6_9"},{"key":"6_CR39","unstructured":"Van Roy, P., Despain, A.M.: The benefits of global dataflow analysis for an optimizing prolog compiler. In: North American Conference on Logic Programming, pp. 501\u2013515. MIT Press (1990)"},{"key":"6_CR40","unstructured":"Warren, R., Hermenegildo, M., Debray, S.K.: On the practicality of global flow analysis of logic programs. In: JICSLP, pp. 684\u2013699. MIT Press (1988)"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Whaley, J., Lam, M.S.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: PLDI, pp. 131\u2013144. ACM (2004)","DOI":"10.1145\/996893.996859"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45784-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T18:10:52Z","timestamp":1697393452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45784-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031457838","9783031457845"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45784-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cascais","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"23 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lopstr.github.io\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"29","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":"8","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":"4","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":"28% - 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":"3","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)"}}]}}