{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:06Z","timestamp":1776333486439,"version":"3.51.2"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031656323","type":"print"},{"value":"9783031656330","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T00:00:00Z","timestamp":1721952000000},"content-version":"vor","delay-in-days":207,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Infinite-state games are a commonly used model for the synthesis of reactive systems with unbounded data domains. Symbolic methods for solving such games need to be able to construct intricate arguments to establish the existence of winning strategies. Often, large problem instances require prohibitively complex arguments. Therefore, techniques that identify smaller and simpler sub-problems and exploit the respective results for the given game-solving task are highly desirable.<\/jats:p><jats:p>In this paper, we propose the first such technique for infinite-state games. The main idea is to enhance symbolic game-solving with the results of localized attractor computations performed in sub-games. The crux of our approach lies in identifying useful sub-games by computing permissive winning strategy templates in finite abstractions of the infinite-state game. The experimental evaluation of our method demonstrates that it outperforms existing techniques and is applicable to infinite-state games beyond the state of the art.<\/jats:p>","DOI":"10.1007\/978-3-031-65633-0_7","type":"book-chapter","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:03:08Z","timestamp":1721890988000},"page":"135-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Localized Attractor Computations for\u00a0Infinite-State Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2801-639X","authenticated-orcid":false,"given":"Anne-Kathrin","family":"Schmuck","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5433-8133","authenticated-orcid":false,"given":"Philippe","family":"Heim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2494-8690","authenticated-orcid":false,"given":"Rayna","family":"Dimitrova","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4407-8681","authenticated-orcid":false,"given":"Satya Prakash","family":"Nayak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-031-30820-8_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Anand","year":"2023","unstructured":"Anand, A., Mallik, K., Nayak, S.P., Schmuck, A.K.: Computing adequately permissive assumptions for synthesis. In: Sankaranarayanan, S., Sharygina, N. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 211\u2013228. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_15"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Anand, A., Nayak, S.P., Schmuck, A.: Synthesizing permissive winning strategy templates for parity games. In: Enea, C., Lal, A. (eds.) CAV 2023, Part I. LNCS, vol. 13964, pp. 436\u2013458. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37706-8_22","DOI":"10.1007\/978-3-031-37706-8_22"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-45069-6_12","volume-title":"Computer Aided Verification","author":"S Bardin","year":"2003","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: fast acceleration of symbolic transition systems. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 118\u2013121. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_12"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/11562948_35","volume-title":"Automated Technology for Verification and Analysis","author":"S Bardin","year":"2005","unstructured":"Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat acceleration in symbolic model checking. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 474\u2013488. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11562948_35"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Beyene, T.A., Chaudhuri, S., Popeea, C., Rybalchenko, A.: A constraint-based approach to solving games on infinite graphs. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201914, San Diego, CA, USA, January 20\u201321, 2014, pp. 221\u2013234. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535860","DOI":"10.1145\/2535838.2535860"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-33475-7_5","volume-title":"Theoretical Computer Science","author":"MHL Bodlaender","year":"2012","unstructured":"Bodlaender, M.H.L., Hurkens, C.A.J., Kusters, V.J.J., Staals, F., Woeginger, G.J., Zantema, H.: Cinderella versus the wicked stepmother. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 57\u201371. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33475-7_5"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Bradley, A.R., Manna, Z.: The Calculus of Computation - Decision Procedures with Applications to Verification. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74113-8","DOI":"10.1007\/978-3-540-74113-8"},{"key":"7_CR8","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, San Diego, CA, USA, 13\u201317 June, 2022, pp. 229\u2013243. ACM (2022). https:\/\/doi.org\/10.1145\/3519939.3523429","DOI":"10.1145\/3519939.3523429"},{"key":"7_CR9","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\u201923\/IAAI\u201923\/EAAI\u201923. AAAI Press (2023). https:\/\/doi.org\/10.1609\/aaai.v37i5.25779","DOI":"10.1609\/aaai.v37i5.25779"},{"issue":"POPL","key":"7_CR10","doi-asserted-by":"publisher","first-page":"61:1","DOI":"10.1145\/3158149","volume":"2","author":"A Farzan","year":"2018","unstructured":"Farzan, A., Kincaid, Z.: Strategy synthesis for linear arithmetic games. Proc. ACM Program. Lang. 2(POPL), 61:1-61:30 (2018). https:\/\/doi.org\/10.1145\/3158149","journal-title":"Proc. ACM Program. Lang."},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/S10703-011-0115-3","volume":"39","author":"E Filiot","year":"2011","unstructured":"Filiot, E., Jin, N., Raskin, J.: Antichains and compositional algorithms for LTL synthesis. Formal Methods Syst. Des. 39(3), 261\u2013296 (2011). https:\/\/doi.org\/10.1007\/S10703-011-0115-3","journal-title":"Formal Methods Syst. Des."},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/S11334-022-00462-6","volume":"19","author":"B Finkbeiner","year":"2023","unstructured":"Finkbeiner, B., Geier, G., Passing, N.: Specification decomposition for reactive synthesis. Innov. Syst. Softw. Eng. 19(4), 339\u2013357 (2023). https:\/\/doi.org\/10.1007\/S11334-022-00462-6","journal-title":"Innov. Syst. Softw. Eng."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-030-99253-8_17","volume-title":"Foundations of Software Science and Computation Structures","author":"B Finkbeiner","year":"2022","unstructured":"Finkbeiner, B., Heim, P., Passing, N.: Temporal stream logic modulo theories. In: FoSSaCS 2022. LNCS, vol. 13242, pp. 325\u2013346. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99253-8_17"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-030-25540-4_35","volume-title":"Computer Aided Verification","author":"B Finkbeiner","year":"2019","unstructured":"Finkbeiner, B., Klein, F., Piskac, R., Santolucito, M.: Temporal stream logic: synthesis beyond the bools. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 609\u2013629. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_35"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Finkbeiner, B., Mallik, K., Passing, N., Schledjewski, M., Schmuck, A.: BOCoSy: small but powerful symbolic output-feedback control. In: Bartocci, E., Putot, S. (eds.) HSCC \u201922: 25th ACM International Conference on Hybrid Systems: Computation and Control, Milan, Italy, May 4\u20136, 2022, pp. 24:1\u201324:11. ACM (2022). https:\/\/doi.org\/10.1145\/3501710.3519535","DOI":"10.1145\/3501710.3519535"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-030-59152-6_25","volume-title":"Automated Technology for Verification and Analysis","author":"B Finkbeiner","year":"2020","unstructured":"Finkbeiner, B., Passing, N.: Dependency-based compositional synthesis. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 447\u2013463. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_25"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36206-1_14","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"A Finkel","year":"2002","unstructured":"Finkel, A., Leroux, J.: How to compose presburger-accelerations: applications to broadcast protocols. In: Agrawal, M., Seth, A. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 145\u2013156. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36206-1_14"},{"key":"7_CR18","unstructured":"Girija, P., Mareena, J., Fenny, J., Swapna, K., Kaewkhiaolueang, K.: Amazon robotic service (ARS) (2021)"},{"issue":"8","key":"7_CR19","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1016\/j.ic.2006.10.009","volume":"205","author":"O Grumberg","year":"2007","unstructured":"Grumberg, O., Lange, M., Leucker, M., Shoham, S.: When not losing is better than winning: Abstraction and refinement for the full mu-calculus. Inf. Comput. 205(8), 1130\u20131148 (2007). https:\/\/doi.org\/10.1016\/j.ic.2006.10.009","journal-title":"Inf. Comput."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Gueye, S.M.K., Delaval, G., Rutten, E., Diguet, J.P.: Discrete and logico-numerical control for dynamic partial reconfigurable FPGA-based embedded systems: a case study. In: 2018 IEEE Conference on Control Technology and Applications (CCTA), pp. 1480\u20131487. IEEE (2018)","DOI":"10.1109\/CCTA.2018.8511552"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Heim, P., Dimitrova, R.: Solving infinite-state games via acceleration. Proc. ACM Program. Lang. 8(POPL) (2024). https:\/\/doi.org\/10.1145\/3632899","DOI":"10.1145\/3632899"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Heim, P., Nayak, S.P., Dimitrova, R., Schmuck, A.K.: Artifact of \u201cLocalized Attractor Computations for Infinite-State Games\u201d (2024). https:\/\/doi.org\/10.5281\/zenodo.10939871","DOI":"10.5281\/zenodo.10939871"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1007\/3-540-45061-0_69","volume-title":"Automata, Languages and Programming","author":"TA Henzinger","year":"2003","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R.: Counterexample-guided control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 886\u2013902. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_69"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-89963-3_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Katis","year":"2018","unstructured":"Katis, A., et al.: Validity-guided synthesis of reactive systems from assume-guarantee contracts. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10806, pp. 176\u2013193. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_10"},{"issue":"1","key":"7_CR25","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/MRA.2015.2506121","volume":"23","author":"E Kelasidi","year":"2016","unstructured":"Kelasidi, E., Liljeb\u00e4ck, P., Pettersen, K.Y., Gravdahl, J.T.: Innovation in underwater robots: biologically inspired swimming snake robots. IEEE Robotics Autom. Mag. 23(1), 44\u201362 (2016). https:\/\/doi.org\/10.1109\/MRA.2015.2506121","journal-title":"IEEE Robotics Autom. Mag."},{"issue":"3","key":"7_CR26","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10703-012-0176-y","volume":"42","author":"D Kroening","year":"2013","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","journal-title":"Formal Methods Syst. Des."},{"key":"7_CR27","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, Trento, Italy, October 17-21, 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":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-030-64437-6_14","volume-title":"Programming Languages and Systems","author":"O Markgraf","year":"2020","unstructured":"Markgraf, O., Hong, C.-D., Lin, A.W., Najib, M., Neider, D.: Parameterized synthesis with safety properties. In: Oliveira, B.C.S. (ed.) APLAS 2020. LNCS, vol. 12470, pp. 273\u2013292. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64437-6_14"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Masselot, M., Patil, S., Zhabelova, G., Vyatkin, V.: Towards a formal model of protection functions for power distribution networks. In: IECON 2016-42nd Annual Conference of the IEEE Industrial Electronics Society, pp. 5302\u20135309. IEEE (2016)","DOI":"10.1109\/IECON.2016.7794150"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/OJCSYS.2023.3305835","volume":"2","author":"SP Nayak","year":"2023","unstructured":"Nayak, S.P., Egidio, L.N., Della Rossa, M., Schmuck, A.K., Jungers, R.M.: Context-triggered abstraction-based control design. IEEE Open J. Control Syst. 2, 277\u2013296 (2023). https:\/\/doi.org\/10.1109\/OJCSYS.2023.3305835","journal-title":"IEEE Open J. Control Syst."},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-662-49674-9_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Neider","year":"2016","unstructured":"Neider, D., Topcu, U.: An automaton learning approach to solving safety games over infinite graphs. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 204\u2013221. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_12"},{"key":"7_CR32","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, Athens, Greece, August 23\u201328, 2021, pp. 1585\u20131589. ACM (2021). https:\/\/doi.org\/10.1145\/3468264.3473126","DOI":"10.1145\/3468264.3473126"},{"key":"7_CR33","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, Luxembourg, September 11\u201315, 2023, pp. 698\u2013709. IEEE (2023). https:\/\/doi.org\/10.1109\/ASE56229.2023.00212","DOI":"10.1109\/ASE56229.2023.00212"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Schmuck, A.K., Heim, P., Dimitrova, R., Nayak, S.P.: Localized attractor computations for infinite-state games (full version) (2024). https:\/\/doi.org\/10.48550\/ARXIV.2405.09281","DOI":"10.48550\/ARXIV.2405.09281"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Sylla, A.N., Louvel, M., Rutten, E., Delaval, G.: Modular and hierarchical discrete control for applications and middleware deployment in IoT and smart buildings. In: 2018 IEEE Conference on Control Technology and Applications (CCTA), pp. 1472\u20131479. IEEE (2018)","DOI":"10.1109\/CCTA.2018.8511406"},{"key":"7_CR36","unstructured":"Unno, H., Satake, Y., Terauchi, T., Koskinen, E.: Program verification via predicate constraint satisfiability modulo theories. CoRR abs\/2007.03656 (2020). https:\/\/arxiv.org\/abs\/2007.03656"},{"issue":"5\u20136","key":"7_CR37","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/S10009-012-0232-3","volume":"15","author":"MT Vechev","year":"2013","unstructured":"Vechev, M.T., Yahav, E., Yorsh, G.: Abstraction-guided synthesis of synchronization. Int. J. Softw. Tools Technol. Transf. 15(5\u20136), 413\u2013431 (2013). https:\/\/doi.org\/10.1007\/S10009-012-0232-3","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Walker, A., Ryzhyk, L.: Predicate abstraction for reactive synthesis. In: Formal Methods in Computer-Aided Design, FMCAD 2014, Lausanne, Switzerland, October 21\u201324, 2014. pp. 219\u2013226. IEEE (2014). https:\/\/doi.org\/10.1109\/FMCAD.2014.6987617","DOI":"10.1109\/FMCAD.2014.6987617"},{"key":"7_CR39","unstructured":"Woeginger: Combinatorics problem c5 (2009)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-65633-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:03:49Z","timestamp":1721891029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-65633-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031656323","9783031656330"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-65633-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"24 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}