{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:03:47Z","timestamp":1773479027846,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":44,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819535842","type":"print"},{"value":"9789819535859","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T00:00:00Z","timestamp":1761868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T00:00:00Z","timestamp":1761868800000},"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-981-95-3585-9_4","type":"book-chapter","created":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:06:30Z","timestamp":1761804390000},"page":"67-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reachability is Decidable for\u00a0ATM-Typable Finitary PCF with\u00a0Effect Handlers"],"prefix":"10.1007","author":[{"given":"Ryunosuke","family":"Endo","sequence":"first","affiliation":[]},{"given":"Tachio","family":"Terauchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,31]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Alvarez-Picallo, M., Freund, T., Ghica, D.R., Lindley, S.: Effect handlers for C via coroutines. Proc. ACM Program. Lang. 8(OOPSLA2), 2462\u20132489 (2024). https:\/\/doi.org\/10.1145\/3689798","DOI":"10.1145\/3689798"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Asai, K.: On typing delimited continuations: three new solutions to the printf problem. High. Order Symb. Comput. 22(3), 275\u2013291 (2009). https:\/\/doi.org\/10.1007\/s10990-009-9049-5","DOI":"10.1007\/s10990-009-9049-5"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ball, T., Majumdar, R., Millstein, T.D., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Snowbird, Utah, USA, 20\u201322 June 2001, pp. 203\u2013213. ACM (2001). https:\/\/doi.org\/10.1145\/378795.378846","DOI":"10.1145\/378795.378846"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.K.: The SLAM project: debugging system software via static analysis. In: Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, OR, USA, 16\u201318 January 2002, pp.\u00a01\u20133. ACM (2002). https:\/\/doi.org\/10.1145\/503272.503274","DOI":"10.1145\/503272.503274"},{"key":"4_CR5","unstructured":"Bauer, A.: What is algebraic about algebraic effects and handlers? CoRR abs\/1807.05923 (2018). http:\/\/arxiv.org\/abs\/1807.05923"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Brachth\u00e4user, J.I., Schuster, P., Ostermann, K.: Effect handlers for the masses. Proc. ACM Program. Lang. 2(OOPSLA), 111:1\u2013111:27 (2018). https:\/\/doi.org\/10.1145\/3276481","DOI":"10.1145\/3276481"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E Clarke","year":"2000","unstructured":"Clarke, E., 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"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Cook, B., Gotsman, A., Podelski, A., Rybalchenko, A., Vardi, M.Y.: Proving that programs eventually do something good. In: Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, 17\u201319 January 2007, pp. 265\u2013276. ACM (2007). https:\/\/doi.org\/10.1145\/1190216.1190257","DOI":"10.1145\/1190216.1190257"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, Ottawa, Ontario, Canada, 11\u201314 June 2006, pp. 415\u2013426. ACM (2006). https:\/\/doi.org\/10.1145\/1133981.1134029","DOI":"10.1145\/1133981.1134029"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: Proceedings of the 1990 ACM Conference on LISP and Functional Programming, LFP 1990, Nice, France, 27\u201329 June 1990, pp. 151\u2013160. ACM (1990). https:\/\/doi.org\/10.1145\/91556.91622","DOI":"10.1145\/91556.91622"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Endo, R., Terauchi, T.: Reachability is decidable for ATM-typable finitary PCF with effect handlers. CoRR abs\/2508.12572 (2025). https:\/\/arxiv.org\/abs\/2508.12572","DOI":"10.1007\/978-981-95-3585-9_4"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2000","unstructured":"Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 232\u2013247. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_20"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Ghica, D.R., Lindley, S., Bravo, M.M., Pir\u00f3g, M.: High-level effect handlers in C++. Proc. ACM Program. Lang. 6(OOPSLA2), 1639\u20131667 (2022). https:\/\/doi.org\/10.1145\/3563445","DOI":"10.1145\/3563445"},{"key":"4_CR14","unstructured":"Hillerstr\u00f6m, D., Lindley, S., Atkey, R., Sivaramakrishnan, K.C.: Continuation passing style for effect handlers. In: 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, Oxford, UK, 3\u20139 September 2017. LIPIcs, vol.\u00a084, pp. 18:1\u201318:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2017.18"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Kammar, O., Lindley, S., Oury, N.: Handlers in action. In: ACM SIGPLAN International Conference on Functional Programming, ICFP 2013, Boston, MA, USA, 25\u201327 September 2013, pp. 145\u2013158. ACM (2013). https:\/\/doi.org\/10.1145\/2500365.2500590","DOI":"10.1145\/2500365.2500590"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Kawamata, F., Unno, H., Sekiyama, T., Terauchi, T.: Answer refinement modification: refinement type system for algebraic effects and handlers. Proc. ACM Program. Lang. 8(POPL), 115\u2013147 (2024). https:\/\/doi.org\/10.1145\/3633280","DOI":"10.1145\/3633280"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, 21\u201323 January 2009, pp. 416\u2013428. ACM (2009). https:\/\/doi.org\/10.1145\/1480881.1480933","DOI":"10.1145\/1480881.1480933"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Kobayashi, N.: On decidable and undecidable extensions of simply typed lambda calculus. Proc. ACM Program. Lang. 9(POPL), 1136\u20131166 (2025). https:\/\/doi.org\/10.1145\/3704875","DOI":"10.1145\/3704875"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Sato, R., Unno, H.: Predicate abstraction and CEGAR for higher-order model checking. In: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011, San Jose, CA, USA, 4\u20138 June 2011, pp. 222\u2013233. ACM (2011). https:\/\/doi.org\/10.1145\/1993498.1993525","DOI":"10.1145\/1993498.1993525"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-54833-8_21","volume-title":"Programming Languages and Systems","author":"T Kuwahara","year":"2014","unstructured":"Kuwahara, T., Terauchi, T., Unno, H., Kobayashi, N.: Automatic termination verification for higher-order functional programs. In: Shao, Z. (ed.) ESOP 2014. LNCS, vol. 8410, pp. 392\u2013411. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54833-8_21"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Lago, U.D., Ghyselen, A.: On model-checking higher-order effectful programs. Proc. ACM Program. Lang. 8(POPL), 2610\u20132638 (2024). https:\/\/doi.org\/10.1145\/3632929","DOI":"10.1145\/3632929"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-71237-6_17","volume-title":"Programming Languages and Systems","author":"D Leijen","year":"2017","unstructured":"Leijen, D.: Implementing algebraic effects in C. In: Chang, B.-Y.E. (ed.) APLAS 2017. LNCS, vol. 10695, pp. 339\u2013363. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71237-6_17"},{"key":"4_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0954-6","volume-title":"Call-By-Push-Value: A Functional\/Imperative Synthesis, Semantics Structures in Computation","author":"PB Levy","year":"2004","unstructured":"Levy, P.B.: Call-By-Push-Value: A Functional\/Imperative Synthesis, Semantics Structures in Computation, vol. 2. Springer, Dordrecht (2004). https:\/\/doi.org\/10.1007\/978-94-007-0954-6"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Loader, R.: Finitary PCF is not decidable. Theor. Comput. Sci. 266(1-2), 341\u2013364 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00194-8","DOI":"10.1016\/S0304-3975(00)00194-8"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Materzok, M., Biernacki, D.: Subtyping delimited continuations. In: Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011, Tokyo, Japan, 19\u201321 September 2011, pp. 81\u201393. ACM (2011). https:\/\/doi.org\/10.1145\/2034773.2034786","DOI":"10.1145\/2034773.2034786"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Murase, A., Terauchi, T., Kobayashi, N., Sato, R., Unno, H.: Temporal verification of higher-order functional programs. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, 20\u201322 January 2016, pp. 57\u201368. ACM (2016). https:\/\/doi.org\/10.1145\/2837614.2837667","DOI":"10.1145\/2837614.2837667"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Ong, C.L.: On model-checking trees generated by higher-order recursion schemes. In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), Seattle, WA, USA, 12\u201315 August 2006, Proceedings, pp. 81\u201390. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/LICS.2006.38","DOI":"10.1109\/LICS.2006.38"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Ong, C.L., Ramsay, S.J.: Verifying higher-order functional programs with pattern-matching algebraic data types. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26\u201328 January 2011, pp. 587\u2013598. ACM (2011). https:\/\/doi.org\/10.1145\/1926385.1926453","DOI":"10.1145\/1926385.1926453"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45315-6_1","volume-title":"Foundations of Software Science and Computation Structures","author":"G Plotkin","year":"2001","unstructured":"Plotkin, G., Power, J.: Adequacy for algebraic effects. In: Honsell, F., Miculan, M. (eds.) FoSSaCS 2001. LNCS, vol. 2030, pp. 1\u201324. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45315-6_1"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-45931-6_24","volume-title":"Foundations of Software Science and Computation Structures","author":"G Plotkin","year":"2002","unstructured":"Plotkin, G., Power, J.: Notions of computation determine monads. In: Nielsen, M., Engberg, U. (eds.) FoSSaCS 2002. LNCS, vol. 2303, pp. 342\u2013356. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_24"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D., Power, J.: Algebraic operations and generic effects. Appl. Categorical Struct. 11(1), 69\u201394 (2003). https:\/\/doi.org\/10.1023\/A:1023064908962","DOI":"10.1023\/A:1023064908962"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D., Pretnar, M.: A logic for algebraic effects. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, Pittsburgh, PA, USA, 24\u201327 June 2008, pp. 118\u2013129. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/LICS.2008.45","DOI":"10.1109\/LICS.2008.45"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-00590-9_7","volume-title":"Programming Languages and Systems","author":"G Plotkin","year":"2009","unstructured":"Plotkin, G., Pretnar, M.: Handlers of algebraic effects. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 80\u201394. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00590-9_7"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Podelski, A., Rybalchenko, A.: Transition invariants. In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), Turku, Finland, 14\u201317 July 2004, Proceedings, pp. 32\u201341. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/LICS.2004.1319598","DOI":"10.1109\/LICS.2004.1319598"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Pretnar, M.: An introduction to algebraic effects and handlers. invited tutorial paper. In: The 31st Conference on the Mathematical Foundations of Programming Semantics, MFPS 2015, Nijmegen, The Netherlands, 22\u201325 June 2015. Electronic Notes in Theoretical Computer Science, vol.\u00a0319, pp. 19\u201335. Elsevier (2015). https:\/\/doi.org\/10.1016\/j.entcs.2015.12.003","DOI":"10.1016\/j.entcs.2015.12.003"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Ramsay, S.J., Neatherway, R.P., Ong, C.L.: A type-directed abstraction refinement approach to higher-order model checking. In: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, 20\u201321 January 2014, pp. 61\u201372. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535873","DOI":"10.1145\/2535838.2535873"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Sekiyama, T., Unno, H.: Higher-order model checking of effect-handling programs with answer-type modification. Proc. ACM Program. Lang. 8(OOPSLA2), 2662\u20132691 (2024). https:\/\/doi.org\/10.1145\/3689805","DOI":"10.1145\/3689805"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Sivaramakrishnan, K.C., Dolan, S., White, L., Kelly, T., Jaffer, S., Madhavapeddy, A.: Retrofitting effect handlers onto OCaml. In: PLDI 2021: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Virtual Event, Canada, 20\u201325 June 2021, pp. 206\u2013221. ACM (2021). https:\/\/doi.org\/10.1145\/3453483.3454039","DOI":"10.1145\/3453483.3454039"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Terauchi, T.: Dependent types from counterexamples. In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, 17\u201323 January 2010, pp. 119\u2013130. ACM (2010). https:\/\/doi.org\/10.1145\/1706299.1706315","DOI":"10.1145\/1706299.1706315"},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-12032-9_24","volume-title":"Foundations of Software Science and Computational Structures","author":"T Tsukada","year":"2010","unstructured":"Tsukada, T., Kobayashi, N.: Untyped recursion schemes and infinite intersection types. In: Ong, L. (ed.) FoSSaCS 2010. LNCS, vol. 6014, pp. 343\u2013357. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12032-9_24"},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-54830-7_12","volume-title":"Foundations of Software Science and Computation Structures","author":"T Tsukada","year":"2014","unstructured":"Tsukada, T., Kobayashi, N.: Complexity of model-checking call-by-value programs. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol. 8412, pp. 180\u2013194. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54830-7_12"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"Unno, H., Terauchi, T., Kobayashi, N.: Automating relatively complete verification of higher-order functional programs. In: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, Rome, Italy, 23\u201325 January 2013, pp. 75\u201386. ACM (2013). https:\/\/doi.org\/10.1145\/2429069.2429081","DOI":"10.1145\/2429069.2429081"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Verification of concurrent programs: the automata-theoretic framework. Ann. Pure Appl. Log. 51(1-2), 79\u201398 (1991). https:\/\/doi.org\/10.1016\/0168-0072(91)90066-U","DOI":"10.1016\/0168-0072(91)90066-U"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"Xie, N., Leijen, D.: Effect handlers in Haskell, evidently. In: Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell, Haskell@ICFP 2020, Virtual Event, USA, 7 August 2020, pp. 95\u2013108. ACM (2020). https:\/\/doi.org\/10.1145\/3406088.3409022","DOI":"10.1145\/3406088.3409022"}],"updated-by":[{"DOI":"10.1007\/978-981-95-3585-9_14","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T00:00:00Z","timestamp":1773446400000}}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3585-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T18:13:59Z","timestamp":1773425639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3585-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,31]]},"ISBN":["9789819535842","9789819535859"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3585-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,31]]},"assertion":[{"value":"31 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"14 March 2026","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","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 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 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":"aplas2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/track\/aplas-2025\/aplas-2025-aplas-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}