{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T17:17:45Z","timestamp":1765041465907,"version":"3.40.5"},"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_6","type":"book-chapter","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T15:02:28Z","timestamp":1703862148000},"page":"124-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Verification of\u00a0Disjunctive Timed Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8473-9555","authenticated-orcid":false,"given":"\u00c9tienne","family":"Andr\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6117-318X","authenticated-orcid":false,"given":"Paul","family":"Eichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9051-4050","authenticated-orcid":false,"given":"Swen","family":"Jacobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6859-4106","authenticated-orcid":false,"given":"Shyam Lal","family":"Karra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10009-016-0424-3","volume":"18","author":"PA Abdulla","year":"2016","unstructured":"Abdulla, P.A., Delzanno, G.: Parameterized verification. Int. J. Softw. Tools Technol. Transfer 18(5), 469\u2013473 (2016). https:\/\/doi.org\/10.1007\/s10009-016-0424-3","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2015.07.048","volume":"612","author":"PA Abdulla","year":"2016","unstructured":"Abdulla, P.A., Delzanno, G., Rezine, O., Sangnier, A., Traverso, R.: Parameterized verification of time-sensitive models of ad hoc network protocols. Theoret. Comput. Sci. 612, 1\u201322 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.07.048","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Deneux, J., Mahata, P.: Multi-clock timed networks. In: LiCS, pp. 345\u2013354. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/LICS.2004.1319629","DOI":"10.1109\/LICS.2004.1319629"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0304-3975(01)00330-9","volume":"290","author":"PA Abdulla","year":"2003","unstructured":"Abdulla, P.A., Jonsson, B.: Model checking of systems with many identical timed processes. Theoret. Comput. Sci. 290(1), 241\u2013264 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(01)00330-9","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-319-10575-8_21","volume-title":"Handbook of Model Checking","author":"PA Abdulla","year":"2018","unstructured":"Abdulla, P.A., Sistla, A.P., Talupur, M.: Model checking parameterized systems. In: Handbook of Model Checking, pp. 685\u2013725. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_21"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2016.12.020","volume":"665","author":"OI Al-Bataineh","year":"2017","unstructured":"Al-Bataineh, O.I., Reynolds, M., French, T.: Finding minimum and maximum termination time of timed automata models with cyclic behaviour. Theoret. Comput. Sci. 665, 87\u2013104 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2016.12.020","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.tcs.2003.10.038","volume":"318","author":"R Alur","year":"2004","unstructured":"Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. Theoret. Comput. Sci. 318(3), 297\u2013322 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.10.038","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00446-017-0302-6","volume":"31","author":"B Aminof","year":"2018","unstructured":"Aminof, B., Kotek, T., Rubin, S., Spegni, F., Veith, H.: Parameterized model checking of rendezvous systems. Distrib. Comput. 31(3), 187\u2013222 (2018). https:\/\/doi.org\/10.1007\/s00446-017-0302-6","journal-title":"Distrib. Comput."},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-030-11245-5_23","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"\u00c9 Andr\u00e9","year":"2019","unstructured":"Andr\u00e9, \u00c9., Delahaye, B., Fournier, P., Lime, D.: Parametric timed broadcast protocols. In: Enea, C., Piskac, R. (eds.) VMCAI 2019. LNCS, vol. 11388, pp. 491\u2013512. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11245-5_23"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Eichler, P., Jacobs, S., Karra, S.L.: Parameterized verification of disjunctive timed networks (2023). https:\/\/doi.org\/10.48550\/arXiv.2305.07295","DOI":"10.48550\/arXiv.2305.07295"},{"issue":"6","key":"6_CR12","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","volume":"22","author":"KR Apt","year":"1986","unstructured":"Apt, K.R., Kozen, D.: Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett. 22(6), 307\u2013309 (1986). https:\/\/doi.org\/10.1016\/0020-0190(86)90071-2","journal-title":"Inf. Process. Lett."},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-662-49122-5_23","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S Au\u00dferlechner","year":"2016","unstructured":"Au\u00dferlechner, S., Jacobs, S., Khalimov, A.: Tight cutoffs for guarded protocols with fairness. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 476\u2013494. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49122-5_23"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s10009-005-0190-0","volume":"8","author":"G Behrmann","year":"2006","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Pel\u00e1nek, R.: Lower and upper bounds in zone-based abstractions of timed automata. Int. J. Softw. Tools Technol. Transfer 8(3), 204\u2013215 (2006). https:\/\/doi.org\/10.1007\/s10009-005-0190-0","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45319-9_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J.: Efficient guiding towards cost-optimality in UPPAAL. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 174\u2013188. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_13"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27755-2_3"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Bloem, R., et al.: Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, San Rafael (2015). https:\/\/doi.org\/10.2200\/S00658ED1V01Y201508DCT013","DOI":"10.2200\/S00658ED1V01Y201508DCT013"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10703-008-0048-7","volume":"32","author":"A Bouajjani","year":"2008","unstructured":"Bouajjani, A., Habermehl, P., Vojnar, T.: Verification of parametric concurrent systems with prioritised FIFO resource management. Formal Methods Syst. Des. 32(2), 129\u2013172 (2008). https:\/\/doi.org\/10.1007\/s10703-008-0048-7","journal-title":"Formal Methods Syst. Des."},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Gastin, P., Herbreteau, F., Sankur, O., Srivathsan, B.: Zone-based verification of timed automata: extrapolations, simulations and what next? In: Bogomolov, S., Parker, D. (eds.) FORMATS. LNCS, vol. 13465, pp. 16\u201342. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15839-1_2","DOI":"10.1007\/978-3-031-15839-1_2"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, V., Dall\u2019Olio, E., Raskin, J.F.: Durations and parametric model-checking in timed automata. ACM Trans. Comput. Logic 9(2), 12:1\u201312:23 (2008). https:\/\/doi.org\/10.1145\/1342991.1342996","DOI":"10.1145\/1342991.1342996"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-28644-8_18","volume-title":"CONCUR 2004 - Concurrency Theory","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Talupur, M., Touili, T., Veith, H.: Verification by network decomposition. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 276\u2013291. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_18"},{"issue":"4","key":"6_CR22","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF00709157","volume":"1","author":"C Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. Formal Methods Syst. Des. 1(4), 385\u2013415 (1992). https:\/\/doi.org\/10.1007\/BF00709157","journal-title":"Formal Methods Syst. Des."},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/10721959_19","volume-title":"Automated Deduction - CADE-17","author":"EA Emerson","year":"2000","unstructured":"Emerson, E.A., Kahlon, V.: Reducing model checking of the many to the few. In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol. 1831, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10721959_19"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Emerson, E.A., Kahlon, V.: Model checking guarded protocols. In: LICS, pp. 361\u2013370. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/LICS.2003.1210076","DOI":"10.1109\/LICS.2003.1210076"},{"issue":"4","key":"6_CR25","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1142\/S0129054103001881","volume":"14","author":"EA Emerson","year":"2003","unstructured":"Emerson, E.A., Namjoshi, K.S.: On reasoning about rings. Int. J. Found. Comput. Sci. 14(4), 527\u2013550 (2003). https:\/\/doi.org\/10.1142\/S0129054103001881","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Esparza, J., Ganty, P., Majumdar, R., Weil-Kennedy, C.: Verification of immediate observation population protocols. In: Schewe, S., Zhang, L. (eds.) CONCUR. LIPIcs, vol. 118, pp. 31:1\u201331:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.31","DOI":"10.4230\/LIPIcs.CONCUR.2018.31"},{"issue":"2","key":"6_CR27","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00446-021-00390-x","volume":"34","author":"J Esparza","year":"2021","unstructured":"Esparza, J., Jaax, S., Raskin, M.A., Weil-Kennedy, C.: The complexity of verifying population protocols. Distrib. Comput. 34(2), 133\u2013177 (2021). https:\/\/doi.org\/10.1007\/s00446-021-00390-x","journal-title":"Distrib. Comput."},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-030-21571-2_20","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"J Esparza","year":"2019","unstructured":"Esparza, J., Raskin, M., Weil-Kennedy, C.: Parameterized analysis of immediate observation petri nets. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 365\u2013385. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_20"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-16901-4_23","volume-title":"Formal Methods and Software Engineering","author":"Y Hanna","year":"2010","unstructured":"Hanna, Y., Samuelson, D., Basu, S., Rajan, H.: Automating cut-off for multi-parameterized systems. In: Dong, J.S., Zhu, H. (eds.) ICFEM 2010. LNCS, vol. 6447, pp. 338\u2013354. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16901-4_23"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-15643-4_17","volume-title":"Automated Technology for Verification and Analysis","author":"F Herbreteau","year":"2010","unstructured":"Herbreteau, F., Srivathsan, B.: efficient on-the-fly emptiness check for timed b\u00fcchi automata. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 218\u2013232. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15643-4_17"},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s10703-011-0133-1","volume":"40","author":"F Herbreteau","year":"2012","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Efficient emptiness check for timed B\u00fcchi automata. Formal Methods Syst. Des. 40(2), 122\u2013146 (2012). https:\/\/doi.org\/10.1007\/s10703-011-0133-1","journal-title":"Formal Methods Syst. Des."},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1007\/978-3-642-39799-8_71","volume-title":"Computer Aided Verification","author":"F Herbreteau","year":"2013","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Lazy abstractions for timed automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 990\u20131005. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_71"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-73721-8_12","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S Jacobs","year":"2018","unstructured":"Jacobs, S., Sakr, M.: Analyzing guarded protocols: better cutoffs, more systems, more expressivity. In: VMCAI 2018. LNCS, vol. 10747, pp. 247\u2013268. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73721-8_12"},{"issue":"3","key":"6_CR34","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"ND Jones","year":"1977","unstructured":"Jones, N.D., Landweber, L.H., Lien, Y.E.: Complexity of some problems in petri nets. Theoret. Comput. Sci. 4(3), 277\u2013299 (1977). https:\/\/doi.org\/10.1016\/0304-3975(77)90014-7","journal-title":"Theoret. Comput. Sci."},{"issue":"47","key":"6_CR35","doi-asserted-by":"publisher","first-page":"6585","DOI":"10.1016\/j.tcs.2011.07.016","volume":"412","author":"M Merro","year":"2011","unstructured":"Merro, M., Ballardin, F., Sibilio, E.: A timed calculus for wireless systems. Theoret. Comput. Sci. 412(47), 6585\u20136611 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.07.016","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"6_CR36","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.future.2011.11.010","volume":"29","author":"F Pagliarecci","year":"2013","unstructured":"Pagliarecci, F., Spalazzi, L., Spegni, F.: Model checking grid security. Futur. Gener. Comput. Syst. 29(3), 811\u2013827 (2013). https:\/\/doi.org\/10.1016\/j.future.2011.11.010","journal-title":"Futur. Gener. Comput. Syst."},{"key":"6_CR37","doi-asserted-by":"publisher","unstructured":"Raskin, M.A., Weil-Kennedy, C., Esparza, J.: Flatness and complexity of immediate observation Petri nets. In: Konnov, I., Kov\u00e1cs, L. (eds.) CONCUR. LIPIcs, vol. 171, pp. 45:1\u201345:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.45","DOI":"10.4230\/LIPIcs.CONCUR.2020.45"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.tcs.2019.12.026","volume":"813","author":"L Spalazzi","year":"2020","unstructured":"Spalazzi, L., Spegni, F.: Parameterized model checking of networks of timed automata with boolean guards. Theoret. Comput. Sci. 813, 248\u2013269 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.12.026","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"6_CR39","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0020-0190(88)90211-6","volume":"28","author":"I Suzuki","year":"1988","unstructured":"Suzuki, I.: Proving properties of a ring of finite-state machines. Inf. Process. Lett. 28(4), 213\u2013214 (1988). https:\/\/doi.org\/10.1016\/0020-0190(88)90211-6","journal-title":"Inf. Process. Lett."},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-44878-7_10","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"Z Zhang","year":"2016","unstructured":"Zhang, Z., Nielsen, B., Larsen, K.G.: Distributed algorithms for time optimal reachability analysis. In: Fr\u00e4nzle, M., Markey, N. (eds.) FORMATS 2016. LNCS, vol. 9884, pp. 157\u2013173. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44878-7_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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T00:11:13Z","timestamp":1704240673000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50524-9_6"}},"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_6","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)"}}]}}