{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:15:39Z","timestamp":1770977739276,"version":"3.50.1"},"publisher-location":"Cham","reference-count":67,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030452339","type":"print"},{"value":"9783030452346","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45234-6_3","type":"book-chapter","created":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T14:04:23Z","timestamp":1587391463000},"page":"53-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Integrating Topological Proofs with Model Checking to Instrument Iterative Design"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5303-8481","authenticated-orcid":false,"given":"Claudio","family":"Menghi","sequence":"first","affiliation":[]},{"given":"Alessandro Maria","family":"Rizzi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8016-5750","authenticated-orcid":false,"given":"Anna","family":"Bernasconi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"A. Albarghouthi, A. Gurfinkel, and M. Chechik. From under-approximations to over-approximations and back. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, 2012","DOI":"10.1007\/978-3-642-28756-5_12"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur, S. Moarref, and U. Topcu. Counter-strategy guided refinement of GR(1) temporal logic specifications. In Formal Methods in Computer-Aided Design, pages 26\u201333, Oct 2013","DOI":"10.1109\/FMCAD.2013.6679387"},{"key":"3_CR3","unstructured":"C. Baier and J.-P. Katoen. Principles of Model Checking. The MIT Press, 2008"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"A. Bernasconi, C. Menghi, P. Spoletini, L. D. Zuck, and C. Ghezzi. From model checking to a temporal proof for partial models. In International Conference on Software Engineering and Formal Methods. Springer, 2017","DOI":"10.1007\/978-3-319-66197-1_4"},{"key":"3_CR5","unstructured":"A. Bernasconi, C. Menghi, P. Spoletini, L. D. Zuck, and C. Ghezzi. From model checking to a temporal proof for partial models: preliminary example. arXiv preprint arXiv:1706.02701 , 2017"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beyer, T.\u00a0A. Henzinger, R.\u00a0Jhala, and R.\u00a0Majumdar. The software model checker blast. International Journal on Software Tools for Technology Transfer, 9(5-6):505\u2013525, 2007","DOI":"10.1007\/s10009-007-0044-z"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using sat procedures instead of bdds. In Design Automation Conference. ACM, 1999","DOI":"10.21236\/ADA360973"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"G.\u00a0Brunet, M.\u00a0Chechik, S.\u00a0Easterbrook, S.\u00a0Nejati, N.\u00a0Niu, and M.\u00a0Sabetzadeh. A manifesto for model merging. In International workshop on Global integrated model management. ACM, 2006","DOI":"10.1145\/1138304.1138307"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"G. Bruns and P. Godefroid. Model checking partial state spaces with 3-valued temporal logics. In International Conference on Computer Aided Verification. Springer, 1999","DOI":"10.1007\/3-540-48683-6_25"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"G. Bruns and P. Godefroid. Generalized model checking: Reasoning about partial state spaces. In International Conference on Concurrency Theory. Springer, 2000","DOI":"10.1007\/3-540-44618-4_14"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"G.\u00a0Bruns and P.\u00a0Godefroid. Model checking with multi-valued logics. In International Colloquium on Automata, Languages and Programming. Springer, 2004","DOI":"10.1007\/978-3-540-27836-8_26"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"M.\u00a0Chechik, B.\u00a0Devereux, S.\u00a0Easterbrook, and A.\u00a0Gurfinkel. Multi-valued symbolic model-checking.Transactions on Software Engineering and Methodology, 12(4):1\u201338, 2004","DOI":"10.1145\/990010.990011"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"M.\u00a0Chechik, R.\u00a0Salay, T.\u00a0Viger, S.\u00a0Kokaly, and M.\u00a0Rahimi. Software assurance in an uncertain world. In R.\u00a0H\u00e4hnle and W.\u00a0van\u00a0der Aalst, editors, Fundamental Approaches to Software Engineering, pages 3\u201321, Cham, 2019. Springer","DOI":"10.1007\/978-3-030-16722-6_1"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. Nusmv 2: An opensource tool for symbolic model checking. In International Conference on Computer Aided Verification. Springer, 2002","DOI":"10.1007\/3-540-45657-0_29"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic. Compositional specifications for ioco testing. In International Conference on Software Testing, Verification and Validation, pages 373\u2013382. IEEE, 2014","DOI":"10.1109\/ICST.2014.50"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"C. Deng and K. S. Namjoshi. Witnessing network transformations. In International Conference on Runtime Verification. Springer, 2017","DOI":"10.1007\/978-3-319-67531-2_10"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, Z. Hanna, and A. Nadel. A scalable algorithm for minimal unsatisfiable core extraction. In International Conference on Theory and Applications of Satisfiability Testing, pages 36\u201341. Springer, 2006","DOI":"10.1007\/11814948_5"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"M. B. Dwyer, G. S. Avrunin, and J. C. Corbett. Patterns in property specifications for finite-state verification. In International Conference on Software engineering. ACM, 1999","DOI":"10.1145\/302405.302672"},{"key":"3_CR19","unstructured":"S.\u00a0Easterbrook and M.\u00a0Chechik. A framework for multi-valued reasoning over inconsistent viewpoints. In International conference on software engineering. IEEE, 2001"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"S. Easterbrook, M. Chechik, B. Devereux, A. Gurfinkel, A. Lai, V. Petrovykh, A. Tafliovich, and C. Thompson-Walsh. $$\\chi $$Chek: A model checker for multi-valued reasoning. In International Conference on Software Engineering, pages 804\u2013805, 2003","DOI":"10.1109\/ICSE.2003.1201295"},{"key":"3_CR21","unstructured":"N. Een, A. Mishchenko, and N. Amla. A single-instance incremental SAT formulation of proof- and counterexample-based abstraction. In Conference on Formal Methods in Computer-Aided Design, FMCAD, pages 181\u2013188. FMCAD Inc, 2010"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"M. Famelis, R. Salay, and M. Chechik. Partial models: Towards modeling and reasoning with uncertainty. In International Conference on Software Engineering. IEEE, 2012","DOI":"10.1109\/ICSE.2012.6227159"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"H.\u00a0Foster, S.\u00a0Uchitel, J.\u00a0Magee, and J.\u00a0Kramer. Ltsa-ws: a tool for model-based verification of web service compositions and choreography. In International conference on Software engineering. ACM, 2006","DOI":"10.1145\/1134285.1134408"},{"key":"3_CR24","unstructured":"P. Godefroid and M. Huth. Model checking vs. generalized model checking: Semantic minimizations for temporal logics. In Logic in Computer Science. IEEE, 2005"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based model checking using modal transition systems. In International Conference on Concurrency Theory. Springer, 2001","DOI":"10.1007\/3-540-44685-0_29"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"P.\u00a0Godefroid and R.\u00a0Jagadeesan. On the expressiveness of 3-valued models. In International Workshop on Verification, Model Checking, and Abstract Interpretation. Springer, 2003","DOI":"10.1007\/3-540-36384-X_18"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"P. Godefroid and N. Piterman. LTL generalized model checking revisited. In Verification, Model Checking, and Abstract Interpretation, pages 89\u2013104. Springer, 2009","DOI":"10.1007\/978-3-540-93900-9_11"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"P.\u00a0Godefroid and N.\u00a0Piterman. LTL generalized model checking revisited. International journal on software tools for technology transfer, 13(6):571\u2013584, 2011","DOI":"10.1007\/s10009-010-0169-3"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"A. Griggio, M. Roveri, and S. Tonetta. Certifying proofs for LTL model checking. In Formal Methods in Computer Aided Design (FMCAD), pages 1\u20139. IEEE, 2018","DOI":"10.23919\/FMCAD.2018.8603022"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"A. Gurfinkel and M. Chechik. Multi-valued model checking via classical model checking. In International Conference on Concurrency Theory. Springer, 2003","DOI":"10.1007\/978-3-540-45187-7_18"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"A. Gurfinkel and M. Chechik. Proof-like counter-examples. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 160\u2013175. Springer, 2003","DOI":"10.1007\/3-540-36577-X_12"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"O. Guthmann, O. Strichman, and A. Trostanetski. Minimal unsatisfiable core extraction for SMT. In Formal Methods in Computer-Aided Design (FMCAD), pages 57\u201364. IEEE, 2016","DOI":"10.1109\/FMCAD.2016.7886661"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"T. A. Henzinger, R. Jhala, R. Majumdar, and M. A. Sanvido. Extreme model checking. In Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday. Springer, 2003","DOI":"10.1007\/978-3-540-39910-0_16"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"H. S. Hong, I. Lee, O. Sokolsky, and H. Ural. A temporal logic based theory of test coverage and generation. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, 2002","DOI":"10.1007\/3-540-46002-0_23"},{"key":"3_CR35","unstructured":"S.\u00a0A. Kripke. Semantical considerations on modal logic. Acta Philosophica Fennica, 16(1963):83\u201394, 1963"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"O.\u00a0Kupferman and M.\u00a0Y. Vardi. From complementation to certification. Theoretical computer science, 345(1):83\u2013100, 2005","DOI":"10.1016\/j.tcs.2005.07.021"},{"key":"3_CR37","unstructured":"K.\u00a0G. Larsen and B.\u00a0Thomsen. A modal process logic. In Logic in Computer Science. IEEE, 1988"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"E.\u00a0Letier, J.\u00a0Kramer, J.\u00a0Magee, and S.\u00a0Uchitel. Deriving event-based transition systems from goal-oriented requirements models. Automated Software Engineering, 2008","DOI":"10.1007\/s10515-008-0027-7"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"M.\u00a0H. Liffiton and K.\u00a0A. Sakallah. Algorithms for computing minimal unsatisfiable subsets of constraints. Journal of Automated Reasoning, 40(1):1\u201333, 2008","DOI":"10.1007\/s10817-007-9084-z"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"C.\u00a0Menghi, S.\u00a0Garcia, P.\u00a0Pelliccione, and J.\u00a0Tumova. Multi-robot LTL planning under uncertainty. In Formal Methods. Springer, 2018","DOI":"10.1145\/3183440.3195046"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"C. Menghi, S. Garc\u00eda, P. Pelliccione, and J. Tumova. Towards multi-robot applications planning under uncertainty. In International Conference on Software Engineering: Companion Proceeedings. ACM, 2018","DOI":"10.1145\/3183440.3195046"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"C.\u00a0Menghi, P.\u00a0Spoletini, M.\u00a0Chechik, and C.\u00a0Ghezzi. Supporting verification-driven incremental distributed design of components. In Fundamental Approaches to Software Engineering. Springer, 2018","DOI":"10.1007\/978-3-319-89363-1_10"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"C. Menghi, P. Spoletini, M. Chechik, and C. Ghezzi. A verification-driven framework for iterative design of controllers. Formal Aspects of Computing, Jun 2019","DOI":"10.1007\/s00165-019-00484-1"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"C.\u00a0Menghi, P.\u00a0Spoletini, and C.\u00a0Ghezzi. Dealing with incompleteness in automata-based model checking. In Formal Methods. Springer, 2016","DOI":"10.1007\/978-3-319-48989-6_32"},{"key":"3_CR45","unstructured":"C. Menghi, P. Spoletini, and C. Ghezzi. COVER: Change-based Goal Verifier and Reasoner. In International Conference on Requirements Engineering: Foundation for Software Quality: Companion Proceeedings. Springer, 2017"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"C. Menghi, P. Spoletini, and C. Ghezzi. Integrating goal model analysis with iterative design. In International Working Conference on Requirements Engineering: Foundation for Software Quality. Springer, 2017","DOI":"10.1007\/978-3-319-54045-0_9"},{"key":"3_CR47","unstructured":"A. Nadel. Boosting minimal unsatisfiable core extraction. In Conference on Formal Methods in Computer-Aided Design, pages 221\u2013229. FMCAD Inc, 2010"},{"key":"3_CR48","doi-asserted-by":"crossref","unstructured":"K.\u00a0S. Namjoshi. Certifying model checkers. In Computer Aided Verification. Springer, 2001","DOI":"10.1007\/3-540-44585-4_2"},{"key":"3_CR49","doi-asserted-by":"crossref","unstructured":"D.\u00a0Peled, A.\u00a0Pnueli, and L.\u00a0Zuck. From falsification to verification. In Foundations of Software Technology and Theoretical Computer Science. Springer, 2001","DOI":"10.1007\/3-540-45294-X_25"},{"key":"3_CR50","doi-asserted-by":"crossref","unstructured":"D.\u00a0Peled and L.\u00a0Zuck. From model checking to a temporal proof. In International SPIN Workshop on Model Checking of Software. Springer, 2001","DOI":"10.1007\/3-540-45139-0_1"},{"key":"3_CR51","unstructured":"Y. Pencol\u00e9, G. Steinbauer, C. M\u00fchlbacher, and L. Trav\u00e9-Massuy\u00e8s. Diagnosing discrete event systems using nominal models only. In DX, pages 169\u2013183, 2017"},{"key":"3_CR52","unstructured":"I. Pill and T. Quaritsch. Behavioral diagnosis of LTL specifications at operator level. In Twenty-Third International Joint Conference on Artificial Intelligence, 2013"},{"key":"3_CR53","doi-asserted-by":"crossref","unstructured":"S.\u00a0Rajan, N.\u00a0Shankar, and M.\u00a0K. Srivas. An integration of model checking with automated proof checking. In Computer Aided Verification. Springer, 1995","DOI":"10.1007\/3-540-60045-0_42"},{"key":"3_CR54","unstructured":"V.\u00a0Raman, C.\u00a0Lignos, C.\u00a0Finucane, K.\u00a0C. Lee, M.\u00a0P. Marcus, and H.\u00a0Kress-Gazit. Sorry Dave, I\u2019m Afraid I Can\u2019t Do That: Explaining Unachievable Robot Tasks Using Natural Language. In Robotics: Science and Systems, volume\u00a02, pages 2\u20131, 2013"},{"key":"3_CR55","unstructured":"L. Sa\u00efs, M. Hacid, and F. Hantry. On the complexity of computing minimal unsatisfiable LTL formulas. Electronic Colloquium on Computational Complexity (ECCC), 19:69, 2012"},{"key":"3_CR56","doi-asserted-by":"crossref","unstructured":"V. Schuppan. Enhancing unsatisfiable cores for LTL with information on temporal relevance. Theoretical Computer Science, 655(Part B):155\u2013192, 2016. Quantitative Aspects of Programming Languages and Systems (2013-14)","DOI":"10.1016\/j.tcs.2016.01.014"},{"key":"3_CR57","doi-asserted-by":"crossref","unstructured":"V. Schuppan. Enhanced unsatisfiable cores for QBF: Weakening universal to existential quantifiers. In International Conference on Tools with Artificial Intelligence (ICTAI), pages 81\u201389. IEEE, 2018","DOI":"10.1109\/ICTAI.2018.00023"},{"key":"3_CR58","unstructured":"T. Sergeant, S. R. Gor\u00e9, and J. Thomson. Finding minimal unsatisfiable subsets in linear temporal logic using BDDs, 2013"},{"key":"3_CR59","doi-asserted-by":"crossref","unstructured":"S. Shoham and O. Grumberg. A game-based framework for ctl counterexamples and 3-valued abstraction-refinement. In International Conference on Computer Aided Verification, pages 275\u2013287. Springer, 2003","DOI":"10.1007\/978-3-540-45069-6_28"},{"key":"3_CR60","doi-asserted-by":"crossref","unstructured":"L. Tan and R. Cleaveland. Evidence-based model checking. In International Conference on Computer Aided Verification, pages 455\u2013470. Springer, 2002","DOI":"10.1007\/3-540-45657-0_37"},{"key":"3_CR61","doi-asserted-by":"crossref","unstructured":"X. Tao and G. Li. The complexity of linear-time temporal logic model repair. In International Workshop on Structured Object-Oriented Formal Language and Method, pages 69\u201387. Springer, 2017","DOI":"10.1007\/978-3-319-90104-6_5"},{"key":"3_CR62","unstructured":"Torpedo. http:\/\/github.com\/alessandrorizzi\/torpedo , 2020"},{"key":"3_CR63","doi-asserted-by":"crossref","unstructured":"J. Tretmans. Testing concurrent systems: A formal approach. In International Conference on Concurrency Theory, pages 46\u201365. Springer, 1999","DOI":"10.1007\/3-540-48320-9_6"},{"key":"3_CR64","unstructured":"S. Uchitel. Partial behaviour modelling: Foundations for incremental and iterative model-based software engineering. In M. V. M. Oliveira and J. Woodcock, editors, Formal Methods: Foundations and Applications. Springer, 2009"},{"key":"3_CR65","doi-asserted-by":"crossref","unstructured":"S.\u00a0Uchitel, D.\u00a0Alrajeh, S.\u00a0Ben-David, V.\u00a0Braberman, M.\u00a0Chechik, G.\u00a0De\u00a0Caso,N.\u00a0D\u2019Ippolito, D.\u00a0Fischbein, D.\u00a0Garbervetsky, J.\u00a0Kramer, et\u00a0al. Supporting incremental behaviour model elaboration. Computer Science-Research and Development, 28(4):279\u2013293, 2013","DOI":"10.1007\/s00450-012-0233-1"},{"key":"3_CR66","doi-asserted-by":"crossref","unstructured":"S.\u00a0Uchitel, G.\u00a0Brunet, and M.\u00a0Chechik. Synthesis of partial behavior models from properties and scenarios. Transactions on Software Engineering, 35(3):384\u2013406, 2009","DOI":"10.1109\/TSE.2008.107"},{"key":"3_CR67","doi-asserted-by":"crossref","unstructured":"M. van der Bijl, A. Rensink, and J. Tretmans. Compositional testing with ioco. In Formal Approaches to Software Testing, pages 86\u2013100. Springer, 2004","DOI":"10.1007\/978-3-540-24617-6_7"}],"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-45234-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T20:32:54Z","timestamp":1666384374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45234-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452339","9783030452346"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45234-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 April 2020","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":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/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":"81","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":"23","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":"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":"9","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 could not take place due to the COVID-19 pandemic. There was an online event on July 2, 2020.","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)"}}]}}