{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:37:05Z","timestamp":1742913425487,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030451899"},{"type":"electronic","value":"9783030451905"}],"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-45190-5_14","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T09:03:02Z","timestamp":1587114182000},"page":"247-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Automated Verification of Parallel Nested DFS"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5244-2519","authenticated-orcid":false,"given":"Wytse","family":"Oortwijn","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4467-072X","authenticated-orcid":false,"given":"Marieke","family":"Huisman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6590-6220","authenticated-orcid":false,"given":"Sebastiaan J. C.","family":"Joosten","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4305-0625","authenticated-orcid":false,"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"A.\u00a0Amighi, S.\u00a0Blom, and M.\u00a0Huisman. Resource Protection Using Atomics - Patterns and Verification. In APLAS, pages 255\u2013274, 2014. \nhttps:\/\/doi.org\/10.1007\/978-3-319-12736-1_14\n\n.","DOI":"10.1007\/978-3-319-12736-1_14"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"J.\u00a0Barnat, V.\u00a0Bloemen, A.\u00a0Duret-Lutz, A.\u00a0Laarman, L.\u00a0Petrucci, J.\u00a0van\u00a0de Pol,and E.\u00a0Renault. Parallel Model Checking Algorithms for Linear-Time Temporal Logic. In Handbook of Parallel Constraint Reasoning, pages 457\u2013507. Springer, 2018. \nhttps:\/\/doi.org\/10.1007\/978-3-319-63516-3_12\n\n.","DOI":"10.1007\/978-3-319-63516-3_12"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"J.\u00a0Barnat and I.\u00a0Cern\u00e1. Distributed breadth-first search LTL model checking. Formal Methods in System Design, 29(2):117\u2013134, 2006. \nhttps:\/\/doi.org\/10.1007\/s10703-006-0009-y\n\n.","DOI":"10.1007\/s10703-006-0009-y"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"V.\u00a0Bloemen, A.\u00a0Laarman, and J.\u00a0van\u00a0de Pol. Multi-core On-the-fly SCC Decomposition. In PPoPP, pages 1\u201312. ACM, 2016. \nhttps:\/\/doi.org\/10.1145\/2851141.2851161\n\n.","DOI":"10.1145\/2851141.2851161"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"S.\u00a0Blom, S.\u00a0Darabi, and M.\u00a0Huisman. Verification of Loop Parallelisations. In FASE, pages 202\u2013217. Springer, 2015. \nhttps:\/\/doi.org\/10.1007\/978-3-662-46675-9_14\n\n.","DOI":"10.1007\/978-3-662-46675-9_14"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"S.\u00a0Blom, S.\u00a0Darabi, M.\u00a0Huisman, and W.\u00a0Oortwijn. The VerCors Tool Set: Verification of Parallel and Concurrent Software. In iFM, LNCS, pages 102\u2013110. Springer, 2017. \nhttps:\/\/doi.org\/10.1007\/978-3-319-66845-1_7\n\n.","DOI":"10.1007\/978-3-319-66845-1_7"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"J.\u00a0Boyland. Checking Interference with Fractional Permissions. In SAS, LNCS, pages 55\u201372. Springer, 2003. \nhttps:\/\/doi.org\/10.1007\/3-540-44898-5_4\n\n.","DOI":"10.1007\/3-540-44898-5_4"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"S.\u00a0Brookes. A Semantics for Concurrent Separation Logic. Theoretical Computer Science, 375(1\u20133):227\u2013270, 2007. \nhttps:\/\/doi.org\/10.1016\/j.tcs.2006.12.034\n\n.","DOI":"10.1016\/j.tcs.2006.12.034"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"J.\u00a0Brunner and P.\u00a0Lammich. Formal Verification of an Executable LTL Model Checker with Partial Order Reduction. Journal of Automated Reasoning, 60(1):3\u201321, 2018. \nhttps:\/\/doi.org\/10.1007\/s10817-017-9418-4\n\n.","DOI":"10.1007\/s10817-017-9418-4"},{"key":"14_CR10","unstructured":"R.\u00a0Chen, C.\u00a0Cohen, J.\u00a0L\u00e9vy, S.\u00a0Merz, and L.\u00a0Th\u00e9ry. Formal Proofs of Tarjan\u2019s Algorithm in Why3, Coq, and Isabelle. CoRR, 2018. URL: \nhttp:\/\/arxiv.org\/abs\/1810.11979\n\n."},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Y.\u00a0Cheon, G.\u00a0Leavens, M.\u00a0Sitaraman, and S.\u00a0Edwards. Model Variables: Cleanly Supporting Abstraction in Design by Contract: Research Articles. Software\u2013Practice and Experience, 35(6):583\u2013599, 2005. \nhttps:\/\/doi.org\/10.1002\/spe.v35:6\n\n.","DOI":"10.1002\/spe.v35:6"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"E.\u00a0Clarke, T.\u00a0Henzinger, H.\u00a0Veith, and R.\u00a0Bloem, editors. Handbook of Model Checking. Springer, 2018. \nhttps:\/\/doi.org\/10.1007\/978-3-319-10575-8\n\n.","DOI":"10.1007\/978-3-319-10575-8"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"C.\u00a0Courcoubetis, M.\u00a0Vardi, P.\u00a0Wolper, and M.\u00a0Yannakakis. Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design, 1(2\u20133):275\u2013288, 1992. \nhttps:\/\/doi.org\/10.1007\/BF00121128\n\n.","DOI":"10.1007\/BF00121128"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"S.\u00a0Evangelista, A.\u00a0Laarman, L.\u00a0Petrucci, and J.\u00a0van\u00a0de Pol. Improved Multi-Core Nested Depth-First Search. In ATVA, LNCS, pages 269\u2013283. Springer, 2012. \nhttps:\/\/doi.org\/10.1007\/978-3-642-33386-6_22\n\n.","DOI":"10.1007\/978-3-642-33386-6_22"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"S.\u00a0Evangelista, L.\u00a0Petrucci, and S.\u00a0Youcef. Parallel Nested Depth-First Searches for LTL Model Checking. In ATVA, LNCS, pages 381\u2013396. Springer, 2011. \nhttps:\/\/doi.org\/10.1007\/978-3-642-24372-1_27\n\n.","DOI":"10.1007\/978-3-642-24372-1_27"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"A.\u00a0Griggio, M.\u00a0Roveri, and S.\u00a0Tonetta. Certifying Proofs for LTL Model Checking. In FMCAD, pages 225\u2013233, 2018. \nhttps:\/\/doi.org\/10.23919\/FMCAD.2018.8603022\n\n.","DOI":"10.23919\/FMCAD.2018.8603022"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"G.\u00a0Holzmann. The Model Checker SPIN. IEEE Transactions on Software Engineering, 23(5):279\u2013295,1997.\nhttp:\/\/dx.doi.org\/10.1109\/32.588521\n\n\nhttps:\/\/doi.org\/10.1109\/32.588521\n\n.","DOI":"10.1109\/32.588521"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"G.\u00a0Holzmann, R.\u00a0Joshi, and A.\u00a0Groce. Swarm Verification Techniques. IEEE Transactions on Software Engineering, 37(6):845\u2013857,2011. \nhttps:\/\/doi.org\/10.1109\/TSE.2010.110\n\n.","DOI":"10.1109\/TSE.2010.110"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"G.\u00a0Holzmann, D.\u00a0Peled, and M.\u00a0Yannakakis. On Nested Depth First Search. In The Spin Verification System, volume\u00a032 of DIMACS,pages 23\u201332, 1996. \nhttps:\/\/doi.org\/10.1090\/dimacs\/032\/03\n\n.","DOI":"10.1090\/dimacs\/032\/03"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"B.\u00a0Jacobs, J.\u00a0Smans, P.\u00a0Philippaerts, F.\u00a0Vogels, W.\u00a0Penninckx, and F.\u00a0Piessens. VeriFast: A powerful, sound, predictable, fast verifier for C and Java. In NFM, 2011. \nhttps:\/\/doi.org\/10.1007\/978-3-642-20398-5_4\n\n.","DOI":"10.1007\/978-3-642-20398-5_4"},{"key":"14_CR21","unstructured":"B.\u00a0Jacobs, J.\u00a0Smans, and F.\u00a0Piessens. VeriFast: Imperative Programs as Proofs. In VS-Tools workshop at VSTTE, 2010."},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"S.\u00a0Joosten, W.\u00a0Oortwijn, M.\u00a0Safari, and M.\u00a0Huisman. An Exercise in Verifying Sequential Programs with VerCors. In FTfJP, pages 40\u201345, 2018. \nhttps:\/\/doi.org\/10.1145\/3236454.3236479\n\n.","DOI":"10.1145\/3236454.3236479"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"G.\u00a0Kant, A.\u00a0Laarman, J.\u00a0Meijer, J.\u00a0van\u00a0de Pol, S.\u00a0Blom, and T.\u00a0van Dijk. LTSmin: High-Performance Language-Independent Model Checking. In TACAS, pages 692\u2013707. Springer, 2015. \nhttps:\/\/doi.org\/10.1007\/978-3-662-46681-0_61\n\n.","DOI":"10.1007\/978-3-662-46681-0_61"},{"key":"14_CR24","unstructured":"J.\u00a0K\u00fcbler. Comparing Deductive Program Verification of Graph Data-Structures. Bachelor\u2019s thesis, KIT, 2018."},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"A.\u00a0Laarman, R.\u00a0Langerak, J.\u00a0van\u00a0de Pol, M.\u00a0Weber, and A.\u00a0Wijs. Multi-core Nested Depth-First Search. In ATVA, LNCS, pages 321\u2013335. Springer, 2011. \nhttps:\/\/doi.org\/10.1007\/978-3-642-24372-1_23\n\n.","DOI":"10.1007\/978-3-642-24372-1_23"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"A.\u00a0Laarman, M.\u00a0Olesen, A.\u00a0Dalsgaard, K.\u00a0Larsen, and J.\u00a0van\u00a0de Pol. Multi-core Emptiness Checking of Timed B\u00fcchi Automata Using Inclusion Abstraction. In CAV, pages 968\u2013983. Springer, 2013. \nhttps:\/\/doi.org\/10.1007\/978-3-642-39799-8_69\n\n.","DOI":"10.1007\/978-3-642-39799-8_69"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"P.\u00a0Lammich and R.\u00a0Neumann. A Framework for Verifying Depth-First Search Algorithms. In CPP, pages 137\u2013146. ACM, 2015. \nhttps:\/\/doi.org\/10.1145\/2676724.2693165\n\n.","DOI":"10.1145\/2676724.2693165"},{"key":"14_CR28","unstructured":"P.\u00a0Lammich and S.\u00a0Wimmer. IMP2 \u2013 Simple Program Verification in Isabelle\/HOL. Archive of Formal Proofs, 2019. \nhttp:\/\/isa-afp.org\/entries\/IMP2.html\n\n, Formal proof development."},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"K.R.M. Leino. Data groups: Specifying the modification of extended state. In OOPSLA, pages 144\u2013153. ACM, 1998. \nhttps:\/\/doi.org\/10.1145\/286942.286953\n\n.","DOI":"10.1145\/286942.286953"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"K.R.M. Leino. Dafny: An Automatic Program Verifier for Functional Correctness. In LPAR, pages 348\u2013370. Springer, 2010. \nhttps:\/\/doi.org\/10.1007\/978-3-642-17511-4_20\n\n.","DOI":"10.1007\/978-3-642-17511-4_20"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"L.\u00a0de Moura and N.\u00a0Bj\u00f8rner.Z3: An Efficient SMT Solver. In TACAS, pages 337\u2013340, 2008. \nhttps:\/\/doi.org\/10.1007\/978-3-540-78800-3_24\n\n.","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"P.\u00a0M\u00fcller, M.\u00a0Schwerhoff, and A.\u00a0Summers. Viper: A Verification Infrastructure for Permission-Based Reasoning. In VMCAI, pages 41\u201362. Springer, 2016. \nhttps:\/\/doi.org\/10.1007\/978-3-662-49122-5_2\n\n.","DOI":"10.1007\/978-3-662-49122-5_2"},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"K.\u00a0Namjoshi. Certifying Model Checkers. In CAV, LNCS, pages 2\u201313. Springer, 2001. \nhttps:\/\/doi.org\/10.1007\/3-540-44585-4_2\n\n.","DOI":"10.1007\/3-540-44585-4_2"},{"key":"14_CR34","doi-asserted-by":"publisher","unstructured":"P.\u00a0O\u2019Hearn. Resources, Concurrency and Local Reasoning. Theoretical Computer Science, 375(1\u20133):271\u2013307, 2007. \nhttps:\/\/doi.org\/10.1016\/j.tcs.2006.12.035\n\n.","DOI":"10.1016\/j.tcs.2006.12.035"},{"key":"14_CR35","doi-asserted-by":"publisher","unstructured":"W.\u00a0Oortwijn, M.\u00a0Huisman, S.\u00a0Joosten, and J.\u00a0van\u00a0de Pol. Artifact for Automated Verification of Parallel Nested DFS, TACAS2020.4TU.ResearchData. \nhttps:\/\/doi.org\/10.4121\/uuid:36c00955-5574-44d9-9b26-340f7a1ea03b\n\n.","DOI":"10.4121\/uuid:36c00955-5574-44d9-9b26-340f7a1ea03b"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"A.\u00a0Pnueli. The Temporal Logic of Programs. In FOCS, pages 46\u201357. IEEE Computer Society, 1977. \nhttps:\/\/doi.org\/10.1109\/SFCS.1977.32\n\n.","DOI":"10.1109\/SFCS.1977.32"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"J.\u00a0van\u00a0de Pol. Automated Verification of Nested DFS. In FMICS, LNCS, pages 181\u2013197. Springer, 2015. \nhttps:\/\/doi.org\/10.1007\/978-3-319-19458-5_12\n\n.","DOI":"10.1007\/978-3-319-19458-5_12"},{"key":"14_CR38","doi-asserted-by":"publisher","unstructured":"A.\u00a0Raad, A.\u00a0Hobor, J.\u00a0Villard, and P.\u00a0Gardner. Verifying Concurrent Graph Algorithms. In Programming Languages and Systems, pages 314\u2013334. Springer,2016. \nhttps:\/\/doi.org\/10.1007\/978-3-319-47958-3_17\n\n.","DOI":"10.1007\/978-3-319-47958-3_17"},{"key":"14_CR39","doi-asserted-by":"publisher","unstructured":"J.\u00a0Reif. Depth-First Search is Inherently Sequential. Information Processing Letters, 20(5):229\u2013234, 1985. \nhttps:\/\/doi.org\/10.1016\/0020-0190(85)90024-9\n\n.","DOI":"10.1016\/0020-0190(85)90024-9"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"E.\u00a0Renault, A.\u00a0Duret-Lutz, F.\u00a0Kordon, and D.\u00a0Poitrenaud. Variations on Parallel Explicit Emptiness Checks for Generalized B\u00fcchi Automata. STTT, 19(6):653\u2013673, 2017. \nhttps:\/\/doi.org\/10.1007\/s10009-016-0422-5\n\n.","DOI":"10.1007\/s10009-016-0422-5"},{"key":"14_CR41","doi-asserted-by":"publisher","unstructured":"S.\u00a0Schwoon and J.\u00a0Esparza. A Note on On-the-Fly Verification Algorithms. In TACAS, LNCS, pages 174\u2013190. Springer, 2005. \nhttps:\/\/doi.org\/10.1007\/978-3-540-31980-1_12\n\n.","DOI":"10.1007\/978-3-540-31980-1_12"},{"key":"14_CR42","doi-asserted-by":"publisher","unstructured":"I.\u00a0Sergey, A.\u00a0Nanevski, and A.\u00a0Banerjee. Mechanized Verification of Fine-Grained Concurrent Programs. In PLDI, pages 77\u201387. ACM, 2015. \nhttps:\/\/doi.org\/10.1145\/2813885.2737964\n\n.","DOI":"10.1145\/2813885.2737964"},{"key":"14_CR43","doi-asserted-by":"publisher","unstructured":"C.\u00a0Sprenger. A Verified Model Checker for the Modal $$\\rm \\mu $$-calculusin Coq. In TACAS, LNCS, pages 167\u2013183. Springer, 1998. \nhttps:\/\/doi.org\/10.1007\/bfb0054171\n\n.","DOI":"10.1007\/bfb0054171"},{"key":"14_CR44","doi-asserted-by":"publisher","unstructured":"V.\u00a0Vafeiadis. Concurrent Separation Logic and Operational Semantics. In MFPS, ENTCS, pages 335\u2013351, 2011. \nhttps:\/\/doi.org\/10.1016\/j.entcs.2011.09.029\n\n.","DOI":"10.1016\/j.entcs.2011.09.029"},{"key":"14_CR45","doi-asserted-by":"publisher","unstructured":"M.\u00a0Vardi and P.\u00a0Wolper. Automata-Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences, 32(2):183\u2013221, 1986. \nhttps:\/\/doi.org\/10.1016\/0022-0000(86)90026-7\n\n.","DOI":"10.1016\/0022-0000(86)90026-7"},{"key":"14_CR46","unstructured":"Why3 gallery of formally verified programs. \nhttp:\/\/toccata.lri.fr\/gallery\/graph.en.html\n\n(accessed on February 2020)."},{"key":"14_CR47","doi-asserted-by":"publisher","unstructured":"S.\u00a0Wimmer and P.\u00a0Lammich. Verified Model Checking of Timed Automata. In TACAS, LNCS, pages 61\u201378. Springer, 2018. \nhttps:\/\/doi.org\/10.1007\/978-3-319-89960-2_4\n\n.","DOI":"10.1007\/978-3-319-89960-2_4"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45190-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T13:10:18Z","timestamp":1597929018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45190-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030451899","9783030451905"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45190-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","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":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/tacas","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":"155","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":"40","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":"8","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":"14","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)"}}]}}