{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T21:36:43Z","timestamp":1780522603343,"version":"3.54.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030714994","type":"print"},{"value":"9783030715007","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T00:00:00Z","timestamp":1616198400000},"content-version":"vor","delay-in-days":78,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A program containing placeholders for unspecified statements or expressions is called an abstract (or schematic) program. Placeholder symbols occur naturally in program transformation rules, as used in refactoring, compilation, optimization, or parallelization. We present a generalization of automated cost analysis that can handle abstract programs and, hence, can analyze the impact on the cost of program transformations. This kind of relational property requires provably precise cost bounds which are not always produced by cost analysis. Therefore, we certify by deductive verification that the inferred abstract cost bounds are correct and sufficiently precise. It is the first approach solving this problem. Both, abstract cost analysis and certification, are based on quantitative abstract execution (QAE) which in turn is a variation of abstract execution, a recently developed symbolic execution technique for abstract programs. To realize QAE the new concept of a cost invariant is introduced. QAE is implemented and runs fully automatically on a benchmark set consisting of representative optimization rules.<\/jats:p>","DOI":"10.1007\/978-3-030-71500-7_2","type":"book-chapter","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T13:12:14Z","timestamp":1616159534000},"page":"24-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Certified Abstract Cost Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0048-0705","authenticated-orcid":false,"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8000-7613","authenticated-orcid":false,"given":"Reiner","family":"H\u00e4hnle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alicia","family":"Merayo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4439-7129","authenticated-orcid":false,"given":"Dominic","family":"Steinh\u00f6fel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,20]]},"reference":[{"key":"2_CR1","unstructured":"Alfred\u00a0V. Aho, Ravi Sethi, and Jeffrey\u00a0D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Reiner H\u00e4hnle, Peter\u00a0H. Schmitt, and Mattias Ulbrich, editors. Deductive Software Verification - The KeY Book - From Theory to Practice, volume 10001 of LNCS. Springer, 2016.","DOI":"10.1007\/978-3-319-49812-6"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Elvira Albert, Puri Arenas, Samir Genaim, German Puebla, and Damiano Zanardini. Cost analysis of object-oriented bytecode programs. Theor. Comput. Sci., 413(1):142\u2013159, 2012.","DOI":"10.1016\/j.tcs.2011.07.009"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Elvira Albert, Richard Bubel, Samir Genaim, Reiner H\u00e4hnle, Germ\u00e1n Puebla, and Guillermo Rom\u00e1n-D\u00edez. A formal verification framework for static analysis - as well as its instantiation to the resource analyzer COSTA and formal verification tool KeY. Software and Systems Modeling, 15(4):987\u20131012, 2016.","DOI":"10.1007\/s10270-015-0476-y"},{"key":"2_CR5","unstructured":"Roberto Bagnara, Patricia\u00a0M. Hill, and Enea Zaffanella. The Parma polyhedra library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program., 72(1-2):3\u201321, 2008."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Roberto Bagnara, Fred Mesnard, Andrea Pescetti, and Enea Zaffanella. A new look at the automatic synthesis of linear ranking functions. Inf. Comput., 215:47\u201367, 2012.","DOI":"10.1016\/j.ic.2012.03.003"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Yves Bertot and Pierre Cast\u00e9ran. Interactive Theorem Proving and Program Development - Coq\u2019Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2004.","DOI":"10.1007\/978-3-662-07964-5"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"R\u00e9gis Blanc, Thomas\u00a0A. Henzinger, Thibaud Hottelier, and Laura Kov\u00e1cs. ABC: algebraic bound computation for loops. In Edmund\u00a0M. Clarke and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Dakar, Senegal, April 25-May 1, 2010, Revised Selected Papers, volume 6355 of LNCS, pages 103\u2013118. Springer, 2010.","DOI":"10.1007\/978-3-642-17511-4_7"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Robert\u00a0S. Boyer, Bernard Elspas, and Karl\u00a0N. Levitt. SELECT\u2014A formal system for testing and debugging programs bysymbolic execution. ACM SIGPLAN Notices, 10(6):234\u2013245, June 1975.","DOI":"10.1145\/390016.808445"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, and J\u00fcrgenGiesl. Alternating runtime and size complexity analysis of integer programs. In Erika \u00c1brah\u00e1m and Klaus Havelund, editors, Tools and Algorithms for the Construction and Analysis of Systems - 20th Intl. Conf., TACAS, Grenoble, France, volume 8413 of LNCS, pages 140\u2013155. Springer, 2014.","DOI":"10.1007\/978-3-642-54862-8_10"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Marc Brockschmidt, Richard Musiol, Carsten Otto, and J\u00fcrgen Giesl. Automated termination proofs for Java programs with cyclic data. In P.\u00a0Madhusudan and Sanjit\u00a0A. Seshia, editors, Computer Aided Verification - 24th International Conference, CAV 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings, volume 7358 of LNCS, pages 105\u2013122. Springer, 2012.","DOI":"10.1007\/978-3-642-31424-7_13"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Richard Bubel, Andreas Roth, and Philipp R\u00fcmmer. Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic. Electr. Notes Theor. Comput. Sci., 199:107\u2013128, 2008.","DOI":"10.1016\/j.entcs.2007.11.015"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Patrick Cousot and Nicolas Halbwachs. Automatic discovery of linear restraints among variables of a program. In Alfred\u00a0V. Aho, Stephen\u00a0N. Zilles, and Thomas\u00a0G. Szymanski, editors, Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, Arizona, USA, January 1978, pages 84\u201396. ACM Press, 1978.","DOI":"10.1145\/512760.512770"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Karl Crary and Stephanie Weirich. Resource bound certification. In Mark\u00a0N. Wegman and Thomas\u00a0W. Reps, editors, POPL 2000, Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, Massachusetts, USA, January 19-21, 2000, pages 184\u2013198. ACM, 2000.","DOI":"10.1145\/325694.325716"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Jean-Christophe Filli\u00e2tre and Claude March\u00e9. The Why\/Krakatoa\/Caduceus platform for deductive program verification. In Werner Damm and Holger Hermanns, editors, Computer Aided Verification, 19th Intl. Conf., CAV, Berlin, Germany, volume 4590 of LNCS, pages 173\u2013177. Springer, 2007.","DOI":"10.1007\/978-3-540-73368-3_21"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Antonio Flores-Montoya and Reiner H\u00e4hnle. Resource analysis of complex programs with cost equations. In Jacques Garrigue, editor, Programming Languages and Systems -12th Asian Symposium, APLAS 2014, Singapore, November 17-19, 2014, Proceedings, volume 8858 of LNCS, pages 275\u2013295. Springer, 2014.","DOI":"10.1007\/978-3-319-12736-1_15"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"J\u00fcrgen Giesl, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Carsten Otto, Martin Pl\u00fccker, Peter Schneider-Kamp, Thomas Str\u00f6der, Stephanie Swiderski, and Ren\u00e9 Thiemann. Proving termination of programs automatically with AProVE. In St\u00e9phane Demri, Deepak Kapur, and Christoph Weidenbach, editors, Automated Reasoning - 7th Intl. Joint Conf., IJCAR, Vienna, Austria, volume 8562 of LNCS, pages 184\u2013191. Springer, 2014.","DOI":"10.1007\/978-3-319-08587-6_13"},{"key":"2_CR18","unstructured":"Benny Godlin and Ofer Strichman. Regression Verification: Proving the Equivalence of Similar Programs. Softw. Test., Verif. Reliab., 23(3):241\u2013258, 2013"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Neville Grech, Kyriakos Georgiou, James Pallister, Steve Kerrison, and Kerstin Eder. Static energy consumption analysis of LLVM IR programs. CoRR, abs\/1405.4565, 2014.","DOI":"10.1145\/2764967.2764974"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Sumit Gulwani, Krishna\u00a0K. Mehra, and Trishul\u00a0M. Chilimbi. SPEED: precise and efficient static estimation of program computational complexity. In Zhong Shao and Benjamin\u00a0C. Pierce, editors, Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pages 127\u2013139. ACM, 2009.","DOI":"10.1145\/1480881.1480898"},{"key":"2_CR21","unstructured":"Reiner H\u00e4hnle and Marieke Huisman. Deductive verification: from pen-and-paper proofs to industrial tools. In Bernhard Steffen and Gerhard Woeginger, editors, Computing and Software Science: State of the Art and Perspectives, volume 10000 of LNCS, pages 345\u2013373. Springer, 2019."},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Reiner H\u00e4hnle and Dominic Steinh\u00f6fel. Modular, correct compilation with automatic soundness proofs. In Tiziana Margaria and Bernhard Steffen, editors, Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques, 8th Intl. Symp., Proc. Part I, ISoLA, Cyprus, volume 11244 of LNCS, pages 424\u2013447. Springer, 2018.","DOI":"10.1007\/978-3-030-03418-4_25"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Jan Hoffmann and Martin Hofmann. Amortized resource analysis with polynomial potential. In Andrew\u00a0D. Gordon, editor, Programming Languages and Systems, 19th European Symposium on Programming, ESOP, Paphos, Cyprus, volume 6012 of LNCS, pages 287\u2013306. Springer, 2010.","DOI":"10.1007\/978-3-642-11957-6_16"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"John Hughes, Lars Pareto, and Amr Sabry. Proving the correctness of reactive systems using sized types. In Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201996, page 410\u2013423, New York, NY, USA, 1996. Association for Computing Machinery.","DOI":"10.1145\/237721.240882"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"James\u00a0C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385\u2013394, July 1976.","DOI":"10.1145\/360248.360252"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Sudipta Kundu, Zachary Tatlock, and Sorin Lerner. Proving Optimizations Correct Using Parameterized Program Equivalence. In Proc. PLDI 2009, pages 327\u2013337, 2009.","DOI":"10.1145\/1543135.1542513"},{"key":"2_CR27","unstructured":"Gary\u00a0T. Leavens, Erik Poll, Curtis Clifton, Yoonsik Cheon, Clyde Ruby, David Cok, Peter M\u00fcller, Joseph Kiniry, Patrice Chalin, Daniel\u00a0M. Zimmerman, and Werner Dietl. JML Reference Manual, May 2013. Draft revision 2344."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Rustan Leino. Dafny: An automatic program verifier for functional correctness. In 16th International Conference, LPAR-16, Dakar, Senegal, pages 348\u2013370. Springer Berlin Heidelberg, April 2010.","DOI":"10.1007\/978-3-642-17511-4_20"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Umer Liqat, Kyriakos Georgiou, Steve Kerrison, Pedro L\u00f3pez-Garc\u00eda, John\u00a0P. Gallagher, Manuel\u00a0V. Hermenegildo, and Kerstin Eder. Inferring parametric energy consumption functions at different software levels: ISA vs. LLVM IR. In Marko C. J.\u00a0D. van Eekelen and Ugo\u00a0Dal Lago, editors, Foundational and Practical Aspects of Resource Analysis - 4th Intl. Workshop, FOPARA, London, UK, Revised Selected Papers, volume 9964 of LNCS, pages 81\u2013100, 2015.","DOI":"10.1007\/978-3-319-46559-3_5"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Nuno\u00a0P. Lopes, David Menendez, Santosh Nagarakatte, and John Regehr. Practical Verification of Peephole Optimizations with Alive. Commun. ACM, 61(2):84\u201391, 2018.","DOI":"10.1145\/3166064"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Tobias Nipkow, Lawrence\u00a0C. Paulson, and Markus Wenzel. Isabelle\/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.","DOI":"10.1007\/3-540-45949-9"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Ivan Radi\u010dek, Gilles Barthe, Marco Gaboardi, Deepak Garg, and Florian Zuleger. Monadic refinements for relational cost analysis. Proc. ACM Program. Lang., 2(POPL), December 2017.","DOI":"10.1145\/3158124"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Wolfgang Reif. The KIV-approach to software verification. In KORSO - Methods, Languages, and Tools for the Construction of Correct Software, volume 1009 of LNCS, pages 339\u2013370. Springer, 1995.","DOI":"10.1007\/BFb0015471"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Jan Smans, Bart Jacobs, Frank Piessens, and Wolfram Schulte. An automatic verifier for Java-like programs based on dynamic frames. In Jos\u00e9\u00a0Luiz Fiadeiro and Paola Inverardi, editors, Fundamental Approaches to Software Engineering, 11th Intl. Conf., FASE, Budapest, Hungary, volume 4961 of LNCS, pages 261\u2013275. Springer, 2008.","DOI":"10.1007\/978-3-540-78743-3_19"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Fausto Spoto, Fred Mesnard, and \u00c9tienne Payet. A termination analyzer for Java bytecode based on path-length. ACM Trans. Program. Lang. Syst., 32(3):8:1\u20138:70, 2010.","DOI":"10.1145\/1709093.1709095"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Dominic Steinh\u00f6fel. REFINITY to Model and Prove Program Transformation Rules. In Bruno\u00a0C. d.\u00a0S.\u00a0Oliveira, editor, Proc. 18th Asian Symposium on Programming Languages and Systems (APLAS), LNCS. Springer, 2020.","DOI":"10.1007\/978-3-030-64437-6_16"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Dominic Steinh\u00f6fel and Reiner H\u00e4hnle. Abstract execution. In Maurice\u00a0H. ter Beek, Annabelle McIver, and Jos\u00e9\u00a0N. Oliveira, editors, Formal Methods - The Next 30 Years - Third World Congress, FM 2019, Porto, Portugal, October 7-11, 2019, Proceedings, volume 11800 of LNCS, pages 319\u2013336. Springer, 2019.","DOI":"10.1007\/978-3-030-30942-8_20"},{"key":"2_CR38","unstructured":"Dominic Steinh\u00f6fel. Abstract Execution: Automatically Proving Infinitely Many Programs. PhD thesis, Technical University of Darmstadt, Department of Computer Science, Darmstadt, Germany, 2020."},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Ben Wegbreit. Mechanical program analysis. Commun. ACM, 18(9):528\u2013539, 1975.","DOI":"10.1145\/361002.361016"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Florian Zuleger, Sumit Gulwani, Moritz Sinn, and Helmut Veith. Bound analysis of imperative programs with the size-change abstraction (extended version). CoRR, abs\/1203.5303, 2012.","DOI":"10.1007\/978-3-642-23702-7_22"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-71500-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,20]],"date-time":"2021-03-20T00:14:27Z","timestamp":1616199267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-71500-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030714994","9783030715007"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-71500-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamental Approaches to Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2021\/fase","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","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":"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":"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,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)"}},{"value":"The conference changed to an online format 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)"}}]}}