{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:24:04Z","timestamp":1742912644507,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031505232"},{"type":"electronic","value":"9783031505249"}],"license":[{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"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-50524-9_14","type":"book-chapter","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T15:02:28Z","timestamp":1703862148000},"page":"303-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Verification of\u00a0the\u00a0Correctness of\u00a0a\u00a0Subgraph Construction Algorithm"],"prefix":"10.1007","author":[{"given":"Lucas","family":"B\u00f6ltz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viorica","family":"Sofronie-Stokkermans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannes","family":"Frey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Abdulaziz, M., Mehlhorn, K., Nipkow, T.: Trustworthy graph algorithms (invited talk). In: Rossmanith, P., Heggernes, P., Katoen, J. (eds.) 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. LIPIcs, vol.\u00a0138, pp. 1:1\u20131:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.1","key":"14_CR1","DOI":"10.4230\/LIPIcs.MFCS.2019.1"},{"doi-asserted-by":"publisher","unstructured":"Barri\u00e9re, L., Fraigniaud, P., Narayanan, L.: Robust position-based routing in wireless ad hoc networks with unstable transmission ranges. In: Proceedings of the 5th ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M 01), New York, New York, USA, pp. 19\u201327. ACM Press (2001). https:\/\/doi.org\/10.1145\/381448.381451","key":"14_CR2","DOI":"10.1145\/381448.381451"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10817-016-9392-2","volume":"58","author":"M Beeson","year":"2017","unstructured":"Beeson, M., Wos, L.: Finding proofs in Tarskian geometry. J. Autom. Reason. 58(1), 181\u2013207 (2017). https:\/\/doi.org\/10.1007\/s10817-016-9392-2","journal-title":"J. Autom. Reason."},{"issue":"5","key":"14_CR4","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s11276-005-3513-x","volume":"11","author":"C Bettstetter","year":"2005","unstructured":"Bettstetter, C., Hartmann, C.: Connectivity of wireless multihop networks in a shadow fading environment. Wireless Netw. 11(5), 571\u2013579 (2005). https:\/\/doi.org\/10.1007\/s11276-005-3513-x","journal-title":"Wireless Netw."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-17601-3_4","volume-title":"Engineering Trustworthy Software Systems","author":"N Bj\u00f8rner","year":"2019","unstructured":"Bj\u00f8rner, N., de Moura, L., Nachmanson, L., Wintersteiger, C.M.: Programming Z3. In: Bowen, J.P., Liu, Z., Zhang, Z. (eds.) SETSS 2018. LNCS, vol. 11430, pp. 148\u2013201. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17601-3_4"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-030-63882-5_2","volume-title":"Formal Methods: Foundations and Applications","author":"N Bj\u00f8rner","year":"2020","unstructured":"Bj\u00f8rner, N., Nachmanson, L.: Navigating the universe of Z3 theory solvers. In: Carvalho, G., Stolz, V. (eds.) SBMF 2020. LNCS, vol. 12475, pp. 8\u201324. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63882-5_2"},{"doi-asserted-by":"publisher","unstructured":"B\u00f6hmer, S., Schneider, D., Frey, H.: Stochastic modeling and simulation for redundancy and coexistence in graphs resulting from log-normal shadowing. In: Proceedings of the 22nd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems - MSWIM 2019, New York, New York, USA, pp. 173\u2013182. ACM Press (2019). https:\/\/doi.org\/10.1145\/3345768.3355933","key":"14_CR7","DOI":"10.1145\/3345768.3355933"},{"doi-asserted-by":"crossref","unstructured":"B\u00f6ltz, L., Becker, B., Frey, H.: Local construction of connected plane subgraphs in graphs satisfying redundancy and coexistence. In: XI Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), pp. 1\u201310 (2021)","key":"14_CR8","DOI":"10.1016\/j.procs.2021.11.016"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-34405-4_4","volume-title":"Algorithms for Sensor Systems","author":"L B\u00f6ltz","year":"2019","unstructured":"B\u00f6ltz, L., Frey, H.: Existence of connected intersection-free subgraphs in graphs with redundancy and coexistence property. In: Dressler, F., Scheideler, C. (eds.) ALGOSENSORS 2019. LNCS, vol. 11931, pp. 63\u201378. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34405-4_4"},{"doi-asserted-by":"crossref","unstructured":"B\u00f6ltz, L., Sofronie-Stokkermans, V., Frey, H.: On the verification of the correctness of a subgraph construction algorithm (extended version), ArXiv, https:\/\/doi.org\/10.48550\/arXiv.2311.17860 (2023)","key":"14_CR10","DOI":"10.1007\/978-3-031-50524-9_14"},{"unstructured":"B\u00f6ltz, L., Sofronie-Stokkermans, V., Frey, H.: Tests for the verification of the CP-algorithm (2023). https:\/\/github.com\/sofronie\/tests-vmcai-2024.git","key":"14_CR11"},{"issue":"7","key":"14_CR12","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1007\/s11276-015-1107-9","volume":"22","author":"T Chen","year":"2016","unstructured":"Chen, T., Chen, J., Wu, C.: Distributed object tracking using moving trajectories in wireless sensor networks. Wirel. Networks 22(7), 2415\u20132437 (2016)","journal-title":"Wirel. Networks"},{"doi-asserted-by":"publisher","unstructured":"Courcelle, B.: On the expression of monadic second-order graph properties without quantifications over sets of edges (extended abstract). In: Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS 1990), Philadelphia, Pennsylvania, USA, June 4\u20137, 1990, pp. 190\u2013196. IEEE Computer Society (1990). https:\/\/doi.org\/10.1109\/LICS.1990.113745","key":"14_CR13","DOI":"10.1109\/LICS.1990.113745"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0166-218X(95)00006-D","volume":"63","author":"B Courcelle","year":"1995","unstructured":"Courcelle, B.: The monadic second-order logic of graphs VI: on several representations of graphs by relational structures. Discret. Appl. Math. 63(2), 199\u2013200 (1995). https:\/\/doi.org\/10.1016\/0166-218X(95)00006-D","journal-title":"Discret. Appl. Math."},{"doi-asserted-by":"publisher","unstructured":"Courcelle, B.: The monadic second-order logic of graphs XVI: canonical graph decompositions. Log. Methods Comput. Sci. 2(2) (2006). https:\/\/doi.org\/10.2168\/LMCS-2(2:2)2006","key":"14_CR15","DOI":"10.2168\/LMCS-2(2:2)2006"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-00982-2_2","volume-title":"Language and Automata Theory and Applications","author":"B Courcelle","year":"2009","unstructured":"Courcelle, B.: Monadic second-order logic for graphs: algorithmic and language theoretical applications. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 19\u201322. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00982-2_2"},{"doi-asserted-by":"crossref","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.). Undergraduate texts in mathematics, Springer (1997)","key":"14_CR17","DOI":"10.1007\/978-1-4757-2693-0_8"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10817-020-09543-2","volume":"64","author":"C Doczkal","year":"2020","unstructured":"Doczkal, C., Pous, D.: Graph theory in Coq: minors, treewidth, and isomorphisms. J. Autom. Reason. 64, 795\u2013825 (2020)","journal-title":"J. Autom. Reason."},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1023\/A:1006031329384","volume":"21","author":"A Dolzmann","year":"1998","unstructured":"Dolzmann, A., Sturm, T., Weispfenning, V.: A new approach for automatic theorem proving in real geometry. J. Autom. Reason. 21(3), 357\u2013380 (1998). https:\/\/doi.org\/10.1023\/A:1006031329384","journal-title":"J. Autom. Reason."},{"doi-asserted-by":"crossref","unstructured":"Frey, H., Simplot-Ryl, D.: Localized topology control algorithms for ad hoc and sensor networks. In: Nayak, A., Stojmenovic, I. (eds.) Handbook of Applied Algorithms, chap.\u00a015, pp. 439\u2013464. Wiley, Hoboken (2007)","key":"14_CR20","DOI":"10.1002\/9780470175668.ch15"},{"issue":"9","key":"14_CR21","doi-asserted-by":"publisher","first-page":"1224","DOI":"10.1109\/TC.2010.107","volume":"59","author":"H Frey","year":"2010","unstructured":"Frey, H., Stojmenovic, I.: On delivery guarantees and worst-case forwarding bounds of elementary face routing components in ad hoc and sensor networks. IEEE Trans. Comput. 59(9), 1224\u20131238 (2010). https:\/\/doi.org\/10.1109\/TC.2010.107","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"publisher","unstructured":"Heckel, R., Lambers, L., Saadat, M.G.: Analysis of graph transformation systems: Native vs translation-based techniques. In: Electronic Proceedings in Theoretical Computer Science, vol. 309, pp. 1\u201322 (2019). https:\/\/doi.org\/10.4204\/eptcs.309.1","key":"14_CR22","DOI":"10.4204\/eptcs.309.1"},{"unstructured":"Hilbert, D.: The Foundations of Geometry. 2nd ed. Chicago: Open Court. (1980 (1899))","key":"14_CR23"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-78800-3_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Ihlemann","year":"2008","unstructured":"Ihlemann, C., Jacobs, S., Sofronie-Stokkermans, V.: On local reasoning in verification. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 265\u2013281. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_19"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-02959-2_9","volume-title":"Automated Deduction \u2013 CADE-22","author":"C Ihlemann","year":"2009","unstructured":"Ihlemann, C., Sofronie-Stokkermans, V.: System description: H-PILoT. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 131\u2013139. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02959-2_9"},{"unstructured":"Karamete, B.K., Adhami, L., Glaser, E.: A fixed storage distributed graph database hybrid with at-scale OLAP expression and I\/O support of a relational DB: kinetica-graph. CoRR abs\/2201.02136 (2022). https:\/\/arxiv.org\/abs\/2201.02136","key":"14_CR26"},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: ACM DIALM-POMC Joint Workshop on Foundations of Mobile Computing, pp. 69\u201378. San Diego (2003)","key":"14_CR27","DOI":"10.1145\/941079.941089"},{"doi-asserted-by":"crossref","unstructured":"Mathews, E.: Planarization of geographic cluster-based overlay graphs in realistic wireless networks. In: 2012 Ninth International Conference on Information Technology - New Generations, pp. 95\u2013101. IEEE (2012)","key":"14_CR28","DOI":"10.1109\/ITNG.2012.22"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-25959-3_25","volume-title":"Distributed Computing and Networking","author":"E Mathews","year":"2012","unstructured":"Mathews, E., Frey, H.: A localized link removal and addition based planarization algorithm. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds.) ICDCN 2012. LNCS, vol. 7129, pp. 337\u2013350. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25959-3_25"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/11513988_47","volume-title":"Computer Aided Verification","author":"S McPeak","year":"2005","unstructured":"McPeak, S., Necula, G.C.: Data structure specifications via local equality axioms. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 476\u2013490. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11513988_47"},{"issue":"6","key":"14_CR31","doi-asserted-by":"publisher","first-page":"2251","DOI":"10.1007\/s11276-017-1466-5","volume":"24","author":"M Mirzaie","year":"2018","unstructured":"Mirzaie, M., Mazinani, S.M.: MCFL: an energy efficient multi-clustering algorithm using fuzzy logic in wireless sensor network. Wirel. Networks 24(6), 2251\u20132266 (2018)","journal-title":"Wirel. Networks"},{"key":"14_CR32","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"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-40509-4_16","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"F Neumann","year":"2016","unstructured":"Neumann, F., Vivas Estevao, D., Ockenfeld, F., Radak, J., Frey, H.: Short paper: structural network properties for local planarization of wireless sensor networks. In: Mitton, N., Loscri, V., Mouradian, A. (eds.) ADHOC-NOW 2016. LNCS, vol. 9724, pp. 229\u2013233. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40509-4_16"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-030-29436-6_23","volume-title":"Automated Deduction \u2013 CADE 27","author":"D Peuter","year":"2019","unstructured":"Peuter, D., Sofronie-Stokkermans, V.: On invariant synthesis for parametric systems. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 385\u2013405. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29436-6_23"},{"doi-asserted-by":"crossref","unstructured":"Philip, S.J., Ghosh, J., Ngo, H.Q., Qiao, C.: Routing on overlay graphs in mobile ad hoc networks. In: Proceedings of the IEEE Global Communications Conference, Exhibition & Industry Forum (GLOBECOM\u201906) (2006)","key":"14_CR35","DOI":"10.1109\/GLOCOM.2006.969"},{"doi-asserted-by":"publisher","unstructured":"Piskac, R., de\u00a0Moura, L.M., Bj\u00f8rner, N.S.: Deciding effectively propositional logic using DPLL and substitution sets. J. Autom. Reason. 44(4), 401\u2013424 (2010). https:\/\/doi.org\/10.1007\/s10817-009-9161-6","key":"14_CR36","DOI":"10.1007\/s10817-009-9161-6"},{"key":"14_CR37","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/11532231_16","volume-title":"Automated Deduction \u2013 CADE-20","author":"V Sofronie-Stokkermans","year":"2005","unstructured":"Sofronie-Stokkermans, V.: Hierarchic reasoning in local theory extensions. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 219\u2013234. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11532231_16"},{"key":"14_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/BFb0022720","volume-title":"Automated Deduction in Geometry","author":"T Sturm","year":"1997","unstructured":"Sturm, T., Weispfenning, V.: Computational geometry problems in REDLOG. In: Wang, D. (ed.) ADG 1996. LNCS, vol. 1360, pp. 58\u201386. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0022720"},{"issue":"2","key":"14_CR39","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2307\/421089","volume":"5","author":"A Tarski","year":"1999","unstructured":"Tarski, A., Givant, S.: Tarski\u2019s system of geometry. Bull. Symb. Log. 5(2), 175\u2013214 (1999). https:\/\/doi.org\/10.2307\/421089","journal-title":"Bull. Symb. Log."},{"key":"14_CR40","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02959-2_10","volume-title":"Automated Deduction \u2013 CADE-22","author":"C Weidenbach","year":"2009","unstructured":"Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: SPASS Version 3.5. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 140\u2013145. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02959-2_10"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50524-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T00:12:41Z","timestamp":1704240761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50524-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"ISBN":["9783031505232","9783031505249"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50524-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,30]]},"assertion":[{"value":"30 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl24.sigplan.org\/home\/VMCAI-2024","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":"74","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":"30","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":"41% - 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":"6","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)"}}]}}