{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:35:28Z","timestamp":1761431728891,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032087065"},{"type":"electronic","value":"9783032087072"}],"license":[{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-08707-2_10","type":"book-chapter","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:23Z","timestamp":1761431603000},"page":"207-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Parameter Lifting: Finer Abstractions for\u00a0Parametric Markov Chains"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4774-7609","authenticated-orcid":false,"given":"Linus","family":"Heck","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2843-5511","authenticated-orcid":false,"given":"Tim","family":"Quatmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9113-2791","authenticated-orcid":false,"given":"Jip","family":"Spel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6143-1926","authenticated-orcid":false,"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0978-8466","authenticated-orcid":false,"given":"Sebastian","family":"Junges","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,26]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Andriushchenko, R., et al.: Tools at the frontiers of quantitative verification: QComp 2023 competition report. In: International TOOLympics Challenge, pp. 90\u2013146. Springer (2024)","DOI":"10.1007\/978-3-031-67695-6_4"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Andriushchenko, R., Bork, A., Ceska, M., Junges, S., Katoen, J., Mac\u00e1k, F.: Search and explore: symbiotic policy synthesis in POMDPs. In: CAV (3). Lecture Notes in Computer Science, vol. 13966, pp. 113\u2013135. Springer (2023)","DOI":"10.1007\/978-3-031-37709-9_6"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Andriushchenko, R., Ceska, M., Junges, S., Katoen, J., Stupinsk\u00fd, S.: PAYNT: a tool for inductive synthesis of probabilistic programs. In: CAV (1). Lecture Notes in Computer Science, vol. 12759, pp. 856\u2013869. Springer (2021)","DOI":"10.1007\/978-3-030-81685-8_40"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10009-023-00704-3","volume":"25","author":"TS Badings","year":"2023","unstructured":"Badings, T.S., Sim\u00e3o, T.D., Suilen, M., Jansen, N.: Decision-making under uncertainty: beyond probabilities. Int. J. Softw. Tools Technol. Transf. 25(3), 375\u2013391 (2023)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2019.104504","volume":"272","author":"C Baier","year":"2020","unstructured":"Baier, C., Hensel, C., Hutschenreiter, L., Junges, S., Katoen, J., Klein, J.: Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination. Inf. Comput. 272, 104504 (2020)","journal-title":"Inf. Comput."},{"key":"10_CR6","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press (2008)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Lenhardt, R., Worrell, J.: LTL model checking of interval Markov chains. In: TACAS. Lecture Notes in Computer Science, vol. 7795, pp. 32\u201346. Springer (2013)","DOI":"10.1007\/978-3-642-36742-7_3"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Benini, L., Bogliolo, A., Paleologo, G.A., Micheli, G.D.: Policy optimization for dynamic power management. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(6), 813\u2013833 (1999)","DOI":"10.1109\/43.766730"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Bortolussi, L., Silvetti, S.: Bayesian statistical parameter synthesis for linear temporal properties of stochastic models. In: TACAS (2). Lecture Notes in Computer Science, vol. 10806, pp. 396\u2013413. Springer (2018)","DOI":"10.1007\/978-3-319-89963-3_23"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., et al.: Verification of Markov decision processes using learning algorithms. In: ATVA. Lecture Notes in Computer Science, vol. 8837, pp. 98\u2013114. Springer (2014)","DOI":"10.1007\/978-3-319-11936-6_8"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Calinescu, R., Ceska, M., Gerasimou, S., Kwiatkowska, M., Paoletti, N.: Designing robust software systems through parametric Markov chain synthesis. In: ICSA, pp. 131\u2013140. IEEE Computer Society (2017)","DOI":"10.1109\/ICSA.2017.16"},{"issue":"6","key":"10_CR12","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00236-016-0265-2","volume":"54","author":"M Ceska","year":"2017","unstructured":"Ceska, M., Dannenberg, F., Paoletti, N., Kwiatkowska, M., Brim, L.: Precise parameter synthesis for stochastic biochemical systems. Acta Informatica 54(6), 589\u2013623 (2017)","journal-title":"Acta Informatica"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Ceska, M., Hensel, C., Junges, S., Katoen, J.: Counterexample-driven synthesis for probabilistic program sketches. In: FM. Lecture Notes in Computer Science, vol. 11800, pp. 101\u2013120. Springer (2019)","DOI":"10.1007\/978-3-030-30942-8_8"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Ceska, M., Jansen, N., Junges, S., Katoen, J.: Shepherding hordes of Markov chains. In: TACAS (2). Lecture Notes in Computer Science, vol. 11428, pp. 172\u2013190. Springer (2019)","DOI":"10.1007\/978-3-030-17465-1_10"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Chen, T., Hahn, E.M., Han, T., Kwiatkowska, M.Z., Qu, H., Zhang, L.: Model repair for Markov decision processes. In: TASE, pp. 85\u201392. IEEE Computer Society (2013)","DOI":"10.1109\/TASE.2013.20"},{"key":"10_CR16","unstructured":"Cheng, Y.H., Millstein, T., Van\u00a0den Broeck, G., Holtzen, S.: flip-hoisting: exploiting repeated parameters in discrete probabilistic programs. In: International Conference on Probabilistic Programming (PROBPROG) (2021)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00165-017-0432-4","volume":"30","author":"P Chrszon","year":"2018","unstructured":"Chrszon, P., Dubslaff, C., Kl\u00fcppelholz, S., Baier, C.: Profeat: feature-oriented engineering for family-based probabilistic model checking. Formal Aspects Comput. 30(1), 45\u201375 (2018)","journal-title":"Formal Aspects Comput."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Costen, C., Rigter, M., Lacerda, B., Hawes, N.: Planning with hidden parameter polynomial MDPs. In: AAAI, pp. 11963\u201311971. AAAI Press (2023)","DOI":"10.1609\/aaai.v37i10.26411"},{"issue":"12","key":"10_CR19","doi-asserted-by":"publisher","first-page":"6333","DOI":"10.1109\/TAC.2021.3133265","volume":"67","author":"M Cubuktepe","year":"2022","unstructured":"Cubuktepe, M., Jansen, N., Junges, S., Katoen, J., Topcu, U.: Convex optimization for parameter synthesis in MDPs. IEEE Trans. Autom. Control 67(12), 6333\u20136348 (2022)","journal-title":"IEEE Trans. Autom. Control"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Daws, C.: Symbolic and parametric model checking of discrete-time Markov chains. In: ICTAC. Lecture Notes in Computer Science, vol.\u00a03407, pp. 280\u2013294. Springer (2004)","DOI":"10.1007\/978-3-540-31862-0_21"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Esparza, J., Gawlitza, T., Kiefer, S., Seidl, H.: Approximative methods for monotone systems of min-max-polynomial equations. In: ICALP (1). Lecture Notes in Computer Science, vol. 5125, pp. 698\u2013710. Springer (2008)","DOI":"10.1007\/978-3-540-70575-8_57"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM 56(1), 1:1\u20131:66 (2009)","DOI":"10.1145\/1462153.1462154"},{"issue":"10","key":"10_CR23","doi-asserted-by":"publisher","first-page":"4707","DOI":"10.1109\/TSE.2023.3313645","volume":"49","author":"X Fang","year":"2023","unstructured":"Fang, X., Calinescu, R., Gerasimou, S., Alhwikem, F.: Fast parametric model checking with applications to software performability analysis. IEEE Trans. Software Eng. 49(10), 4707\u20134730 (2023)","journal-title":"IEEE Trans. Software Eng."},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Gainer, P., Hahn, E.M., Schewe, S.: Accelerated model checking of parametric Markov chains. In: ATVA. Lecture Notes in Computer Science, vol. 11138, pp. 300\u2013316. Springer (2018)","DOI":"10.1007\/978-3-030-01090-4_18"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Gainer, P., Hahn, E.M., Schewe, S.: Incremental verification of parametric and reconfigurable Markov chains. In: QEST. Lecture Notes in Computer Science, vol. 11024, pp. 140\u2013156. Springer (2018)","DOI":"10.1007\/978-3-319-99154-2_9"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Giro, S., Rabe, M.N.: Verification of partial-information probabilistic systems using counterexample-guided refinements. In: ATVA. Lecture Notes in Computer Science, vol.\u00a07561, pp. 333\u2013348. Springer (2012)","DOI":"10.1007\/978-3-642-33386-6_26"},{"issue":"1\u20132","key":"10_CR27","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0004-3702(02)00376-4","volume":"147","author":"R Givan","year":"2003","unstructured":"Givan, R., Dean, T.L., Greig, M.: Equivalence notions and model minimization in Markov decision processes. Artif. Intell. 147(1\u20132), 163\u2013223 (2003)","journal-title":"Artif. Intell."},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tcs.2016.12.003","volume":"735","author":"S Haddad","year":"2018","unstructured":"Haddad, S., Monmege, B.: Interval iteration algorithm for MDPs and IMDPs. Theor. Comput. Sci. 735, 111\u2013131 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10009-010-0146-x","volume":"13","author":"EM Hahn","year":"2011","unstructured":"Hahn, E.M., Hermanns, H., Zhang, L.: Probabilistic reachability for parametric Markov models. Int. J. Softw. Tools Technol. Transf. 13(1), 3\u201319 (2011)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10_CR30","unstructured":"Heck, L., Quatmann, T., Spel, J., Katoen, J., Junges, S.: Generalized parameter lifting: finer abstractions for parametric Markov chains. CoRR abs\/2504.05965 (2025)"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Heck, L., Spel, J., Junges, S., Moerman, J., Katoen, J.: Gradient-descent for randomized controllers under partial observability. In: VMCAI. Lecture Notes in Computer Science, vol. 13182, pp. 127\u2013150. Springer (2022)","DOI":"10.1007\/978-3-030-94583-1_7"},{"issue":"4","key":"10_CR32","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s10009-021-00633-z","volume":"24","author":"C Hensel","year":"2022","unstructured":"Hensel, C., Junges, S., Katoen, J., Quatmann, T., Volk, M.: The probabilistic model checker storm. Int. J. Softw. Tools Technol. Transf. 24(4), 589\u2013610 (2022)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Jansen, N., Junges, S., Katoen, J.: Parameter synthesis in Markov models: a gentle survey. In: Principles of Systems Design. Lecture Notes in Computer Science, vol. 13660, pp. 407\u2013437. Springer (2022)","DOI":"10.1007\/978-3-031-22337-2_20"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: LICS, pp. 266\u2013277. IEEE Computer Society (1991)","DOI":"10.1109\/LICS.1991.151651"},{"issue":"1","key":"10_CR35","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10703-023-00442-x","volume":"62","author":"S Junges","year":"2024","unstructured":"Junges, S., et al.: Parameter synthesis for Markov models: covering the parameter space. Formal Methods Syst. Des. 62(1), 181\u2013259 (2024)","journal-title":"Formal Methods Syst. Des."},{"key":"10_CR36","unstructured":"Junges, S., et al.: Finite-state controllers of POMDPs using parameter synthesis. In: UAI, pp. 519\u2013529. AUAI Press (2018)"},{"key":"10_CR37","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.jcss.2021.02.006","volume":"119","author":"S Junges","year":"2021","unstructured":"Junges, S., Katoen, J., P\u00e9rez, G.A., Winkler, T.: The complexity of reachability in parametric Markov decision processes. J. Comput. Syst. Sci. 119, 183\u2013210 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: CAV. Lecture Notes in Computer Science, vol. 6806, pp. 585\u2013591. Springer (2011)","DOI":"10.1007\/978-3-642-22110-1_47"},{"issue":"1","key":"10_CR39","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00165-006-0015-2","volume":"19","author":"R Lanotte","year":"2007","unstructured":"Lanotte, R., Maggiolo-Schettini, A., Troina, A.: Parametric probabilistic transition systems for system design and analysis. Formal Aspects Comput. 19(1), 93\u2013109 (2007)","journal-title":"Formal Aspects Comput."},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Meggendorfer, T., Weininger, M., Wienh\u00f6ft, P.: Solving robust Markov decision processes: generic, reliable, efficient. In: AAAI, pp. 26631\u201326641. AAAI Press (2025)","DOI":"10.1609\/aaai.v39i25.34865"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM (2009)","DOI":"10.1137\/1.9780898717716"},{"issue":"5","key":"10_CR42","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1287\/opre.1050.0216","volume":"53","author":"A Nilim","year":"2005","unstructured":"Nilim, A., Ghaoui, L.E.: Robust control of Markov decision processes with uncertain transition matrices. Oper. Res. 53(5), 780\u2013798 (2005)","journal-title":"Oper. Res."},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Polgreen, E., Wijesuriya, V.B., Haesaert, S., Abate, A.: Automated experiment design for data-efficient verification of parametric Markov decision processes. In: QEST. Lecture Notes in Computer Science, vol. 10503, pp. 259\u2013274. Springer (2017)","DOI":"10.1007\/978-3-319-66335-7_16"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Puggelli, A., Li, W., Sangiovanni-Vincentelli, A.L., Seshia, S.A.: Polynomial-time verification of PCTL properties of MDPs with convex uncertainties. In: CAV. Lecture Notes in Computer Science, vol. 8044, pp. 527\u2013542. Springer (2013)","DOI":"10.1007\/978-3-642-39799-8_35"},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Quatmann, T., Dehnert, C., Jansen, N., Junges, S., Katoen, J.: Parameter synthesis for Markov models: faster than ever. In: ATVA. Lecture Notes in Computer Science, vol. 9938, pp. 50\u201367 (2016)","DOI":"10.1007\/978-3-319-46520-3_4"},{"key":"10_CR46","unstructured":"Rickard, L., Abate, A., Margellos, K.: Learning robust policies for uncertain parametric Markov decision processes. In: L4DC. Proceedings of Machine Learning Research, vol.\u00a0242, pp. 876\u2013889. PMLR (2024)"},{"key":"10_CR47","doi-asserted-by":"crossref","unstructured":"Rodrigues, G.N., et al.: Modeling and verification for probabilistic properties in software product lines. In: HASE, pp. 173\u2013180. IEEE Computer Society (2015)","DOI":"10.1109\/HASE.2015.34"},{"key":"10_CR48","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1613\/jair.1.14044","volume":"77","author":"B Salmani","year":"2023","unstructured":"Salmani, B., Katoen, J.: Automatically finding the right probabilities in Bayesian networks. J. Artif. Intell. Res. 77, 1637\u20131696 (2023)","journal-title":"J. Artif. Intell. Res."},{"key":"10_CR49","unstructured":"Schaefer, M., Cardinal, J., Miltzow, T.: The existential theory of the reals as a complexity class: a compendium. CoRR abs\/2407.18006 (2024)"},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"Sen, K., Viswanathan, M., Agha, G.: Model-checking Markov chains in the presence of uncertainties. In: TACAS. Lecture Notes in Computer Science, vol. 3920, pp. 394\u2013410. Springer (2006)","DOI":"10.1007\/11691372_26"},{"key":"10_CR51","doi-asserted-by":"crossref","unstructured":"Spel, J., Junges, S., Katoen, J.: Are parametric Markov chains monotonic? In: ATVA. Lecture Notes in Computer Science, vol. 11781, pp. 479\u2013496. Springer (2019)","DOI":"10.1007\/978-3-030-31784-3_28"},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Spel, J., Junges, S., Katoen, J.: Finding provably optimal Markov chains. In: TACAS (1). Lecture Notes in Computer Science, vol. 12651, pp. 173\u2013190. Springer (2021)","DOI":"10.1007\/978-3-030-72016-2_10"},{"key":"10_CR53","doi-asserted-by":"crossref","unstructured":"Vandin, A., ter Beek, M.H., Legay, A., Lluch-Lafuente, A.: Qflan: a tool for the quantitative analysis of highly reconfigurable systems. In: FM. Lecture Notes in Computer Science, vol. 10951, pp. 329\u2013337. Springer (2018)","DOI":"10.1007\/978-3-319-95582-7_19"},{"issue":"1","key":"10_CR54","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00446-021-00408-4","volume":"35","author":"M Volk","year":"2022","unstructured":"Volk, M., Bonakdarpour, B., Katoen, J., Aflaki, S.: Synthesizing optimal bias in randomized self-stabilization. Distributed Comput. 35(1), 37\u201357 (2022)","journal-title":"Distributed Comput."},{"key":"10_CR55","doi-asserted-by":"crossref","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages - An Introduction. Foundation of Computing Series. MIT Press (1993)","DOI":"10.7551\/mitpress\/3054.001.0001"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08707-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:33Z","timestamp":1761431613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08707-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,26]]},"ISBN":["9783032087065","9783032087072"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08707-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,26]]},"assertion":[{"value":"26 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bengaluru","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"27 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/atva-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}