{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T08:01:29Z","timestamp":1764403289848,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031477041"},{"type":"electronic","value":"9783031477058"}],"license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47705-8_4","type":"book-chapter","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T09:02:24Z","timestamp":1699606944000},"page":"62-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["CHC Model Validation with\u00a0Proof Guarantees"],"prefix":"10.1007","author":[{"given":"Rodrigo","family":"Otoni","sequence":"first","affiliation":[]},{"given":"Martin","family":"Blicha","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Eugster","sequence":"additional","affiliation":[]},{"given":"Natasha","family":"Sharygina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,6]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Alt, L., Blicha, M., Hyv\u00e4rinen, A.E.J., Sharygina, N.: SolCMC: solidity compiler\u2019s model checker. In: Proceedings of the 34th International Conference on Computer Aided Verification, pp. 325\u2013338 (2022)","DOI":"10.1007\/978-3-031-13185-1_16"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Andreotti, B., Lachnitt, H., Barbosa, H.: Carcara: an efficient proof checker and elaborator for SMT proofs in the alethe format. In: Proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 367\u2013386 (2023)","DOI":"10.1007\/978-3-031-30823-9_19"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Armand, M., Faure, G., Gr\u00e9goire, B., Keller, C., Th\u00e9ry, L., Werner, B.: A modular integration of SAT\/SMT solvers to COQ through proof witnesses. In: Proceedings of the 1st International Conference on Certified Programs and Proofs, pp. 135\u2013150 (2011)","DOI":"10.1007\/978-3-642-25379-9_12"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Baek, S., Carneiro, M., Heule, M.J.H.: A flexible proof format for SAT solver-elaborator communication. In: Proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 59\u201375 (2021)","DOI":"10.1007\/978-3-030-72016-2_4"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Barbosa, H., et al.: CVC5: a versatile and industrial-strength SMT solver. In: Proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 415\u2013442 (2022)","DOI":"10.1007\/978-3-030-99524-9_24"},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10817-018-09502-y","volume":"64","author":"H Barbosa","year":"2020","unstructured":"Barbosa, H., Blanchette, J.C., Fleury, M., Fontaine, P.: Scalable fine-grained proofs for formula processing. J. Autom. Reason. 64(3), 485\u2013510 (2020)","journal-title":"J. Autom. Reason."},{"key":"4_CR7","unstructured":"Barbosa, H., Hoenicke, J., Bobot, F.: SMT-COMP 2022: Competition Report (2022). https:\/\/smt-comp.github.io\/2022\/slides-smtworkshop.pdf"},{"key":"4_CR8","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.6 (2021). https:\/\/smtlib.cs.uiowa.edu\/papers\/smt-lib-reference-v2.6-r2021-05-12.pdf"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. IOS Press (2021)","DOI":"10.3233\/FAIA201017"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Beyer, D.: Competition on software verification and witness validation: SV-COMP 2023. In: Proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 495\u2013522 (2023)","DOI":"10.1007\/978-3-031-30820-8_29"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Beyer, D., Strej\u010dek, J.: Case study on verification-witness validators: where we are and where we go. In: Proceedings of the 29th International Symposium on Static Analysis, pp. 160\u2013174 (2022)","DOI":"10.1007\/978-3-031-22308-2_8"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Bj\u00f8rner, N., Gurfinkel, A., McMillan, K., Rybalchenko, A.: Horn clause solvers for program verification. In: Beklemishev, L.D., Blass, A., Dershowitz, N., Finkbeiner, B., Schulte, W. (eds.) Fields of Logic and Computation II. LNCS, vol. 9300, pp. 24\u201351. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23534-9_2","DOI":"10.1007\/978-3-319-23534-9_2"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-015-9335-3","volume":"56","author":"JC Blanchette","year":"2016","unstructured":"Blanchette, J.C., B\u00f6hme, S., Fleury, M., Smolka, S.J., Steckermeier, A.: Semi-intelligible ISAR proofs from machine-generated proofs. J. Autom. Reason. 56(2), 155\u2013200 (2016)","journal-title":"J. Autom. Reason."},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Blicha, M., Britikov, K., Sharygina, N.: The golem horn solver. In: Proceedings of the 35th International Conference on Computer Aided Verification, pp. 209\u2013223 (2023). https:\/\/doi.org\/10.1007\/978-3-031-37703-7_10","DOI":"10.1007\/978-3-031-37703-7_10"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"B\u00f6hme, S., Weber, T.: Fast LCF-style proof reconstruction for Z3. In: Proceedings of the 1st International Conference on Interactive Theorem Proving, pp. 179\u2013194 (2010)","DOI":"10.1007\/978-3-642-14052-5_14"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Bouton, T., Caminha, B., de Oliveira, D., D\u00e9harbe, D., Fontaine, P.: veriT: an open, trustable and efficient SMT-solver. In: Proceedings of the 22nd International Conference on Automated Deduction, pp. 151\u2013156 (2009)","DOI":"10.1007\/978-3-642-02959-2_12"},{"key":"4_CR17","unstructured":"Bury, G.: Dolmen: a validator for SMT-LIB and much more. In: Proceedings of the 19th International Workshop on Satisfiability Modulo Theories, pp. 32\u201339 (2021)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Calzavara, S., Grishchenko, I., Maffei, M.: HornDroid: practical and sound static analysis of android applications by SMT solving. In: Proceedings of the 1st IEEE European Symposium on Security and Privacy, pp. 47\u201362 (2016)","DOI":"10.1109\/EuroSP.2016.16"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Christ, J., Hoenicke, J., Nutz, A.: SMTInterpol: an interpolating SMT solver. In: Proceedings of the 19th International SPIN Workshop, pp. 248\u2013254 (2012)","DOI":"10.1007\/978-3-642-31759-0_19"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Cruz-Filipe, L., Heule, M.J.H., Hunt, W.A., Kaufmann, M., Schneider-Kamp, P.: Efficient certified RAT verification. In: Proceedings of the 26th International Conference on Automated Deduction, pp. 220\u2013236 (2017)","DOI":"10.1007\/978-3-319-63046-5_14"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"De Angelis, E., Govind, V.K.H.: CHC-COMP 2022: competition report. In: Proceedings of the 9th Workshop on Horn Clauses for Verification and Synthesis, pp. 44\u201362 (2022)","DOI":"10.4204\/EPTCS.373.5"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"De Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 337\u2013340 (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Ekici, B., et al.: SMTCoq: a plug-in for integrating SMT solvers into COQ. In: Proceedings of the 29th International Conference on Computer Aided Verification, pp. 126\u2013133 (2017)","DOI":"10.1007\/978-3-319-63390-9_7"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Ernst, G.: Korn - software verification with horn clauses (competition contribution). In: Proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 559\u2013564 (2023)","DOI":"10.1007\/978-3-031-30820-8_36"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Fontaine, P., Marion, J.Y., Merz, S., Nieto, L.P., Tiu, A.: Expressiveness + automation + soundness: towards combining SMT solvers and interactive proof assistants. In: Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 167\u2013181 (2006)","DOI":"10.1007\/11691372_11"},{"key":"4_CR26","unstructured":"Gario, M., Micheli, A.: PySMT: a solver-agnostic library for fast prototyping of SMT-based algorithms. In: Proceedings of the 13th International Workshop on Satisfiability Modulo Theories, pp. 1\u201310 (2015)"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Grebenshchikov, S., Lopes, N.P., Popeea, C., Rybalchenko, A.: Synthesizing software verifiers from proof rules. In: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 405\u2013416 (2012)","DOI":"10.1145\/2254064.2254112"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Gurfinkel, A., Bj\u00f8rner, N.: The science, art, and magic of constrained horn clauses. In: Proceedings of the 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 6\u201310 (2019)","DOI":"10.1109\/SYNASC49474.2019.00010"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Gurfinkel, A., Kahsai, T., Komuravelli, A., Navas, J.A.: The SeaHorn verification framework. In: Proceedings of the 27th International Conference on Computer Aided Verification, pp. 343\u2013361 (2015)","DOI":"10.1007\/978-3-319-21690-4_20"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Hunt, W.A., Wetzler, N.: Trimming while checking clausal proofs. In: Proceedings of the 13th Conference on Formal Methods in Computer-Aided Design, pp. 181\u2013188 (2013)","DOI":"10.1109\/FMCAD.2013.6679408"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Heule, M., Hunt, W., Kaufmann, M., Wetzler, N.: Efficient, verified checking of propositional proofs. In: Proceedings of the 8th International Conference on Interactive Theorem Proving, pp. 269\u2013284 (2017)","DOI":"10.1007\/978-3-319-66107-0_18"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Hunt, W.A., Wetzler, N.: Verifying refutations with extended resolution. In: Proceedings of the 24th International Conference on Automated Deduction, pp. 345\u2013359 (2013)","DOI":"10.1007\/978-3-642-38574-2_24"},{"issue":"10","key":"4_CR33","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"4_CR34","unstructured":"Hoenicke, J., Schindler, T.: A simple proof format for SMT. In: Proceedings of the 20th International Workshop on Satisfiability Modulo Theories, pp. 54\u201370 (2022)"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Hojjat, H., R\u00fcmmer, P., Subotic, P., Yi, W.: Horn clauses for communicating timed systems. In: Proceedings of the 1st Workshop on Horn Clauses for Verification and Synthesis, pp. 39\u201352 (2014)","DOI":"10.4204\/EPTCS.169.6"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Hojjat, H., R\u00fcmmer, P.: The Eldarica Horn solver. In: Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design, pp. 1\u20137 (2018)","DOI":"10.23919\/FMCAD.2018.8603013"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Hyv\u00e4rinen, A.E.J., Marescotti, M., Alt, L., Sharygina, N.: OpenSMT2: an SMT solver for multi-core and cloud computing. In: Proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing, pp. 547\u2013553 (2016)","DOI":"10.1007\/978-3-319-40970-2_35"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Kahsai, T., R\u00fcmmer, P., Sanchez, H., Sch\u00e4f, M.: JayHorn: a framework for verifying java programs. In: Proceedings of the 28th International Conference on Computer Aided Verification, pp. 352\u2013358 (2016)","DOI":"10.1007\/978-3-319-41528-4_19"},{"issue":"3","key":"4_CR39","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10703-016-0249-4","volume":"48","author":"A Komuravelli","year":"2016","unstructured":"Komuravelli, A., Gurfinkel, A., Chaki, S.: SMT-based model checking for recursive programs. Formal Method. Syst. Design 48(3), 175\u2013205 (2016)","journal-title":"Formal Method. Syst. Design"},{"key":"4_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-50497-0","volume-title":"Decision Procedures - An Algorithmic Point of View","author":"D Kroening","year":"2016","unstructured":"Kroening, D., Strichman, O.: Decision Procedures - An Algorithmic Point of View, 2nd edn. Springer, Heidelberg (2016)","edition":"2"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Kumar, R., Myreen, M.O., Norrish, M., Owens, S.: CakeML: a verified implementation of ML. In: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 179\u2013191 (2014)","DOI":"10.1145\/2535838.2535841"},{"issue":"3","key":"4_CR42","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10817-019-09525-z","volume":"64","author":"P Lammich","year":"2020","unstructured":"Lammich, P.: Efficient verified (UN)SAT certificate checking. J. Autom. Reason. 64(3), 513\u2013532 (2020)","journal-title":"J. Autom. Reason."},{"issue":"4","key":"4_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3462205","volume":"43","author":"Y Matsushita","year":"2021","unstructured":"Matsushita, Y., Tsukada, T., Kobayashi, N.: RustHorn: CHC-based verification for rust programs. ACM Trans. Program. Lang. Syst. 43(4), 1\u201354 (2021)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR44","unstructured":"de Moura, L., Bj\u00f8rner, N.: Proofs and refutations, and Z3. In: Proceedings of the 7th International Workshop on the Implementation of Logics, pp. 123\u2013132 (2008)"},{"key":"4_CR45","doi-asserted-by":"crossref","unstructured":"Otoni, R., Blicha, M., Eugster, P., Hyv\u00e4rinen, A.E.J., Sharygina, N.: Theory-specific proof steps witnessing correctness of SMT executions. In: Proceedings of the 58th ACM\/IEEE Design Automation Conference, pp. 541\u2013546 (2021)","DOI":"10.1109\/DAC18074.2021.9586272"},{"issue":"2","key":"4_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3564699","volume":"26","author":"R Otoni","year":"2023","unstructured":"Otoni, R., Marescotti, M., Alt, L., Eugster, P., Hyv\u00e4rinen, A., Sharygina, N.: A solicitous approach to smart contract verification. ACM Trans. Privacy Secur. 26(2), 1\u201328 (2023)","journal-title":"ACM Trans. Privacy Secur."},{"key":"4_CR47","doi-asserted-by":"crossref","unstructured":"Reeves, J.E., Kiesl-Reiter, B., Heule, M.J.H.: Propositional proof skeletons. In: Proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 329\u2013347 (2023)","DOI":"10.1007\/978-3-031-30823-9_17"},{"issue":"1","key":"4_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10703-014-0219-7","volume":"47","author":"P R\u00fcmmer","year":"2015","unstructured":"R\u00fcmmer, P., Hojjat, H., Kuncak, V.: On recursion-free Horn causes and Craig interpolation. Formal Method. Syst. Design 47(1), 1\u201325 (2015)","journal-title":"Formal Method. Syst. Design"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"Sandberg Ericsson, A., Myreen, M.O., \u00c5man Pohjola, J.: A verified generational garbage collector for CakeML. In: Proceedings of the 8th International Conference on Interactive Theorem Proving, pp. 444\u2013461 (2017)","DOI":"10.1007\/978-3-319-66107-0_28"},{"key":"4_CR50","doi-asserted-by":"crossref","unstructured":"Schurr, H.J., Fleury, M., Barbosa, H., Fontaine, P.: Alethe: towards a generic SMT proof format. In: Proceedings of the 7th Workshop on Proof eXchange for Theorem Proving, pp. 49\u201354 (2021)","DOI":"10.4204\/EPTCS.336.6"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"Sinz, C., Biere, A.: Extended resolution proofs for conjoining BDDs. In: Proceedings of the 1st International Symposium on Computer Science in Russia, pp. 600\u2013611 (2006)","DOI":"10.1007\/11753728_60"},{"issue":"1","key":"4_CR52","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10703-012-0163-3","volume":"42","author":"A Stump","year":"2013","unstructured":"Stump, A., Oe, D., Reynolds, A., Hadarean, L., Tinelli, C.: SMT proof checking using a logical framework. Formal Method. Syst. Design 42(1), 91\u2013118 (2013)","journal-title":"Formal Method. Syst. Design"},{"key":"4_CR53","unstructured":"Tange, O.: GNU parallel - the command-line power tool; login. The USENIX Magaz. 36(1), 42\u201347 (2011)"},{"key":"4_CR54","doi-asserted-by":"crossref","unstructured":"Wetzler, N., Heule, M.J.H., Hunt, W.A.: DRAT-trim: efficient checking and trimming using expressive clausal proofs. In: Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing, pp. 422\u2013429 (2014)","DOI":"10.1007\/978-3-319-09284-3_31"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47705-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T14:51:50Z","timestamp":1713451910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47705-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"ISBN":["9783031477041","9783031477058"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47705-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"6 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"iFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"13 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","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":"ifm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/liacs.leidenuniv.nl\/~bonsanguemm\/ifm23\/index.html","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":"51","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":"16","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":"31% - 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":"5","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)"}}]}}