{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:19:04Z","timestamp":1784830744581,"version":"3.55.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227515","type":"print"},{"value":"9783032227522","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"content-version":"vor","delay-in-days":105,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22752-2_21","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:51:12Z","timestamp":1776289872000},"page":"398-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Modular Attractor Acceleration in Infinite-State Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5433-8133","authenticated-orcid":false,"given":"Philippe","family":"Heim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2494-8690","authenticated-orcid":false,"given":"Rayna","family":"Dimitrova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,16]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Azzopardi, S., Stefano, L.D., Piterman, N., Schneider, G.: Full LTL synthesis over infinite-state arenas. In: Piskac, R., Rakamaric, Z. (eds.) Computer Aided Verification - 37th International Conference, CAV 2025, Zagreb, Croatia, July 23-25, 2025, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 15934, pp. 274\u2013297. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-98685-7_13, https:\/\/doi.org\/10.1007\/978-3-031-98685-7_13","DOI":"10.1007\/978-3-031-98685-7_13"},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Bagnara, R., Mesnard, F., Pescetti, A., Zaffanella, E.: A new look at the automatic synthesis of linear ranking functions. Inf. Comput. 215, 47\u201367 (2012). https:\/\/doi.org\/10.1016\/J.IC.2012.03.003, https:\/\/doi.org\/10.1016\/j.ic.2012.03.003","DOI":"10.1016\/J.IC.2012.03.003"},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: fast acceleration of symbolic transition systems. In: Jr., W.A.H., Somenzi, F. (eds.) Computer Aided Verification, 15th International Conference, CAV 2003. LNCS, vol.\u00a02725, pp. 118\u2013121. Springer (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_12","DOI":"10.1007\/978-3-540-45069-6_12"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat acceleration in symbolic model checking. In: Peled, D.A., Tsay, Y. (eds.) Automated Technology for Verification and Analysis, Third International Symposium, ATVA 2005. LNCS, vol.\u00a03707, pp. 474\u2013488. Springer (2005). https:\/\/doi.org\/10.1007\/11562948_35","DOI":"10.1007\/11562948_35"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Borralleras, C., Brockschmidt, M., Larraz, D., Oliveras, A., Rodr\u00edguez-Carbonell, E., Rubio, A.: Proving termination through conditional termination. In: Legay, A., Margaria, T. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part I. Lecture Notes in Computer Science, vol. 10205, pp. 99\u2013117 (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_6, https:\/\/doi.org\/10.1007\/978-3-662-54577-5_6","DOI":"10.1007\/978-3-662-54577-5_6"},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Choi, W., Finkbeiner, B., Piskac, R., Santolucito, M.: Can reactive synthesis and syntax-guided synthesis be friends? In: Jhala, R., Dillig, I. (eds.) PLDI \u201922: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2022. pp. 229\u2013243. ACM (2022). https:\/\/doi.org\/10.1145\/3519939.3523429","DOI":"10.1145\/3519939.3523429"},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Col\u00f3n, M., Sipma, H.: Synthesis of linear ranking functions. In: Margaria, T., Yi, W. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, 7th International Conference, TACAS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings. Lecture Notes in Computer Science, vol.\u00a02031, pp. 67\u201381. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_6, https:\/\/doi.org\/10.1007\/3-540-45319-9_6","DOI":"10.1007\/3-540-45319-9_6"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Faella, M., Parlato, G.: Reachability games modulo theories with a bounded safety player. In: Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence. AAAI Press (2023). https:\/\/doi.org\/10.1609\/aaai.v37i5.25779","DOI":"10.1609\/aaai.v37i5.25779"},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Farzan, A., Kincaid, Z.: Strategy synthesis for linear arithmetic games. Proc. ACM Program. Lang. 2(POPL), 61:1\u201361:30 (2018). https:\/\/doi.org\/10.1145\/3158149","DOI":"10.1145\/3158149"},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Fedyukovich, G., Zhang, Y., Gupta, A.: Syntax-guided termination analysis. In: Chockler, H., Weissenbacher, G. (eds.) Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part I. Lecture Notes in Computer Science, vol. 10981, pp. 124\u2013143. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_7, https:\/\/doi.org\/10.1007\/978-3-319-96145-3_7","DOI":"10.1007\/978-3-319-96145-3_7"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Frohn, F.: A calculus for modular loop acceleration. In: Biere, A., Parker, D. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12078, pp. 58\u201376. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_4, https:\/\/doi.org\/10.1007\/978-3-030-45190-5_4","DOI":"10.1007\/978-3-030-45190-5_4"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Frohn, F., Giesl, J.: Proving non-termination via loop acceleration. In: Barrett, C.W., Yang, J. (eds.) 2019 Formal Methods in Computer Aided Design, FMCAD 2019, San Jose, CA, USA, October 22-25, 2019. pp. 221\u2013230. IEEE (2019). https:\/\/doi.org\/10.23919\/FMCAD.2019.8894271, https:\/\/doi.org\/10.23919\/FMCAD.2019.8894271","DOI":"10.23919\/FMCAD.2019.8894271"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Heim, P., Dimitrova, R.: Solving infinite-state games via acceleration. Proc. ACM Program. Lang. 8(POPL), 1696\u20131726 (2024). https:\/\/doi.org\/10.1145\/3632899","DOI":"10.1145\/3632899"},{"key":"21_CR14","doi-asserted-by":"publisher","unstructured":"Heim, P., Dimitrova, R.: Issy: A comprehensive tool for specification and synthesis of infinite-state reactive systems. In: Piskac, R., Rakamaric, Z. (eds.) Computer Aided Verification - 37th International Conference, CAV 2025, Zagreb, Croatia, July 23-25, 2025, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 15934, pp. 298\u2013312. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-98685-7_14, https:\/\/doi.org\/10.1007\/978-3-031-98685-7_14","DOI":"10.1007\/978-3-031-98685-7_14"},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Heim, P., Dimitrova, R.: Translation of temporal logic for efficient infinite-state reactive synthesis. Proc. ACM Program. Lang. 9(POPL), 1536\u20131567 (2025). https:\/\/doi.org\/10.1145\/3704888","DOI":"10.1145\/3704888"},{"key":"21_CR16","doi-asserted-by":"publisher","unstructured":"Heim, P., Dimitrova, R.: Modular attractor acceleration in infinite-state games (full version) (2026). https:\/\/doi.org\/10.48550\/arXiv.2601.14068","DOI":"10.48550\/arXiv.2601.14068"},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Kincaid, Z., Breck, J., Cyphert, J., Reps, T.W.: Closed forms for numerical loops. Proc. ACM Program. Lang. 3(POPL), 55:1\u201355:29 (2019). https:\/\/doi.org\/10.1145\/3290368, https:\/\/doi.org\/10.1145\/3290368","DOI":"10.1145\/3290368"},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Kroening, D., Sharygina, N., Tonetta, S., Tsitovich, A., Wintersteiger, C.M.: Loop summarization using state and transition invariants. Formal Methods Syst. Des. 42(3), 221\u2013261 (2013). https:\/\/doi.org\/10.1007\/s10703-012-0176-y","DOI":"10.1007\/s10703-012-0176-y"},{"key":"21_CR19","doi-asserted-by":"publisher","unstructured":"Leike, J., Heizmann, M.: Ranking templates for linear loops. Log. Methods Comput. Sci. 11(1) (2015). https:\/\/doi.org\/10.2168\/LMCS-11(1:16)2015, https:\/\/doi.org\/10.2168\/LMCS-11(1:16)2015","DOI":"10.2168\/LMCS-11(1:16)2015"},{"key":"21_CR20","doi-asserted-by":"publisher","unstructured":"Maderbacher, B., Bloem, R.: Reactive synthesis modulo theories using abstraction refinement. In: Griggio, A., Rungta, N. (eds.) 22nd Formal Methods in Computer-Aided Design, FMCAD 2022. pp. 315\u2013324. IEEE (2022). https:\/\/doi.org\/10.34727\/2022\/ISBN.978-3-85448-053-2_38","DOI":"10.34727\/2022\/ISBN.978-3-85448-053-2_38"},{"key":"21_CR21","doi-asserted-by":"publisher","unstructured":"Maderbacher, B., Windisch, F., Bloem, R.: Synthesis from infinite-state generalized reactivity(1) specifications. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation. Software Engineering Methodologies - 12th International Symposium, ISoLA 2024. LNCS, vol. 15222, pp. 281\u2013301. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-75387-9_17","DOI":"10.1007\/978-3-031-75387-9_17"},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Neider, D., Topcu, U.: An automaton learning approach to solving safety games over infinite graphs. In: Chechik, M., Raskin, J. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016. LNCS, vol.\u00a09636, pp. 204\u2013221. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_12","DOI":"10.1007\/978-3-662-49674-9_12"},{"key":"21_CR23","doi-asserted-by":"publisher","unstructured":"Pimpalkhare, N., Kincaid, Z.: Monotone procedure summarization via vector addition systems and inductive potentials. Proc. ACM Program. Lang. 8(OOPSLA2), 1873\u20131899 (2024). https:\/\/doi.org\/10.1145\/3689777, https:\/\/doi.org\/10.1145\/3689777","DOI":"10.1145\/3689777"},{"key":"21_CR24","doi-asserted-by":"publisher","unstructured":"Rodr\u00edguez, A., Gorostiaga, F., S\u00e1nchez, C.: Predictable and performant reactive synthesis modulo theories via functional synthesis. In: Akshay, S., Niemetz, A., Sankaranarayanan, S. (eds.) Automated Technology for Verification and Analysis - 22nd International Symposium, ATVA 2024. LNCS, vol. 15055, pp. 28\u201350. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-78750-8_2","DOI":"10.1007\/978-3-031-78750-8_2"},{"key":"21_CR25","doi-asserted-by":"publisher","unstructured":"Rodr\u00edguez, A., Gorostiaga, F., S\u00e1nchez, C.: Counter example guided reactive synthesis for LTL modulo theories$$ ^{\\text{*}}$$. In: Piskac, R., Rakamaric, Z. (eds.) Computer Aided Verification - 37th International Conference, CAV 2025, Zagreb, Croatia, July 23-25, 2025, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 15934, pp. 224\u2013248. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-98685-7_11, https:\/\/doi.org\/10.1007\/978-3-031-98685-7_11","DOI":"10.1007\/978-3-031-98685-7_11"},{"key":"21_CR26","doi-asserted-by":"publisher","unstructured":"Rodr\u00edguez, A., S\u00e1nchez, C.: Boolean abstractions for realizability modulo theories. In: Enea, C., Lal, A. (eds.) Computer Aided Verification - 35th International Conference, CAV 2023. LNCS, vol. 13966, pp. 305\u2013328. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-37709-9_15","DOI":"10.1007\/978-3-031-37709-9_15"},{"key":"21_CR27","doi-asserted-by":"publisher","unstructured":"Rodr\u00edguez, A., S\u00e1nchez, C.: Adaptive reactive synthesis for LTL and LTLf modulo theories. In: Wooldridge, M.J., Dy, J.G., Natarajan, S. (eds.) Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2024. pp. 10679\u201310686. AAAI Press (2024). https:\/\/doi.org\/10.1609\/AAAI.V38I9.28939","DOI":"10.1609\/AAAI.V38I9.28939"},{"key":"21_CR28","doi-asserted-by":"publisher","unstructured":"Samuel, S., D\u2019Souza, D., Komondoor, R.: Gensys: a scalable fixed-point engine for maximal controller synthesis over infinite state spaces. In: Spinellis, D., Gousios, G., Chechik, M., Penta, M.D. (eds.) ESEC\/FSE \u201921: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering. pp. 1585\u20131589. ACM (2021). https:\/\/doi.org\/10.1145\/3468264.3473126","DOI":"10.1145\/3468264.3473126"},{"key":"21_CR29","doi-asserted-by":"publisher","unstructured":"Samuel, S., D\u2019Souza, D., Komondoor, R.: Symbolic fixpoint algorithms for logical LTL games. In: 38th IEEE\/ACM International Conference on Automated Software Engineering, ASE 2023. pp. 698\u2013709. IEEE (2023). https:\/\/doi.org\/10.1109\/ASE56229.2023.00212","DOI":"10.1109\/ASE56229.2023.00212"},{"key":"21_CR30","doi-asserted-by":"publisher","unstructured":"Schmuck, A., Heim, P., Dimitrova, R., Nayak, S.P.: Localized attractor computations for infinite-state games. In: Gurfinkel, A., Ganesh, V. (eds.) Computer Aided Verification - 36th International Conference, CAV 2024. LNCS, vol. 14683, pp. 135\u2013158. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-65633-0_7","DOI":"10.1007\/978-3-031-65633-0_7"},{"key":"21_CR31","doi-asserted-by":"publisher","unstructured":"Sery, O., Fedyukovich, G., Sharygina, N.: Interpolation-based function summaries in bounded model checking. In: Eder, K., Louren\u00e7o, J., Shehory, O. (eds.) Hardware and Software: Verification and Testing - 7th International Haifa Verification Conference, HVC 2011, Haifa, Israel, December 6-8, 2011, Revised Selected Papers. Lecture Notes in Computer Science, vol.\u00a07261, pp. 160\u2013175. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-34188-5_15, https:\/\/doi.org\/10.1007\/978-3-642-34188-5_15","DOI":"10.1007\/978-3-642-34188-5_15"},{"key":"21_CR32","doi-asserted-by":"publisher","unstructured":"Solanki, M., Chatterjee, P., Lal, A., Roy, S.: Accelerated bounded model checking using interpolation based summaries. In: Finkbeiner, B., Kov\u00e1cs, L. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II. Lecture Notes in Computer Science, vol. 14571, pp. 155\u2013174. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57249-4_8, https:\/\/doi.org\/10.1007\/978-3-031-57249-4_8","DOI":"10.1007\/978-3-031-57249-4_8"},{"key":"21_CR33","doi-asserted-by":"publisher","unstructured":"Unno, H., Terauchi, T., Gu, Y., Koskinen, E.: Modular primal-dual fixpoint logic solving for temporal verification. Proc. ACM Program. Lang. 7(POPL), 2111\u20132140 (2023). https:\/\/doi.org\/10.1145\/3571265","DOI":"10.1145\/3571265"},{"key":"21_CR34","doi-asserted-by":"publisher","unstructured":"Urban, C., Gurfinkel, A., Kahsai, T.: Synthesizing ranking functions from bits and pieces. In: Chechik, M., Raskin, J. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings. Lecture Notes in Computer Science, vol.\u00a09636, pp. 54\u201370. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_4, https:\/\/doi.org\/10.1007\/978-3-662-49674-9_4","DOI":"10.1007\/978-3-662-49674-9_4"},{"key":"21_CR35","doi-asserted-by":"publisher","unstructured":"Zhu, S., Kincaid, Z.: Breaking the mold: Nonlinear ranking function synthesis without templates. In: Gurfinkel, A., Ganesh, V. (eds.) Computer Aided Verification - 36th International Conference, CAV 2024, Montreal, QC, Canada, July 24-27, 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14681, pp. 431\u2013452. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-65627-9_21, https:\/\/doi.org\/10.1007\/978-3-031-65627-9_21","DOI":"10.1007\/978-3-031-65627-9_21"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22752-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T02:42:53Z","timestamp":1782873773000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22752-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227515","9783032227522"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22752-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"16 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}