{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T14:06:29Z","timestamp":1779026789766,"version":"3.51.4"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032262196","type":"print"},{"value":"9783032262202","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\/4.0"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"vor","delay-in-days":137,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The principled combination of symbolic execution and random testing lacks a formal foundation, especially in deciding which inputs to symbolize. We propose selective concolic testing, a cost-aware framework that formulates this choice as an optimized policy problem of a MDP (Markov Decision Process). We model program exploration over a finite control-flow graph, where MDP states represent covered statements, actions partition path constraints into symbolic and random fragments, rewards reflect coverage gain, and costs account for SMT solving effort and sampling inefficiency. Our framework yields the first formal characterization of selective symbolization as policy synthesis in a probabilistic system. We prove that exact policy computation is intractable due to the exponential state space and the hardness of solution-density estimation via model counting. Our formulation enables a practical approximation: we partition constraint dependency graphs and use machine learning to predict solver timeouts, guiding per-constraint symbolization decisions. Built on top of KLEE and JFS, our prototype validates the approach on real-world floating-point benchmarks. Results show that selectively symbolizing inputs, guided by predicted solvability and cost, significantly improves coverage efficiency. Our work thus provides both a rigorous theoretical foundation and a practical instantiation for hybrid program analysis.<\/jats:p>","DOI":"10.1007\/978-3-032-26220-2_14","type":"book-chapter","created":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T13:21:42Z","timestamp":1779024102000},"page":"275-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Selective Concolic Testing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-2359-9687","authenticated-orcid":false,"given":"Guofeng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4066-7892","authenticated-orcid":false,"given":"Zhenbang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0575-5074","authenticated-orcid":false,"given":"Ziqi","family":"Shuai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3545-1392","authenticated-orcid":false,"given":"Jun","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijiang","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0637-8744","authenticated-orcid":false,"given":"Ji","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,18]]},"reference":[{"key":"14_CR1","unstructured":"Cephes mathematical function library (2025). https:\/\/www.netlib.org\/cephes\/. Accessed 12 Nov 2025"},{"key":"14_CR2","unstructured":"Freely distributable libm (2025). http:\/\/www.netlib.org\/fdlibm\/. Accessed 12 Nov 2025"},{"key":"14_CR3","unstructured":"Gsl - gnu scientific library (2025). https:\/\/www.gnu.org\/software\/gsl\/. Accessed 12 Nov 2025"},{"key":"14_CR4","unstructured":"Klee\u2019s kquery language (2025). https:\/\/klee.github.io\/docs\/kquery\/. Accessed 12 Nov 2025"},{"key":"14_CR5","unstructured":"Qf_lia logic (2025). https:\/\/smtlib.cs.uiowa.edu\/logics-all.shtml#QF_LIA. Accessed 12 Nov 2025"},{"key":"14_CR6","unstructured":"Smt-lib benchmark (2025). https:\/\/smtlib.cs.uiowa.edu\/benchmarks.shtml. Accessed 12 Nov 2025"},{"key":"14_CR7","unstructured":"Avgerinos, T., Cha, S.K., Hao, B.L.T., Brumley, D.: AEG: automatic exploit generation. In: NDSS 2011, San Diego, California, USA, 6th February\u20139th February 2011 (2011)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Baldoni, R., Coppa, E., D\u2019Elia, D.C., Demetrescu, C., Finocchi, I.: A survey of symbolic execution techniques. ACM Comput. Surv. 51(3), 50:1\u201350:39 (2018)","DOI":"10.1145\/3182657"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Burnim, J., Sen, K.: Heuristics for scalable dynamic test generation. In: 23rd IEEE\/ACM ASE 2008), L\u2019Aquila, Italy, 15\u201319 September 2008, pp. 443\u2013446 (2008)","DOI":"10.1109\/ASE.2008.69"},{"key":"14_CR10","unstructured":"Cadar, C., Dunbar, D., Engler, D.R.: KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In: 8th USENIX OSDI 2008, San Diego, California, USA, 8\u201310 December 2008 Proceedings, pp. 209\u2013224 (2008)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Cadar, C., Ganesh, V., Pawlowski, P.M., Dill, D.L., Engler, D.R.: EXE: automatically generating inputs of death. In: Proceedings of the 13th ACM CCS 2006, Alexandria, VA, USA, 30 October\u20133 November 2006, pp. 322\u2013335 (2006)","DOI":"10.1145\/1180405.1180445"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Cadar, C., et al.: Symbolic execution for software testing in practice: preliminary assessment. In: Proceedings of the 33rd ICSE 2011, Waikiki, Honolulu, HI, USA, 21\u201328 May 2011, pp. 1066\u20131071 (2011)","DOI":"10.1145\/1985793.1985995"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/2408776.2408795","volume":"56","author":"C Cadar","year":"2013","unstructured":"Cadar, C., Sen, K.: Symbolic execution for software testing: three decades later. Commun. ACM 56(2), 82\u201390 (2013)","journal-title":"Commun. ACM"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Cha, S.K., Avgerinos, T., Rebert, A., Brumley, D.: Unleashing mayhem on binary code. In: IEEE SP 2012, San Francisco, California, USA, 21\u201323 May 2012, pp. 380\u2013394 (2012)","DOI":"10.1109\/SP.2012.31"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Cha, S., Lee, S., Oh, H.: Template-guided concolic testing via online learning. In: Huchard, M., K\u00e4stner, C., Fraser, G. (eds.) Proceedings of the 33rd ASE 2018, Montpellier, France, 3\u20137 September 2018, pp. 408\u2013418. ACM (2018)","DOI":"10.1145\/3238147.3238227"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27:1\u201327:27 (2011), software available at http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm","DOI":"10.1145\/1961189.1961199"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Chen, Z., et al.: Synthesize solving strategy for symbolic execution. In: ISSTA 2021, Virtual Event, Denmark, 11\u201317 July 2021, pp. 348\u2013360 (2021)","DOI":"10.1145\/3460319.3464815"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Chistikov, D., Dimitrova, R., Majumdar, R.: Approximate counting in SMT and value estimation for probabilistic programs. In: TACAS 2015, London, UK, 11\u201318 April 2015. Proceedings, pp. 320\u2013334 (2015)","DOI":"10.1007\/978-3-662-46681-0_26"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Cui, H., Hu, G., Wu, J., Yang, J.: Verifying systems rules using rule-directed symbolic execution. In: ASPLOS 2013, Houston, TX, USA, 16\u201320 March 2013, pp. 329\u2013342 (2013)","DOI":"10.1145\/2451116.2451152"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Deng, X., Lee, J., Robby: Bogor\/Kiasan: a k-bounded symbolic execution for checking strong heap properties of open systems. In: 21st IEEE\/ACM ASE 2006, Tokyo, Japan, 18\u201322 September 2006, pp. 157\u2013166 (2006)","DOI":"10.1109\/ASE.2006.26"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Feinberg, E., Shwartz, A. (eds.): Handbook of Markov Decision Processes - Methods and Applications. Kluwer International Series (2002)","DOI":"10.1007\/978-1-4615-0805-2"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: Proceedings of the ACM SIGPLAN PLDI 2005, Chicago, IL, USA, 12\u201315 June 2005, pp. 213\u2013223 (2005)","DOI":"10.1145\/1065010.1065036"},{"key":"14_CR23","unstructured":"Godefroid, P., Levin, M.Y., Molnar, D.A.: Automated whitebox fuzz testing. In: NDSS 2008, San Diego, California, USA, 10th February\u201313th February 2008 (2008)"},{"key":"14_CR24","volume-title":"Contributions to Survey Sampling and Applied Statistics","author":"HO Hartley","year":"1978","unstructured":"Hartley, H.O.: Contributions to Survey Sampling and Applied Statistics. Academic Press, London (1978)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Hu, J., Duan, Y., Yin, H.: Marco: a stochastic asynchronous concolic explorer. In: Proceedings of the 46th IEEE\/ACM ICSE 2024, Lisbon, Portugal, 14\u201320 April 2024, pp. 59:1\u201359:12. ACM (2024)","DOI":"10.1145\/3597503.3623301"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Huang, H., Yao, P., Wu, R., Shi, Q., Zhang, C.: Pangolin: incremental hybrid fuzzing with polyhedral path abstraction. In: 2020 IEEE SP 2020, San Francisco, CA, USA, 18\u201321 May 2020, pp. 1613\u20131627 (2020)","DOI":"10.1109\/SP40000.2020.00063"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Murali, V., Navas, J.A.: Boosting concolic testing via interpolation. In: The ACM SIGSOFT ESEC\/FSE 2013, Saint Petersburg, Russian Federation, 18\u201326 August 2013, pp. 48\u201358 (2013)","DOI":"10.1145\/2491411.2491425"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Jia, X., Ghezzi, C., Ying, S.: Enhancing reuse of constraint solutions to improve symbolic execution. In: ISSTA 2015, Baltimore, MD, USA, 12\u201317 July 2015, pp. 177\u2013187 (2015)","DOI":"10.1145\/2771783.2771806"},{"issue":"1","key":"14_CR29","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Kim, K., Jeong, D.R., Kim, C.H., Jang, Y., Shin, I., Lee, B.: HFL: hybrid fuzzing on the Linux kernel. In: 27th NDSS 2020, San Diego, California, USA, 23\u201326 February 2020 (2020)","DOI":"10.14722\/ndss.2020.24018"},{"issue":"7","key":"14_CR31","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Le, H.M.: LLVM-based hybrid fuzzing with libkluzzer (competition contribution). In: FASE 2020, Dublin, Ireland, 25\u201330 April 2020, Proceedings, pp. 535\u2013539 (2020)","DOI":"10.1007\/978-3-030-45234-6_29"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Liew, D., Cadar, C., Donaldson, A.F., Stinnett, J.R.: Just fuzz it: solving floating-point constraints using coverage-guided fuzzing. In: Proceedings of the ACM ESEC\/SIGSOFT FSE 2019, Tallinn, Estonia, 26\u201330 August 2019, pp. 521\u2013532 (2019)","DOI":"10.1145\/3338906.3338921"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Lin, B., Chen, J., Xie, F.: Selective concolic testing for hardware trojan detection in behavioral systemc designs. In: 2020 Design, Automation & Test in Europe Conference & Exhibition, DATE 2020, Grenoble, France, 9\u201313 March 2020, pp. 19\u201324. IEEE (2020)","DOI":"10.23919\/DATE48585.2020.9116384"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-23702-7_11","volume-title":"Static Analysis","author":"K-K Ma","year":"2011","unstructured":"Ma, K.-K., Yit Phang, K., Foster, J.S., Hicks, M.: Directed symbolic execution. In: Yahav, E. (ed.) SAS 2011. LNCS, vol. 6887, pp. 95\u2013111. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23702-7_11"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Majumdar, R., Sen, K.: Hybrid concolic testing. In: 29th ICSE 2007, Minneapolis, MN, USA, 20\u201326 May 2007, pp. 416\u2013426 (2007)","DOI":"10.1109\/ICSE.2007.41"},{"key":"14_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Sen, K., Marinov, D., Agha, G.: CUTE: a concolic unit testing engine for C. In: The 13th ACM ESEC\/SIGSOFT FSE 2005, Lisbon, Portugal, 5\u20139 September 2005, pp. 263\u2013272 (2005)","DOI":"10.1145\/1095430.1081750"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Shuai, Z., Chen, Z., Zhang, Y., Sun, J., Wang, J.: Type and interval aware array constraint solving for symbolic execution. In: 30th ACM SIGSOFT ISSTA 2021, Virtual Event, Denmark, 11\u201317 July 2021, pp. 361\u2013373 (2021)","DOI":"10.1145\/3460319.3464826"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Stephens, N., et al.: Driller: augmenting fuzzing through selective symbolic execution. In: NDSS 2016, San Diego, California, USA, 21\u201324 February 2016 (2016)","DOI":"10.14722\/ndss.2016.23368"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Tillmann, N., de\u00a0Halleux, J.: Pex-white box test generation for .net. In: Tests and Proofs - 2nd International Conference, TAP 2008, Prato, Italy, 9\u201311 April 2008. Proceedings, pp. 134\u2013153 (2008)","DOI":"10.1007\/978-3-540-79124-9_10"},{"key":"14_CR42","doi-asserted-by":"crossref","unstructured":"Trabish, D., Mattavelli, A., Rinetzky, N., Cadar, C.: Chopped symbolic execution. In: Proceedings of the 40th ICSE 2018, Gothenburg, Sweden, 27 May\u201303 June 2018, pp. 350\u2013360 (2018)","DOI":"10.1145\/3180155.3180251"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"Visser, W., Geldenhuys, J., Dwyer, M.B.: Green: reducing, reusing and recycling constraints in program analysis. In: 20th ACM SIGSOFT SIGSOFT\/FSE 2012, Cary, NC, USA, 11\u201316 November 2012, p.\u00a058 (2012)","DOI":"10.1145\/2393596.2393665"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Wang, X., Sun, J., Chen, Z., Zhang, P., Wang, J., Lin, Y.: Towards optimal concolic testing. In: ICSE 2018, Gothenburg, Sweden, 27 May\u201303 June 2018, pp. 291\u2013302 (2018)","DOI":"10.1145\/3180155.3180177"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Xie, T., Tillmann, N., de\u00a0Halleux, J., Schulte, W.: Fitness-guided path exploration in dynamic symbolic execution. In: IEEE\/IFIP DSN 2009, Estoril, Lisbon, Portugal, 29 June\u20132 July 2009, pp. 359\u2013368 (2009)","DOI":"10.1109\/DSN.2009.5270315"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Yu, H., Chen, Z., Wang, J., Su, Z., Dong, W.: Symbolic verification of regular properties. In: Proceedings of the 40th ICSE 2018, Gothenburg, Sweden, 27 May\u201303 June 2018, pp. 871\u2013881 (2018)","DOI":"10.1145\/3180155.3180227"},{"key":"14_CR47","unstructured":"Yun, I., Lee, S., Xu, M., Jang, Y., Kim, T.: QSYM: a practical concolic execution engine tailored for hybrid fuzzing. In: 27th USENIX Security Symposium, USENIX Security 2018, Baltimore, MD, USA, 15\u201317 August 2018, pp. 745\u2013761 (2018)"},{"issue":"1\u20134","key":"14_CR48","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s13042-010-0001-0","volume":"1","author":"Y Zhang","year":"2010","unstructured":"Zhang, Y., Jin, R., Zhou, Z.: Understanding bag-of-words model: a statistical framework. Int. J. Mach. Learn. Cybern. 1(1\u20134), 43\u201352 (2010)","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"14_CR49","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Chen, Z., Shuai, Z., Zhang, T., Li, K., Wang, J.: Multiplex symbolic execution: exploring multiple paths by solving once. In: 35th IEEE\/ACM ASE 2020, Melbourne, Australia, 21\u201325 September 2020, pp. 846\u2013857 (2020)","DOI":"10.1145\/3324884.3416645"},{"key":"14_CR50","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Chen, Z., Wang, J., Dong, W., Liu, Z.: Regular property guided dynamic symbolic execution. In: ICSE 2015, Florence, Italy, 16\u201324 May 2015, vol. 1, pp. 643\u2013653 (2015)","DOI":"10.1109\/ICSE.2015.80"},{"key":"14_CR51","doi-asserted-by":"crossref","unstructured":"Zhao, L., Duan, Y., Yin, H., Xuan, J.: Send hardest problems my way: probabilistic path prioritization for hybrid fuzzing. In: NDSS 2019, San Diego, California, USA, 24\u201327 February 2019 (2019)","DOI":"10.14722\/ndss.2019.23504"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26220-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T13:21:48Z","timestamp":1779024108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26220-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032262196","9783032262202"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26220-2_14","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":"18 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"18 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/fm-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}