{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T04:05:54Z","timestamp":1749787554907,"version":"3.41.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031947056","type":"print"},{"value":"9783031947063","type":"electronic"}],"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-94706-3_8","type":"book-chapter","created":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:22:34Z","timestamp":1749727354000},"page":"157-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counterexample-Guided Abstraction Refinement for\u00a0Generalized Graph Transformation Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4193-2889","authenticated-orcid":false,"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1714-6319","authenticated-orcid":false,"given":"Arend","family":"Rensink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1667-8573","authenticated-orcid":false,"given":"Lara","family":"Stoltenow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Urrigshardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"issue":"7","key":"8_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/1965724.1965743","volume":"54","author":"T Ball","year":"2011","unstructured":"Ball, T., Levin, V., Rajamani, S.K.: A decade of software model checking with SLAM. Commun. ACM 54(7), 68\u201376 (2011)","journal-title":"Commun. ACM"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10009-007-0044-z","volume":"9","author":"D Beyer","year":"2007","unstructured":"Beyer, D., Henzinger, T.A., Jhala, R., Majumdar, R.: The software model checker Blast. Int. J. Softw. Tools Technol. Transfer 9, 505\u2013525 (2007)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-662-54434-1_6","volume-title":"Programming Languages and Systems","author":"F Bonchi","year":"2017","unstructured":"Bonchi, F., Gadducci, F., Kissinger, A., Soboci\u0144ski, P., Zanasi, F.: Confluence of graph rewriting with interfaces. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 141\u2013169. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54434-1_6"},{"key":"8_CR4","unstructured":"Bruggink, H.J.S., Cauderlier, R., H\u00fclsbusch, M., K\u00f6nig, B.: Conditional reactive systems. In: Proceedings of FSTTCS\u00a0\u201911. LIPIcs, vol.\u00a013. Schloss Dagstuhl \u2013 Leibniz Center for Informatics (2011)"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Bruggink, H.J.S., K\u00f6nig, B., Matjeka, M., Nolte, D., Stoltenow, L.: A flexible and easy-to-use library for the rapid development of graph tools in Java (tool presentation paper). In: Proceedings of ICGT \u201920. LNCS, vol 12150, pp. 297\u2013306. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-51372-6_17","DOI":"10.1007\/978-3-030-51372-6_17"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Bruggink, H.J.S., K\u00f6nig, B., Zantema, H.: Termination analysis for graph transformation systems. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 179\u2013194. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44602-7_15","DOI":"10.1007\/978-3-662-44602-7_15"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Chaki, S., Clarke, E.M., Groce, A., Jha, S., Veith, H.: Modular verification of software components in C. In: Proceedings of ICSE \u201903 (25th International Conference on Software Engineering), pp. 385\u2013395. IEEE Computer Society (2003)","DOI":"10.1109\/ICSE.2003.1201217"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154\u2013169. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_15","DOI":"10.1007\/10722167_15"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752\u2013794 (2003)","DOI":"10.1145\/876638.876643"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Cousot, P.: Abstract interpretation. ACM Comput. Surv. 28(2) (1996)","DOI":"10.1145\/234528.234740"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of POPL \u201977, Los Angeles, California, pp. 238\u2013252. ACM (1977)","DOI":"10.1145\/512950.512973"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-61470-0_9","volume-title":"Graph Transformation","author":"J Dyck","year":"2017","unstructured":"Dyck, J., Giese, H.: k-inductive invariant checking for graph transformation systems. In: de Lara, J., Plump, D. (eds.) ICGT 2017. LNCS, vol. 10373, pp. 142\u2013158. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61470-0_9"},{"key":"8_CR13","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. Springer, Heidelberg (2006)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H.J.: Graph grammars: an algebraic approach. In: Proceedings 14th IEEE Symposium on Switching and Automata Theory, pp. 167\u2013180 (1973)","DOI":"10.1109\/SWAT.1973.11"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11691372_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Esparza","year":"2006","unstructured":"Esparza, J., Kiefer, S., Schwoon, S.: Abstraction refinement with craig interpolation and symbolic pushdown systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 489\u2013503. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691372_35"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Math. Stuct. Comput. Sci. 19(2), 245\u2013296 (2009)","journal-title":"Math. Stuct. Comput. Sci."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45315-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"A Habel","year":"2001","unstructured":"Habel, A., Plump, D.: Computational completeness of programming languages based on graph transformation. In: Honsell, F., Miculan, M. (eds.) FoSSaCS 2001. LNCS, vol. 2030, pp. 230\u2013245. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45315-6_15"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Heckel, R., Wagner, A.: Ensuring consistency of conditional graph rewriting - a constructive approach. In: Proceedings of the Joint COMPUGRAPH\/SEMAGRAPH Workshop on Graph Rewriting and Computation. ENTCS, vol.\u00a02 (1995)","DOI":"10.1016\/S1571-0661(05)80188-4"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: Proceedings of POPL \u201904, pp. 232\u2013244. ACM (2004)","DOI":"10.1145\/982962.964021"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Proceedings of POPL \u201902, pp. 58\u201370. ACM (2002)","DOI":"10.1145\/565816.503279"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-28729-9_24","volume-title":"Foundations of Software Science and Computational Structures","author":"M H\u00fclsbusch","year":"2012","unstructured":"H\u00fclsbusch, M., K\u00f6nig, B.: Deriving bisimulation congruences for conditional reactive systems. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 361\u2013375. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_24"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"H\u00fclsbusch, M., K\u00f6nig, B., K\u00fcpper, S., Stoltenow, L.: Conditional bisimilarity for reactive systems. Logical Methods Comput. Sci. 18(1) (2022)","DOI":"10.46298\/lmcs-18(1:6)2022"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/11691372_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Jhala","year":"2006","unstructured":"Jhala, R., McMillan, K.L.: A practical and complete approach to predicate refinement. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 459\u2013473. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691372_33"},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1017\/S0960129501003486","volume":"12","author":"B K\u00f6nig","year":"2002","unstructured":"K\u00f6nig, B.: Hypergraph construction and its application to the static analysis of concurrent systems. Math. Struct. Comput. Sci. 12(2), 149\u2013175 (2002)","journal-title":"Math. Struct. Comput. Sci."},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/11691372_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B K\u00f6nig","year":"2006","unstructured":"K\u00f6nig, B., Kozioura, V.: Counterexample-guided abstraction refinement for the analysis of graph transformation systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 197\u2013211. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691372_13"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, B., Kozioura, V.: Augur\u00a02\u2014a new version of a tool for the analysis of graph transformation systems. In: Proceedings of GT-VMT \u201906 (Workshop on Graph Transformation and Visual Modeling Techniques). ENTCS, vol.\u00a0211, pp. 201\u2013210. Elsevier (2008)","DOI":"10.1016\/j.entcs.2008.04.042"},{"key":"8_CR27","unstructured":"K\u00f6nig, B., Rensink, A., Stoltenow, L., Urrigshardt, F.: Counterexample-guided abstraction refinement for generalized graph transformation systems (full version) (2025). arXiv:2504.08617"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. RAIRO \u2013 Theor. Inf. Appl. 39(3) (2005)","DOI":"10.1051\/ita:2005028"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-09108-2_2","volume-title":"Graph Transformation","author":"L Lambers","year":"2014","unstructured":"Lambers, L., Orejas, F.: Tableau-based reasoning for graph properties. In: Giese, H., K\u00f6nig, B. (eds.) ICGT 2014. LNCS, vol. 8571, pp. 17\u201332. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09108-2_2"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Leifer, J.J.: Operational congruences for reactive systems. Ph.D. thesis, University of Cambridge Computer Laboratory (2001)","DOI":"10.1007\/3-540-44618-4_19"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"JJ Leifer","year":"2000","unstructured":"Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243\u2013258. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44618-4_19"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1\u201313. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_1"},{"key":"8_CR33","volume":"114","author":"N Nassar","year":"2020","unstructured":"Nassar, N., Kosiol, J., Arendt, T., Taentzer, G.: Constructing optimized constraint-preserving application conditions for model transformation rules. J. Logic Algeb. Program. 114, 100564 (2020)","journal-title":"J. Logic Algeb. Program."},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Overbeek, R., Endrullis, J.: Termination of graph transformation systems using weighted subgraph counting. Logical Methods Comput. Sci. 20(4) (2024)","DOI":"10.46298\/lmcs-20(4:12)2024"},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"\u00d6zkan, O.: Decidability of resilience for well-structured graph transformation systems. In: Proceedings of ICGT \u201922. LNCS, vol. 13349, pp. 38\u201357. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-09843-7_3","DOI":"10.1007\/978-3-031-09843-7_3"},{"key":"8_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-15928-2_10","volume-title":"Graph Transformations","author":"CM Poskitt","year":"2010","unstructured":"Poskitt, C.M., Plump, D.: A hoare calculus for graph programs. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 139\u2013154. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15928-2_10"},{"key":"8_CR37","volume":"130","author":"CM Poskitt","year":"2023","unstructured":"Poskitt, C.M., Plump, D.: Monadic second-order incorrectness logic for GP 2. J. Logic Algeb. Program. 130, 100825 (2023)","journal-title":"J. Logic Algeb. Program."},{"key":"8_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-25959-6_40","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: The GROOVE simulator: a\u00a0tool for state space generation. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 479\u2013485. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25959-6_40"},{"key":"8_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-24725-8_28","volume-title":"Programming Languages and Systems","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Canonical graph shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 401\u2013415. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24725-8_28"},{"key":"8_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-30203-2_23","volume-title":"Graph Transformations","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319\u2013335. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30203-2_23"},{"key":"8_CR41","doi-asserted-by":"publisher","unstructured":"Rensink, A., Corradini, A.: On categories of nested conditions. In: Principles of Verification: Cycling the Probabilistic Landscape \u2013 Essays Dedicated to Joost-Pieter Katoen on the Occasion of His 60th Birthday, Part I. LNCS, vol. 15260, pp. 393\u2013418. Springer, Heidelberg (2025). DOI: https:\/\/doi.org\/10.1007\/978-3-031-75783-9_16","DOI":"10.1007\/978-3-031-75783-9_16"},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: Proceedings of LICS \u201905, pp. 311\u2013320. IEEE (2005)","DOI":"10.1109\/LICS.2005.40"},{"key":"8_CR43","unstructured":"Soboci\u0144ski, P.: Deriving process congruences from reaction rules. Ph.D. thesis, Department of Computer Science, University of Aarhus (2004)"},{"key":"8_CR44","unstructured":"Stoltenow, L., K\u00f6nig, B., Schneider, S., Corradini, A., Lambers, L., Orejas, F.: Coinductive techniques for checking satisfiability of generalized nested conditions. In: Proceedings of CONCUR \u201924. LIPIcs, vol.\u00a0311, pp. 39:1\u201339:20. Schloss Dagstuhl \u2013 Leibniz Center for Informatics (2024)"},{"key":"8_CR45","first-page":"79","volume":"252","author":"J St\u00fcckrath","year":"2017","unstructured":"St\u00fcckrath, J., K\u00f6nig, B.: A general framework for well-structured graph transformation systems. Inf. Comput. 252, 79\u201394 (2017)","journal-title":"Inf. Comput."},{"key":"8_CR46","unstructured":"Urrigshardt, F.: Counterexample-guided Abstraction Refinement for Reactive Systems. Master\u2019s thesis, Universit\u00e4t Duisburg-Essen (2024)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-94706-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:22:40Z","timestamp":1749727360000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-94706-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031947056","9783031947063"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-94706-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"13 June 2025","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":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Koblenz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}