{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:23:10Z","timestamp":1779074590687,"version":"3.51.4"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031377082","type":"print"},{"value":"9783031377099","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,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"vor","delay-in-days":197,"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>Legal properties involve reasoning about data values and time. Metric first-order temporal logic (MFOTL) provides a rich formalism for specifying legal properties. While MFOTL has been successfully used for verifying legal properties over operational systems via runtime monitoring, no solution exists for MFOTL-based verification in early-stage system development captured by requirements. Given a legal property and system requirements, both formalized in MFOTL, the compliance of the property can be verified on the requirements via satisfiability checking. In this paper, we propose a practical, sound, and complete (within a given bound) satisfiability checking approach for MFOTL. The approach, based on satisfiability modulo theories (SMT), employs a counterexample-guided strategy to incrementally search for a satisfying solution. We implemented our approach using the Z3 SMT solver and evaluated it on five case studies spanning the healthcare, business administration, banking and aviation domains. Our results indicate that our approach can efficiently determine whether legal properties of interest are met, or generate counterexamples that lead to compliance violations.<\/jats:p>","DOI":"10.1007\/978-3-031-37709-9_18","type":"book-chapter","created":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T10:01:21Z","timestamp":1689501681000},"page":"374-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Early Verification of\u00a0Legal Compliance via\u00a0Bounded Satisfiability Checking"],"prefix":"10.1007","author":[{"given":"Nick","family":"Feng","sequence":"first","affiliation":[]},{"given":"Lina","family":"Marsso","sequence":"additional","affiliation":[]},{"given":"Mehrdad","family":"Sabetzadeh","sequence":"additional","affiliation":[]},{"given":"Marsha","family":"Chechik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,17]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-030-29959-0_33","volume-title":"Computer Security \u2013 ESORICS 2019","author":"E Arfelt","year":"2019","unstructured":"Arfelt, E., Basin, D., Debois, S.: Monitoring the GDPR. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11735, pp. 681\u2013699. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29959-0_33"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Bae, K., Lee, J.: Bounded model checking of signal temporal logic properties using syntactic separation. Proc. ACM Program. Lang. 3(POPL), 51:1\u201351:30 (2019). https:\/\/doi.org\/10.1145\/3290364","DOI":"10.1145\/3290364"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14295-6_1","volume-title":"Computer Aided Verification","author":"D Basin","year":"2010","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S.: Policy monitoring in first-order temporal logic. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 1\u201318. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_1"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Basin, D.A., Klaedtke, F., M\u00fcller, S., Zalinescu, E.: Monitoring metric first-order temporal properties. J. ACM 62(2), 15:1\u201315:45 (2015). https:\/\/doi.org\/10.1145\/2699444","DOI":"10.1145\/2699444"},{"issue":"4","key":"18_CR5","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.jal.2014.07.005","volume":"12","author":"MM Bersani","year":"2014","unstructured":"Bersani, M.M., Frigeri, A., Morzenti, A., Pradella, M., Rossi, M., Pietro, P.S.: Constraint LTL satisfiability checking without automata. J. Appl. Log. 12(4), 522\u2013557 (2014). https:\/\/doi.org\/10.1016\/j.jal.2014.07.005","journal-title":"J. Appl. Log."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Cavada, R., et al.: The nuXmv Symbolic Model Checker. In: CAV, pp. 334\u2013342 (2014)","DOI":"10.1007\/978-3-319-08867-9_22"},{"key":"18_CR7","unstructured":"Claessen, K., S\u00f6rensson, N.: New techniques that improve MACE-style finite model finding. In: Proceedings of the CADE-19 Workshop: Model Computation-Principles, Algorithms, Applications, pp. 11\u201327. Citeseer (2003)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/1066100.1066102","volume":"52","author":"D Detlefs","year":"2005","unstructured":"Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. J. ACM 52(3), 365\u2013473 (2005). https:\/\/doi.org\/10.1145\/1066100.1066102","journal-title":"J. ACM"},{"key":"18_CR10","unstructured":"Feng, N., Marsso, L., Garavel, H.: Health record. Model checking context model (MCC\u201921), Dept. of Computer Science - University of Toronto (2021). https:\/\/mcc.lip6.fr\/pdf\/HealthRecord-form.pdf"},{"key":"18_CR11","unstructured":"Feng, N., Marsso, L., Sabetzadeh, M., Chechik, M.: Early verification of legal compliance via bounded satisfiability checking (2023). https:\/\/arxiv.org\/abs\/2209.04052"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Feng, N., Marsso, L., Sabetzadeh, M., Chechik, M.: Supplementary material for: early verification of legal compliance via bounded satisfiability checking (2023). https:\/\/github.com\/agithubuserseva\/IBSC","DOI":"10.1007\/978-3-031-37709-9_18"},{"key":"18_CR13","unstructured":"Garavel, H., Graf, S.: Formal methods for safe and secure computers systems. Altros (2013)"},{"key":"18_CR14","unstructured":"Gario, M., Micheli, A.: PYSMT: a solver-agnostic library for fast prototyping of SMT-based algorithms. In: SMT Workshop 2015 (2015)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-24732-6_7","volume-title":"Model Checking Software","author":"P Gastin","year":"2004","unstructured":"Gastin, P., Moro, P., Zeitoun, M.: Minimization of counterexamples in SPIN. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol. 2989, pp. 92\u2013108. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24732-6_7"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-73595-3_12","volume-title":"Automated Deduction \u2013 CADE-21","author":"Y Ge","year":"2007","unstructured":"Ge, Y., Barrett, C., Tinelli, C.: Solving quantified verification conditions using satisfiability modulo theories. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 167\u2013182. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73595-3_12"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-02658-4_25","volume-title":"Computer Aided Verification","author":"Y Ge","year":"2009","unstructured":"Ge, Y., de Moura, L.: Complete instantiation for quantified formulas in satisfiabiliby modulo theories. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 306\u2013320. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_25"},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TSC.2011.10","volume":"5","author":"S Hall\u00e9","year":"2012","unstructured":"Hall\u00e9, S., Villemaire, R.: Runtime Enforcement of Web Service Message Contracts with Data. IEEE Trans. Serv. Comput. 5(2), 192\u2013206 (2012). https:\/\/doi.org\/10.1109\/TSC.2011.10","journal-title":"IEEE Trans. Serv. Comput."},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Hublet, F., Basin, D.A., Krstic, S.: Real-time policy enforcement with metric first-order temporal logic. In: Atluri, V., Pietro, R.D., Jensen, C.D., Meng, W. (eds.) Computer Security - ESORICS 2022\u201327th European Symposium on Research in Computer Security, Copenhagen, Denmark, September 26\u201330, 2022, Proceedings, Part II. Lecture Notes in Computer Science, vol. 13555, pp. 211\u2013232. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-17146-8_11","DOI":"10.1007\/978-3-031-17146-8_11"},{"key":"18_CR20","unstructured":"Legislative Assembly of Ontario: Personal Health Information Protection Act (PHIPA) (2004). https:\/\/www.ontario.ca\/laws\/statute\/04p03"},{"issue":"6","key":"18_CR21","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1093\/logcom\/exy013","volume":"28","author":"J Li","year":"2018","unstructured":"Li, J., Pu, G., Zhang, L., Vardi, M.Y., He, J.: Accelerating LTL satisfiability checking by SAT solvers. J. Log. Comput. 28(6), 1011\u20131030 (2018). https:\/\/doi.org\/10.1093\/logcom\/exy013","journal-title":"J. Log. Comput."},{"key":"18_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103369","volume":"289","author":"J Li","year":"2020","unstructured":"Li, J., Pu, G., Zhang, Y., Vardi, M.Y., Rozier, K.Y.: SAT-based explicit LTLf satisfiability checking. Artif. Intell. 289, 103369 (2020). https:\/\/doi.org\/10.1016\/j.artint.2020.103369","journal-title":"Artif. Intell."},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Li, J., Rozier, K.Y., Pu, G., Zhang, Y., Vardi, M.Y.: SAT-based explicit LTLf satisfiability checking. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019, pp. 2946\u20132953. AAAI Press (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33012946","DOI":"10.1609\/aaai.v33i01.33012946"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-25543-5_1","volume-title":"Computer Aided Verification","author":"J Li","year":"2019","unstructured":"Li, J., Vardi, M.Y., Rozier, K.Y.: Satisfiability checking for mission-time LTL. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 3\u201322. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_1"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Li, J., Zhang, L., Pu, G., Vardi, M.Y., He, J.: LTL Satisfiability checking revisited. In: Proceedings of the 20th International Symposium on Temporal Representation and Reasoning, Pensacola, FL, USA, 2013, pp. 91\u201398. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/TIME.2013.19","DOI":"10.1109\/TIME.2013.19"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Mattarei, C., Cimatti, A., Gario, M., Tonetta, S., Rozier, K.Y.: Comparing different functional allocations in automated air traffic control design. In: Formal Methods in Computer-Aided Design (FMCAD\u20192015), Austin, Texas, USA, pp. 112\u2013119. IEEE (2015)","DOI":"10.1109\/FMCAD.2015.7542260"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-73595-3_13","volume-title":"Automated Deduction \u2013 CADE-21","author":"L de Moura","year":"2007","unstructured":"de Moura, L., Bj\u00f8rner, N.: Efficient E-matching for SMT solvers. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 183\u2013198. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73595-3_13"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Bacchus, F.: Maximum satisfiability using core-guided MaxSAT resolution. In: Proceedings of the 28th International Conference on Artificial Intelligence (AAAI\u201914), Qu\u00e9bec City, Canada, pp. 2717\u20132723. AAAI Press (2014). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI14\/paper\/view\/8513","DOI":"10.1609\/aaai.v28i1.9124"},{"issue":"4","key":"18_CR29","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765\u2013768 (1981). https:\/\/doi.org\/10.1145\/322276.322287","journal-title":"J. ACM"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-51054-1_30","volume-title":"Automated Reasoning","author":"G Passmore","year":"2020","unstructured":"Passmore, G., et al.: The Imandra automated reasoning system (System Description). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 464\u2013471. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_30"},{"issue":"1","key":"18_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2267170","volume":"12","author":"EL Post","year":"1947","unstructured":"Post, E.L.: Recursive Unsolvability of a Problem of Thue. J. Symb. Log. 12(1), 1\u201311 (1947). https:\/\/doi.org\/10.2307\/2267170","journal-title":"J. Symb. Log."},{"key":"18_CR32","doi-asserted-by":"publisher","unstructured":"Pradella, M., Morzenti, A., San Pietro, P.: Bounded satisfiability checking of metric temporal logic specifications. ACM Trans. Softw. Eng. Methodol. 22(3), 20:1\u201320:54 (2013). https:\/\/doi.org\/10.1145\/2491509.2491514","DOI":"10.1145\/2491509.2491514"},{"key":"18_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-38574-2_26","volume-title":"Automated Deduction \u2013 CADE-24","author":"A Reynolds","year":"2013","unstructured":"Reynolds, A., Tinelli, C., Goel, A., Krsti\u0107, S., Deters, M., Barrett, C.: Quantifier instantiation techniques for finite model finding in SMT. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 377\u2013391. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38574-2_26"},{"key":"18_CR34","doi-asserted-by":"publisher","unstructured":"Reynolds, A., Tinelli, C., de Moura, L.M.: Finding conflicting instances of quantified formulas in SMT. In: Formal Methods in Computer-Aided Design (FMCAD\u20192014), Lausanne, Switzerland, pp. 195\u2013202. IEEE (2014). https:\/\/doi.org\/10.1109\/FMCAD.2014.6987613","DOI":"10.1109\/FMCAD.2014.6987613"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-73370-6_11","volume-title":"Model Checking Software","author":"KY Rozier","year":"2007","unstructured":"Rozier, K.Y., Vardi, M.Y.: LTL satisfiability checking. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 149\u2013167. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73370-6_11"},{"key":"18_CR36","doi-asserted-by":"publisher","unstructured":"Shan, L., Sangchoolie, B., Folkesson, P., Vinter, J., Schoitsch, E., Loiseaux, C.: A survey on the application of safety, security, and privacy standards for dependable systems. In: Proceedings of the 15th European Dependable Computing Conference (EDCC\u20192019), Naples, Italy, pp. 71\u201372. IEEE (2019). https:\/\/doi.org\/10.1109\/EDCC.2019.00023","DOI":"10.1109\/EDCC.2019.00023"},{"key":"18_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-23702-7_23","volume-title":"Static Analysis","author":"P Suter","year":"2011","unstructured":"Suter, P., K\u00f6ksal, A.S., Kuncak, V.: Satisfiability modulo recursive programs. In: Yahav, E. (ed.) SAS 2011. LNCS, vol. 6887, pp. 298\u2013315. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23702-7_23"}],"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-37709-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T05:01:24Z","timestamp":1702789284000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37709-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031377082","9783031377099"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37709-9_18","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":"17 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)"}}]}}