{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T19:14:03Z","timestamp":1773429243546,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":57,"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_10","type":"book-chapter","created":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:06:25Z","timestamp":1761804385000},"page":"195-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Specification Inference Modulo Oracles for\u00a0Database-Backed Web Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2850-4576","authenticated-orcid":false,"given":"Nitesh","family":"Trivedi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3394-023X","authenticated-orcid":false,"given":"Subhajit","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,31]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, P., Chandra, B., Emani, K.V., Garg, N., Sudarshan, S.: Test data generation for database applications. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 1621\u20131624. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00191"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1145\/2914770.2837628","volume":"51","author":"A Albarghouthi","year":"2016","unstructured":"Albarghouthi, A., Dillig, I., Gurfinkel, A.: Maximal specification synthesis. ACM SIGPLAN Notices 51(1), 789\u2013801 (2016)","journal-title":"ACM SIGPLAN Notices"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., et al.: Syntax-guided synthesis. IEEE (2013)","DOI":"10.1109\/FMCAD.2013.6679385"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Bao, J., Trivedi, N., Pathak, D., Hsu, J., Roy, S.: Data-driven invariant learning for probabilistic programs. In: Shoham, S., Vizel, Y. (eds.) CAV 2022. LNCS, vol. 13371. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-13185-1_3","DOI":"10.1007\/978-3-031-13185-1_3"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Bao, J., Trivedi, N., Pathak, D., Hsu, J., Roy, S.: Data-driven invariant learning for probabilistic programs (extended abstract). In: Elkind, E. (ed.) Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, pp. 6415\u20136419. International Joint Conferences on Artificial Intelligence Organization (Aug 2023). https:\/\/doi.org\/10.24963\/ijcai.2023\/712, sister Conferences Best Papers","DOI":"10.24963\/ijcai.2023\/712"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bao, J., Trivedi, N., Pathak, D., Hsu, J., Roy, S.: Data-driven invariant learning for probabilistic programs. Formal Methods Syst. Design, 1\u201329 (2024)","DOI":"10.21203\/rs.3.rs-3162619\/v1"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Bavishi, R., Pandey, A., Roy, S.: Regression aware debugging for mobile applications. In: Proceedings of the 1st International Workshop on Mobile Development, pp. 21\u201322 (2016)","DOI":"10.1145\/3001854.3001860"},{"issue":"10","key":"10_CR8","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1145\/3022671.2984014","volume":"51","author":"R Bavishi","year":"2016","unstructured":"Bavishi, R., Pandey, A., Roy, S.: To be precise: regression aware debugging. ACM SIGPLAN Not. 51(10), 897\u2013915 (2016)","journal-title":"ACM SIGPLAN Not."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Beyene, T., Chaudhuri, S., Popeea, C., Rybalchenko, A.: A constraint-based approach to solving games on infinite graphs. In: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 221\u2013233 (2014)","DOI":"10.1145\/2535838.2535860"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0004-3702(94)00025-V","volume":"77","author":"C Boutilier","year":"1995","unstructured":"Boutilier, C., Beche, V.: Abduction as belief revision. Artifi. Intell. 77(1), 43\u201394 (1995)","journal-title":"Artifi. Intell."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-21690-4_19","volume-title":"Computer Aided Verification","author":"A Das","year":"2015","unstructured":"Das, A., Lahiri, S.K., Lal, A., Li, Y.: Angelic verification: precise verification modulo unknowns. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 324\u2013342. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_19"},{"key":"10_CR12","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 Moura","year":"2008","unstructured":"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"},{"issue":"10","key":"10_CR13","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1145\/2544173.2509511","volume":"48","author":"I Dillig","year":"2013","unstructured":"Dillig, I., Dillig, T., Li, B., McMillan, K.: Inductive invariant generation via abductive inference. Acm Sigplan Notices 48(10), 443\u2013456 (2013)","journal-title":"Acm Sigplan Notices"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Dimovski, A.S.: Generalized program sketching by abstract interpretation and logical abduction. In: International Static Analysis Symposium. pp. 212\u2013230. Springer (2023)","DOI":"10.1007\/978-3-031-44245-2_11"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Doane, D.P., Seward, L.E.: Measuring skewness: a forgotten statistic? J. Statist. Educ. 19(2) (2011)","DOI":"10.1080\/10691898.2011.11889611"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Dutra, R., Bachrach, J., Sen, K.: Guidedsampler: coverage-guided sampling of smt solutions. In: 2019 Formal Methods in Computer Aided Design (FMCAD), pp. 203\u2013211. IEEE (2019)","DOI":"10.23919\/FMCAD.2019.8894251"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Dutra, R., Laeufer, K., Bachrach, J., Sen, K.: Efficient sampling of sat solutions for testing. In: Proceedings of the 40th International Conference on Software Engineering, pp. 549\u2013559 (2018)","DOI":"10.1145\/3180155.3180248"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-319-94205-6_19","volume-title":"Automated Reasoning","author":"M Echenim","year":"2018","unstructured":"Echenim, M., Peltier, N., Sellami, Y.: A generic framework for implicate generation modulo theories. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 279\u2013294. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_19"},{"issue":"1\u20133","key":"10_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.scico.2007.01.015","volume":"69","author":"MD Ernst","year":"2007","unstructured":"Ernst, M.D., et al.: The daikon system for dynamic detection of likely invariants. Sci. Comput. Program. 69(1\u20133), 35\u201345 (2007)","journal-title":"Sci. Comput. Program."},{"key":"10_CR20","unstructured":"ERPNext: Free and open source enterprise resource planning (erp). https:\/\/github.com\/frappe\/erpnext (Aug 2023)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Farzan, A., Nicolet, V.: Phased synthesis of divide and conquer programs. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pp. 974\u2013986 (2021)","DOI":"10.1145\/3453483.3454089"},{"issue":"2\u20133","key":"10_CR22","first-page":"129","volume":"3","author":"T Finin","year":"1989","unstructured":"Finin, T., Morris, G.: Abductive reasoning in multiple fault diagnosis. Artif. Intell. Rev. 3(2\u20133), 129\u2013158 (1989)","journal-title":"Artif. Intell. Rev."},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-662-48288-9_7","volume-title":"Static Analysis","author":"A Garg","year":"2015","unstructured":"Garg, A., Roy, S.: Synthesizing heap manipulations via integer linear programming. In: Blazy, S., Jensen, T. (eds.) SAS 2015. LNCS, vol. 9291, pp. 109\u2013127. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48288-9_7"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-030-53291-8_31","volume-title":"Computer Aided Verification","author":"P Golia","year":"2020","unstructured":"Golia, P., Roy, S., Meel, K.S.: Manthan: a data-driven approach for boolean function synthesis. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 611\u2013633. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_31"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Lam, E., Stuckey, P.J., Marques-Silva, J.: A scalable two stage approach to computing optimal decision sets. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a035, pp. 3806\u20133814 (2021)","DOI":"10.1609\/aaai.v35i5.16498"},{"issue":"OOPSLA2","key":"10_CR26","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1145\/3563334","volume":"6","author":"PK Kalita","year":"2022","unstructured":"Kalita, P.K., Muduli, S.K., D\u2019Antoni, L., Reps, T., Roy, S.: Synthesizing abstract transformers. Proc. ACM Programming Lang. 6(OOPSLA2), 1291\u20131319 (2022)","journal-title":"Proc. ACM Programming Lang."},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Kalita, P.K., Reps, T., Roy, S.: Synthesizing abstract transformers for reduced-product domains. In: Giacobazzi, R., Gorla, A. (eds.) SAS 2024. LNCS, vol. 14995. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-74776-2_6","DOI":"10.1007\/978-3-031-74776-2_6"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Kalita, P.K., Reps, T., Roy, S.: Automated abstract transformer synthesis for reduced product domains. ACM Trans. Softw. Eng. Methodol. (2025)","DOI":"10.1145\/3733716"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Lahiri, S., Kalita, P.K., Chittora, A.K., Vankudre, V., Roy, S.: Program synthesis meets visual what-comes-next puzzles. In: Proceedings of the 39th IEEE\/ACM International Conference on Automated Software Engineering, pp. 418\u2013429 (2024)","DOI":"10.1145\/3691620.3695015"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Lahiri, S., Roy, S.: Almost correct invariants: synthesizing inductive invariants by fuzzing proofs. In: Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 352\u2013364 (2022)","DOI":"10.1145\/3533767.3534381"},{"key":"10_CR31","unstructured":"de\u00a0Laplace, P.S.: Th\u00e9orie analytique des probabilit\u00e9s, vol.\u00a07. Courcier (1820)"},{"issue":"6","key":"10_CR32","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1145\/2813885.2738002","volume":"50","author":"A Leung","year":"2015","unstructured":"Leung, A., Sarracino, J., Lerner, S.: Interactive parser synthesis by example. ACM SIGPLAN Notices 50(6), 565\u2013574 (2015)","journal-title":"ACM SIGPLAN Notices"},{"key":"10_CR33","unstructured":"Marini, J.: Document object model. McGraw-Hill, Inc (2002)"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Muduli, S.K., Padulkar, R.R., Roy, S:. Interactive theorem proving modulo fuzzing. In: Gurfinkel, A., Ganesh, V. (eds.) CAV 2024. LNCS, vol. 14681. Springer, Cham (2024).https:\/\/doi.org\/10.1007\/978-3-031-65627-9_24","DOI":"10.1007\/978-3-031-65627-9_24"},{"issue":"OOPSLA2","key":"10_CR35","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1145\/3563332","volume":"6","author":"SK Muduli","year":"2022","unstructured":"Muduli, S.K., Roy, S.: Satisfiability modulo fuzzing: a synergistic combination of SMT solving and fuzzing. Proc. ACM Program. Lang. 6(OOPSLA2), 1236\u20131263 (2022)","journal-title":"Proc. ACM Program. Lang."},{"issue":"2","key":"10_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2491529","volume":"23","author":"K Pan","year":"2014","unstructured":"Pan, K., Wu, X., Xie, T.: Guided test generation for database applications via synthesized database interactions. ACM Trans. Softw. Eng. Methodol. (TOSEM) 23(2), 1\u201327 (2014)","journal-title":"ACM Trans. Softw. Eng. Methodol. (TOSEM)"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Pandey, A., Kotcharlakota, P.R.G., Roy, S.: Deferred concretization in symbolic execution via fuzzing. In: Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 228\u2013238 (2019)","DOI":"10.1145\/3293882.3330554"},{"key":"10_CR38","unstructured":"playwright: Framework for web testing and automation. https:\/\/github.com\/microsoft\/playwright (Aug 2023)"},{"key":"10_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-94583-1_13","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E Polgreen","year":"2022","unstructured":"Polgreen, E., Reynolds, A., Seshia, S.A.: Satisfiability and\u00a0synthesis modulo oracles. In: Finkbeiner, B., Wies, T. (eds.) VMCAI 2022. LNCS, vol. 13182, pp. 263\u2013284. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94583-1_13"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Prabhu, S., Fedyukovich, G., Madhukar, K., D\u2019Souza, D.: Specification synthesis with constrained horn clauses. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pp. 1203\u20131217 (2021)","DOI":"10.1145\/3453483.3454104"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Qiu, X., Solar-Lezama, A.: Natural synthesis of provably-correct data-structure manipulations. Proc. ACM Program. Lang. 1(OOPSLA), 1\u201328 (2017)","DOI":"10.1145\/3133889"},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-030-51074-9_9","volume-title":"Automated Reasoning","author":"A Reynolds","year":"2020","unstructured":"Reynolds, A., Barbosa, H., Larraz, D., Tinelli, C.: Scalable algorithms for abduction via enumerative syntax-guided synthesis. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12166, pp. 141\u2013160. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51074-9_9"},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-38856-9_9","volume-title":"Static Analysis","author":"S Roy","year":"2013","unstructured":"Roy, S.: From concrete examples to heap manipulating programs. In: Logozzo, F., F\u00e4hndrich, M. (eds.) SAS 2013. LNCS, vol. 7935, pp. 126\u2013149. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38856-9_9"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Roy, S., Hsu, J., Albarghouthi, A.: Learning differentially private mechanisms. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 852\u2013865. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00060"},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Roy, S., Pandey, A., Dolan-Gavitt, B., Hu, Y.: Bug synthesis: challenging bug-finding tools with deep faults. In: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, pp. 224\u2013234 (2018)","DOI":"10.1145\/3236024.3236084"},{"issue":"1","key":"10_CR46","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/61.568279","volume":"12","author":"T Sidhu","year":"1997","unstructured":"Sidhu, T., Cruder, O., Huff, G.: An abductive inference technique for fault diagnosis in electrical power transmission networks. IEEE Trans. Power Delivery 12(1), 515\u2013522 (1997)","journal-title":"IEEE Trans. Power Delivery"},{"key":"10_CR47","doi-asserted-by":"crossref","unstructured":"Singal, D., et al.: Parse condition: symbolic encoding of ll (1) parsing. In: LPAR, pp. 637\u2013655 (2018)","DOI":"10.29007\/2ndp"},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Verma, A., Kalita, P.K., Pandey, A., Roy, S.: Interactive debugging of concurrent programs under relaxed memory models. In: Proceedings of the 18th ACM\/IEEE International Symposium on Code Generation and Optimization, pp. 68\u201380 (2020)","DOI":"10.1145\/3368826.3377910"},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Verma, S., Roy, S.: Synergistic debug-repair of heap manipulations. In: Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, pp. 163\u2013173 (2017)","DOI":"10.1145\/3106237.3106263"},{"issue":"3","key":"10_CR50","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10703-021-00387-z","volume":"58","author":"S Verma","year":"2021","unstructured":"Verma, S., Roy, S.: Debug-localize-repair: a symbiotic construction for heap manipulations. Formal Methods Syst. Design 58(3), 399\u2013439 (2021)","journal-title":"Formal Methods Syst. Design"},{"key":"10_CR51","unstructured":"Veselovsky, V., Ribeiro, M.H., Arora, A., Josifoski, M., Anderson, A., West, R.: Generating faithful synthetic data with large language models: a case study in computational social science. arXiv preprint arXiv:2305.15041 (2023)"},{"issue":"158","key":"10_CR52","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/01621459.1927.10502953","volume":"22","author":"EB Wilson","year":"1927","unstructured":"Wilson, E.B.: Probable inference, the law of succession, and statistical inference. J. Am. Stat. Assoc. 22(158), 209\u2013212 (1927)","journal-title":"J. Am. Stat. Assoc."},{"key":"10_CR53","doi-asserted-by":"crossref","unstructured":"Wu, K., et al.: Automatic synthesis of generalized winning strategies of impartial combinatorial games using smt solvers. In: IJCAI, pp. 1703\u20131711 (2020)","DOI":"10.24963\/ijcai.2020\/236"},{"key":"10_CR54","doi-asserted-by":"crossref","unstructured":"Yan, C., Nath, S., Lu, S.: Generating test databases for database-backed applications. In: 2023 IEEE\/ACM 45th International Conference on Software Engineering (ICSE), pp. 2048\u20132059. IEEE (2023)","DOI":"10.1109\/ICSE48619.2023.00173"},{"issue":"1","key":"10_CR55","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S1571-0661(04)80663-7","volume":"86","author":"H Zhang","year":"2003","unstructured":"Zhang, H., Shen, H., Many\u00e0, F.: Exact algorithms for max-sat. Electr. Notes Theoret. Comput. Sci. 86(1), 190\u2013203 (2003)","journal-title":"Electr. Notes Theoret. Comput. Sci."},{"key":"10_CR56","unstructured":"Zhang, X., Chowdhury, R.R., Gupta, R.K., Shang, J.: Large language models for time series: A survey. arXiv preprint arXiv:2402.01801 (2024)"},{"key":"10_CR57","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Dickerson, R., Delaware, B., Jagannathan, S.: Data-driven abductive inference of library specifications. Proc. ACM Program. Lang. 5(OOPSLA), 1\u201329 (2021)","DOI":"10.1145\/3485493"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T18:14:37Z","timestamp":1773425677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3585-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,31]]},"ISBN":["9789819535842","9789819535859"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3585-9_10","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":"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"}}]}}