{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T06:26:51Z","timestamp":1745994411773,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"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_5","type":"book-chapter","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T15:02:28Z","timestamp":1703862148000},"page":"101-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Project and\u00a0Conquer: Fast Quantifier Elimination for\u00a0Checking Petri Net Reachability"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5969-7346","authenticated-orcid":false,"given":"Nicolas","family":"Amat","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6002-2696","authenticated-orcid":false,"given":"Silvano","family":"Dal Zilio","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6457-2740","authenticated-orcid":false,"given":"Didier","family":"Le Botlan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"5_CR1","unstructured":"Amat, N.: Octant (version 1.0): projection of Petri net reachability properties (2023). https:\/\/github.com\/nicolasAmat\/Octant"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-030-76983-3_9","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"N Amat","year":"2021","unstructured":"Amat, N., Berthomieu, B., Dal Zilio, S.: On the combination of polyhedral abstraction and SMT-based model checking for Petri Nets. In: Buchs, D., Carmona, J. (eds.) PETRI NETS 2021. LNCS, vol. 12734, pp. 164\u2013185. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76983-3_9"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Amat, N., Berthomieu, B., Dal Zilio, S.: A polyhedral abstraction for Petri Nets and its application to SMT-based model checking. Fundamenta Informaticae 187(2\u20134) (2022). https:\/\/doi.org\/10.3233\/FI-222134","DOI":"10.3233\/FI-222134"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-84629-9_3","volume-title":"Model Checking Software","author":"N Amat","year":"2021","unstructured":"Amat, N., Dal Zilio, S., Le Botlan, D.: Accelerating the computation of dead and concurrent places using reductions. In: Laarman, A., Sokolova, A. (eds.) SPIN 2021. LNCS, vol. 12864, pp. 45\u201362. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84629-9_3"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Amat, N., Dal Zilio, S., Le Botlan, D.: Leveraging polyhedral reductions for solving Petri net reachability problems. Int. J. Softw. Tools Technol. Transf. 25 (2022). https:\/\/doi.org\/10.1007\/s10009-022-00694-8","DOI":"10.1007\/s10009-022-00694-8"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Amat, N., Dal Zilio, S., Le Botlan, D.: Artifact for VMCAI 2024 Paper \u201cProject and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability\u201d (2023). https:\/\/doi.org\/10.5281\/zenodo.7935153","DOI":"10.5281\/zenodo.7935153"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-031-33620-1_18","volume-title":"PETRI NETS 2023","author":"N Amat","year":"2023","unstructured":"Amat, N., Dal Zilio, S., Le Botlan, D.: Automated polyhedral abstraction proving. In: Gomes, L., Lorenz, R. (eds.) PETRI NETS 2023. LNCS, vol. 13929, pp. 324\u2013345. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33620-1_18"},{"key":"5_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-031-27481-7_25","volume-title":"Formal Methods (FM)","author":"N Amat","year":"2023","unstructured":"Amat, N., Zilio, S.D.: SMPT: a testbed for reachability methods in generalized Petri Nets. In: Gomes, L., Lorenz, R. (eds.) Formal Methods (FM). LNCS, vol. 13929, pp. 324\u2013345. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27481-7_25"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-662-58381-4_9","volume-title":"Transactions on Petri Nets and Other Models of Concurrency XIII","author":"F Kordon","year":"2018","unstructured":"Kordon, F., et al.: MCC\u20192017 \u2013 the seventh model checking contest. In: Koutny, M., Kristensen, L.M., Penczek, W. (eds.) Transactions on Petri Nets and Other Models of Concurrency XIII. LNCS, vol. 11090, pp. 181\u2013209. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-58381-4_9"},{"key":"5_CR10","series-title":"Springer Series in Reliability Engineering","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-319-30599-8_9","volume-title":"Principles of Performance and Reliability Modeling and Evaluation","author":"EG Amparore","year":"2016","unstructured":"Amparore, E.G., Balbo, G., Beccuti, M., Donatelli, S., Franceschinis, G.: 30 years of GreatSPN. In: Fiondella, L., Puliafito, A. (eds.) Principles of Performance and Reliability Modeling and Evaluation. SSRE, pp. 227\u2013254. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30599-8_9"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Aspvall, B., Shiloach, Y.: A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM J. Comput. 9(4) (1980). https:\/\/doi.org\/10.1137\/0209063","DOI":"10.1137\/0209063"},{"key":"5_CR12","unstructured":"Barth, M., Dietsch, D., Heizmann, M., Podelski, A.: Ultimate Eliminator at SMT-COMP (2022)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-47919-2_13","volume-title":"Petri Nets: Central Models and Their Properties","author":"G Berthelot","year":"1987","unstructured":"Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 254, pp. 359\u2013376. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/978-3-540-47919-2_13"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Berthomieu, B., Ribet, P.O., Vernadat, F.: The tool TINA - construction of abstract state spaces for Petri nets and time Petri nets. Int. J. Prod. Res. 42(14) (2004). https:\/\/doi.org\/10.1080\/00207540412331312688","DOI":"10.1080\/00207540412331312688"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-94111-0_4","volume-title":"Model Checking Software","author":"B Berthomieu","year":"2018","unstructured":"Berthomieu, B., Le Botlan, D., Dal Zilio, S.: Petri Net reductions for counting markings. In: Gallardo, M.M., Merino, P. (eds.) SPIN 2018. LNCS, vol. 10869, pp. 65\u201384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94111-0_4"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Berthomieu, B., Le Botlan, D., Dal Zilio, S.: Counting Petri net markings from reduction equations. Int. J. Softw. Tools Technol. Transf. 22 (2019). https:\/\/doi.org\/10.1007\/s10009-019-00519-1","DOI":"10.1007\/s10009-019-00519-1"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"B\u00f8nneland, F.M., Dyhr, J., Jensen, P.G., Johannsen, M., Srba, J.: Stubborn versus structural reductions for Petri nets. J. Log. Algebr. Methods Program. 102 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2018.09.002","DOI":"10.1016\/j.jlamp.2018.09.002"},{"key":"5_CR18","volume-title":"Model Checking","author":"EM Clarke Jr","year":"2018","unstructured":"Clarke, E.M., Jr., Grumberg, O., Kroening, D., Peled, D., Veith, H.: Model Checking. MIT Press, Cambridge (2018)"},{"key":"5_CR19","unstructured":"Cooper, D.C.: Theorem proving in arithmetic without multiplication. Mach. Intell. 7(91\u201399) (1972)"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (1978). https:\/\/doi.org\/10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-642-28756-5_36","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A David","year":"2012","unstructured":"David, A., Jacobsen, L., Jacobsen, M., J\u00f8rgensen, K.Y., M\u00f8ller, M.H., Srba, J.: TAPAAL 2.0: integrated development environment for timed-arc Petri Nets. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 492\u2013497. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28756-5_36"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Dolzmann, A., Sturm, T.: REDLOG: computer algebra meets computer logic. ACM SIGSAM Bull. 31(2) (1997). https:\/\/doi.org\/10.1145\/261320.261324","DOI":"10.1145\/261320.261324"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Feautrier, P., Lengauer, C.: Polyhedron model. Encycl. Parallel Comput. 1 (2011). https:\/\/doi.org\/10.1007\/978-0-387-09766-4_502","DOI":"10.1007\/978-0-387-09766-4_502"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Ganty, P., Raskin, J.F., Van Begin, L.: From many places to few: automatic abstraction refinement for Petri nets. Fundamenta Informaticae 88(3) (2008)","DOI":"10.1007\/978-3-540-73094-1_10"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Haase, C.: A survival guide to Presburger arithmetic. ACM SIGLOG News 5(3) (2018). https:\/\/doi.org\/10.1145\/3242953.3242964","DOI":"10.1145\/3242953.3242964"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-68279-0_3","volume-title":"50 Years of Integer Programming 1958-2008","author":"AJ Hoffman","year":"2010","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958-2008, pp. 49\u201376. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_3"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Huynh, T., Lassez, C., Lassez, J.L.: Practical issues on the projection of polyhedral sets. Ann. Math. Artif. Intell. 6(4) (1992). https:\/\/doi.org\/10.1007\/BF01535523","DOI":"10.1007\/BF01535523"},{"key":"5_CR28","unstructured":"Imbert, J.L.: Fourier\u2019s elimination: which to choose? In: PPCP, vol. 1 (1993)"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/978-3-642-02658-4_52","volume-title":"Computer Aided Verification","author":"B Jeannet","year":"2009","unstructured":"Jeannet, B., Min\u00e9, A.: Apron: a library of numerical abstract domains for static analysis. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 661\u2013667. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_52"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-76983-3_19","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"J Kang","year":"2021","unstructured":"Kang, J., Bai, Y., Jiao, L.: Abstraction-based incremental inductive coverability for Petri Nets. In: Buchs, D., Carmona, J. (eds.) PETRI NETS 2021. LNCS, vol. 12734, pp. 379\u2013398. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76983-3_19"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Khan, Y.I., Konios, A., Guelfi, N.: A survey of Petri nets slicing. ACM Comput. Surv. (CSUR) 51(5) (2018). https:\/\/doi.org\/10.1145\/3241736","DOI":"10.1145\/3241736"},{"key":"5_CR32","unstructured":"Kordon, F., et al.: Complete Results for the 2022 Edition of the Model Checking Contest (2022). http:\/\/mcc.lip6.fr\/2022\/results.php"},{"key":"5_CR33","unstructured":"Kordon, F.: Model SmallOperatingSystem, Model Checking Contest benchmark (2015). https:\/\/mcc.lip6.fr\/2023\/pdf\/SmallOperatingSystem-form.pdf"},{"key":"5_CR34","unstructured":"LAAS-CNRS: Tina Toolbox (2023). http:\/\/projects.laas.fr\/tina"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Lasaruk, A., Sturm, T.: Weak quantifier elimination for the full linear theory of the integers: a uniform generalization of Presburger arithmetic. Appl. Algebra Eng. Commun. Comput. 18 (2007). https:\/\/doi.org\/10.1007\/s00200-007-0053-x","DOI":"10.1007\/s00200-007-0053-x"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-00768-2_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Leroux","year":"2009","unstructured":"Leroux, J., Point, G.: TaPAS: the talence Presburger arithmetic suite. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 182\u2013185. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_18"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-57861-3_8","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"M Llorens","year":"2017","unstructured":"Llorens, M., Oliver, J., Silva, J., Tamarit, S.: An integrated environment for Petri net slicing. In: van der Aalst, W., Best, E. (eds.) PETRI NETS 2017. LNCS, vol. 10258, pp. 112\u2013124. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57861-3_8"},{"key":"5_CR38","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: The octagon abstract domain. Higher-Order Symb. Comput. 19(1) (2006). https:\/\/doi.org\/10.1007\/s10990-006-8609-1","DOI":"10.1007\/s10990-006-8609-1"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-14295-6_51","volume-title":"Computer Aided Verification","author":"D Monniaux","year":"2010","unstructured":"Monniaux, D.: Quantifier elimination by lazy model enumeration. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 585\u2013599. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_51"},{"key":"5_CR40","doi-asserted-by":"publisher","unstructured":"Pugh, W.: The omega test: a fast and practical integer programming algorithm for dependence analysis. In: Proceedings of the ACM\/IEEE Conference on Supercomputing. ACM (1991). https:\/\/doi.org\/10.1145\/125826.125848","DOI":"10.1145\/125826.125848"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-31131-4_15","volume-title":"Application and Theory of Petri Nets","author":"A Rakow","year":"2012","unstructured":"Rakow, A.: Safety slicing Petri Nets. In: Haddad, S., Pomello, L. (eds.) PETRI NETS 2012. LNCS, vol. 7347, pp. 268\u2013287. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31131-4_15"},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-40922-X_8","volume-title":"Formal Methods in Computer-Aided Design","author":"M Sheeran","year":"2000","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking safety properties using induction and a SAT-solver. In: Hunt, W.A., Johnson, S.D. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 127\u2013144. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-40922-X_8"},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-662-46681-0_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Thierry-Mieg","year":"2015","unstructured":"Thierry-Mieg, Y.: Symbolic model-checking using ITS-tools. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 231\u2013237. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_20"},{"key":"5_CR44","doi-asserted-by":"publisher","unstructured":"Thierry-Mieg, Y.: Symbolic and structural model-checking. Fundamenta Informaticae 183(3\u20134) (2021). https:\/\/doi.org\/10.3233\/FI-2021-2090","DOI":"10.3233\/FI-2021-2090"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-15582-6_49","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"S Verdoolaege","year":"2010","unstructured":"Verdoolaege, S.: isl: an integer set library for the polyhedral model. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 299\u2013302. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15582-6_49"},{"key":"5_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-91268-4_18","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"K Wolf","year":"2018","unstructured":"Wolf, K.: Petri Net model checking with LoLA 2. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 351\u2013362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_18"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T00:10:42Z","timestamp":1704240642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50524-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"ISBN":["9783031505232","9783031505249"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50524-9_5","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)"}}]}}