{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:44:07Z","timestamp":1742996647335,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826993"},{"type":"electronic","value":"9783031827006"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-82700-6_5","type":"book-chapter","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T01:26:26Z","timestamp":1737595586000},"page":"101-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Verification of\u00a0Systems with\u00a0Precise (0,1)-Counter Abstraction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6117-318X","authenticated-orcid":false,"given":"Paul","family":"Eichler","sequence":"first","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\/0000-0002-1351-8824","authenticated-orcid":false,"given":"Chana","family":"Weil-Kennedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,24]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: General decidability theorems for infinite-state systems. In: Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, 27\u201330 July 1996, pp. 313\u2013321. IEEE Computer Society (1996). https:\/\/doi.org\/10.1109\/LICS.1996.561359","DOI":"10.1109\/LICS.1996.561359"},{"issue":"1\u20132","key":"5_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/INCO.1999.2843","volume":"160","author":"PA Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1\u20132), 109\u2013127 (2000). https:\/\/doi.org\/10.1006\/INCO.1999.2843","journal-title":"Inf. Comput."},{"issue":"3","key":"5_CR3","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":"5_CR4","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Eichler, P., Jacobs, S., Karra, S.L.: Parameterized verification of disjunctive timed networks. In: Dimitrova, R., Lahav, O., Wolff, S. (eds.) Verification, Model Checking, and Abstract Interpretation - 25th International Conference, VMCAI 2024, London, United Kingdom, 15\u201316 January 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14499, pp. 124\u2013146. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-50524-9_6","DOI":"10.1007\/978-3-031-50524-9_6"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/S00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279\u2013304 (2007). https:\/\/doi.org\/10.1007\/S00446-007-0040-2","journal-title":"Distrib. Comput."},{"issue":"6","key":"5_CR6","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":"5_CR7","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"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-89963-3_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"AR Balasubramanian","year":"2018","unstructured":"Balasubramanian, A.R., Bertrand, N., Markey, N.: Parameterized verification of\u00a0synchronization in constrained reconfigurable broadcast networks. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10806, pp. 38\u201354. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_3"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-99253-8_4","volume-title":"Foundations of Software Science and Computation Structures","author":"AR Balasubramanian","year":"2022","unstructured":"Balasubramanian, A.R., Guillou, L., Weil-Kennedy, C.: Parameterized analysis of reconfigurable broadcast networks. In: FoSSaCS 2022. LNCS, vol. 13242, pp. 61\u201380. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99253-8_4"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Balasubramanian, A.R., Weil-Kennedy, C.: Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent. In: Ganty, P., Bresolin, D. (eds.) Proceedings 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, Padua, Italy, 20\u201322 September 2021. EPTCS, vol.\u00a0346, pp. 18\u201334 (2021). https:\/\/doi.org\/10.4204\/EPTCS.346.2","DOI":"10.4204\/EPTCS.346.2"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Baumeister, T., Eichler, P., Jacobs, S., Sakr, M., V\u00f6lp, M.: Parameterized verification of round-based distributed algorithms via extended threshold automata. In: Platzer, A., Rozier, K.Y., Pradella, M., Rossi, M. (eds.) Formal Methods - 26th International Symposium, FM 2024, Milan, Italy, 9\u201313 September 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14933, pp. 638\u2013657. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71162-6_33","DOI":"10.1007\/978-3-031-71162-6_33"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Bertrand, N., Dewaskar, M., Genest, B., Gimbert, H., Godbole, A.A.: Controlling a population. Log. Methods Comput. Sci. 15(3) (2019). https:\/\/doi.org\/10.23638\/LMCS-15(3:6)2019","DOI":"10.23638\/LMCS-15(3:6)2019"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-54830-7_9","volume-title":"Foundations of Software Science and Computation Structures","author":"N Bertrand","year":"2014","unstructured":"Bertrand, N., Fournier, P., Sangnier, A.: Playing with probabilities in reconfigurable broadcast networks. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol. 8412, pp. 134\u2013148. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54830-7_9"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Bloem, R., et al.: Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers (2015). https:\/\/doi.org\/10.2200\/S00658ED1V01Y201508DCT013","DOI":"10.2200\/S00658ED1V01Y201508DCT013"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Markey, N., Randour, M., Sangnier, A., Stan, D.: Reachability in networks of register protocols under stochastic schedulers. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, 11\u201315 July 2016, Rome, Italy. LIPIcs, vol.\u00a055, pp. 106:1\u2013106:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.106","DOI":"10.4230\/LIPIcs.ICALP.2016.106"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Colcombet, T., Fijalkow, N., Ohlmann, P.: Controlling a random population. Log. Methods Comput. Sci. 17(4) (2021). https:\/\/doi.org\/10.46298\/LMCS-17(4:12)2021","DOI":"10.46298\/LMCS-17(4:12)2021"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Delzanno, G., Sangnier, A., Traverso, R., Zavattaro, G.: On the complexity of parameterized reachability in reconfigurable broadcast networks. In: D\u2019Souza, D., Kavitha, T., Radhakrishnan, J. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, 15\u201317 December 2012, Hyderabad, India. LIPIcs, vol.\u00a018, pp. 289\u2013300. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2012). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2012.289","DOI":"10.4230\/LIPICS.FSTTCS.2012.289"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-15375-4_22","volume-title":"CONCUR 2010 - Concurrency Theory","author":"G Delzanno","year":"2010","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 313\u2013327. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_22"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-30793-5_15","volume-title":"Formal Techniques for Distributed Systems","author":"G Delzanno","year":"2012","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Verification of ad hoc networks with node and communication failures. In: Giese, H., Rosu, G. (eds.) FMOODS\/FORTE -2012. LNCS, vol. 7273, pp. 235\u2013250. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30793-5_15"},{"key":"5_CR20","unstructured":"Eichler, P., Jacobs, S., Weil-Kennedy, C.: Parameterized verification of systems with precise (0,1)-counter abstraction (2024). https:\/\/arxiv.org\/abs\/2408.05954"},{"key":"5_CR21","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":"5_CR22","doi-asserted-by":"publisher","unstructured":"Emerson, E.A., Kahlon, V.: Model checking guarded protocols. In: 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22\u201325 June 2003, Ottawa, Canada, Proceedings, pp. 361\u2013370. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/LICS.2003.1210076","DOI":"10.1109\/LICS.2003.1210076"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Emerson, E.A., Namjoshi, K.S.: Reasoning about rings. In: Cytron, R.K., Lee, P. (eds.) Conference Record of POPL\u201995: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, 23\u201325 January 1995, pp. 85\u201394. ACM Press (1995). https:\/\/doi.org\/10.1145\/199448.199468","DOI":"10.1145\/199448.199468"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinite-state systems. In: Thirteenth Annual IEEE Symposium on Logic in Computer Science, Indianapolis, Indiana, USA, 21\u201324 June 1998, pp. 70\u201380. IEEE Computer Society (1998). https:\/\/doi.org\/10.1109\/LICS.1998.705644","DOI":"10.1109\/LICS.1998.705644"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Esparza, J.: Keeping a crowd safe: on the complexity of parameterized verification (invited talk). In: Mayr, E.W., Portier, N. (eds.) 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, 5\u20138 March 2014, Lyon, France. LIPIcs, vol.\u00a025, pp. 1\u201310. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2014). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2014.1","DOI":"10.4230\/LIPICS.STACS.2014.1"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, 2\u20135 July 1999, pp. 352\u2013359. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/LICS.1999.782630","DOI":"10.1109\/LICS.1999.782630"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Esparza, J., Ganty, P., Majumdar, R.: Parameterized verification of asynchronous shared-memory systems. J. ACM 63(1), 10:1\u201310:48 (2016). https:\/\/doi.org\/10.1145\/2842603","DOI":"10.1145\/2842603"},{"key":"5_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":"5_CR29","doi-asserted-by":"crossref","unstructured":"Finkel, A.: Reduction and covering of infinite reachability trees. Inf. Comput. 89(2), 144\u2013179 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90009-7","DOI":"10.1016\/0890-5401(90)90009-7"},{"issue":"1\u20132","key":"5_CR30","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1\u20132), 63\u201392 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00102-X","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"5_CR31","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"SM German","year":"1992","unstructured":"German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39(3), 675\u2013735 (1992). https:\/\/doi.org\/10.1145\/146637.146681","journal-title":"J. ACM"},{"key":"5_CR32","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"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Jacobs, S., Sakr, M., V\u00f6lp, M.: Automatic repair and deadlock detection for parameterized systems. In: Griggio, A., Rungta, N. (eds.) 22nd Formal Methods in Computer-Aided Design, FMCAD 2022, Trento, Italy, 17\u201321 October 2022, pp. 225\u2013234. IEEE (2022). https:\/\/doi.org\/10.34727\/2022\/ISBN.978-3-85448-053-2_29","DOI":"10.34727\/2022\/ISBN.978-3-85448-053-2_29"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October - 1 November 1977, pp. 254\u2013266. IEEE Computer Society (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.16","DOI":"10.1109\/SFCS.1977.16"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: a frequently discovered concept. J. Comb. Theory, Ser. A 13(3), 297\u2013305 (1972). https:\/\/doi.org\/10.1016\/0097-3165(72)90063-5","DOI":"10.1016\/0097-3165(72)90063-5"},{"issue":"6","key":"5_CR36","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/BF01213206","volume":"31","author":"A de Luca","year":"1994","unstructured":"de Luca, A., Varricchio, S.: Well quasi-orders and regular languages. Acta Informatica 31(6), 539\u2013557 (1994). https:\/\/doi.org\/10.1007\/BF01213206","journal-title":"Acta Informatica"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-45657-0_9","volume-title":"Computer Aided Verification","author":"A Pnueli","year":"2002","unstructured":"Pnueli, A., Xu, J., Zuck, L.: Liveness with (0,1, $$\\infty $$)- counter abstraction. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 107\u2013122. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45657-0_9"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-40184-8_2","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"S Schmitz","year":"2013","unstructured":"Schmitz, S., Schnoebelen, P.: The power of well-structured systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 5\u201324. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40184-8_2"},{"issue":"4","key":"5_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."}],"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-82700-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T01:26:35Z","timestamp":1737595595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82700-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826993","9783031827006"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82700-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"24 January 2025","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":"Denver, CO","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2025","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":"vmcai2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/VMCAI-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}