{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:14:54Z","timestamp":1775873694236,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031747755","type":"print"},{"value":"9783031747762","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-74776-2_6","type":"book-chapter","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:35:39Z","timestamp":1737351339000},"page":"147-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Synthesizing Abstract Transformers for\u00a0Reduced-Product Domains"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5826-0030","authenticated-orcid":false,"given":"Pankaj Kumar","family":"Kalita","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5676-9949","authenticated-orcid":false,"given":"Thomas","family":"Reps","sequence":"additional","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,1,21]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-662-54577-5_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Amadini","year":"2017","unstructured":"Amadini, R., et al.: Combining string abstract domains for Javascript analysis: an evaluation. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 41\u201357. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_3"},{"issue":"1\u20132","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2500000010","volume":"4","author":"S Gulwani","year":"2017","unstructured":"Gulwani, S., Polozov, O., Singh, R.: Program synthesis. Found. Trends Program. Lang. 4(1\u20132), 1\u2013119 (2017). https:\/\/doi.org\/10.1561\/2500000010","journal-title":"Found. Trends Program. Lang."},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM (1969). https:\/\/doi.org\/10.1145\/363235.363259","DOI":"10.1145\/363235.363259"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Kalita, P.K., Kumar, M.J., Roy, S.: Synthesis of semantic actions in attribute grammars (2022). https:\/\/doi.org\/10.34727\/2022\/isbn.978-3-85448-053-2_37","DOI":"10.34727\/2022\/isbn.978-3-85448-053-2_37"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Kalita, P.K., Muduli, S., D\u2019Antoni, L., Reps, T., Roy, S.: Synthesizing abstract transformers. In: OOPSLA2 (2022). https:\/\/doi.org\/10.1145\/3563334","DOI":"10.1145\/3563334"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Kalita, P.K., Muduli, S.K., D\u2019Antoni, L., Reps, T., Roy, S.: Synthesizing abstract transformers (artifact) (2022). https:\/\/doi.org\/10.5281\/zenodo.7092952","DOI":"10.5281\/zenodo.7092952"},{"key":"6_CR7","unstructured":"Kalita, P.K., Reps, T., Roy, S.: Synthesizing abstract transformers for reduced-product domains (2024). https:\/\/arxiv.org\/abs\/2408.04040"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Kalita, P.K., Reps, T., Roy, S.: Synthesizing abstract transformers for reduced-product domains (artifact) (2024). https:\/\/doi.org\/10.5281\/zenodo.13114725","DOI":"10.5281\/zenodo.13114725"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Kashyap, V., et al.: JSAI: a static analysis platform for JavaScript. In: FSE (2014). https:\/\/doi.org\/10.1145\/2635868.2635904","DOI":"10.1145\/2635868.2635904"},{"key":"6_CR10","unstructured":"Lee, H., Won, S., Jin, J., Cho, J., Ryu, S.: SAFE: formal specification and implementation of a scalable analysis framework for ECMAScript. In: FOOL (2012)"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Park, K., D\u2019Antoni, L., Reps, T.: Synthesizing specifications. Proc. ACM Program. Lang. 7(OOPSLA2) (2023). https:\/\/doi.org\/10.1145\/3622861","DOI":"10.1145\/3622861"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Reps, T., Sagiv, M., Yorsh, G.: Symbolic implementation of the best transformer. In: VMCAI (2004). https:\/\/doi.org\/10.1007\/978-3-540-24622-0_21","DOI":"10.1007\/978-3-540-24622-0_21"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-49122-5_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"T Reps","year":"2016","unstructured":"Reps, T., Thakur, A.: Automating abstract interpretation. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 3\u201340. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49122-5_1"},{"key":"6_CR14","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"},{"issue":"5","key":"6_CR15","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10009-012-0249-7","volume":"15","author":"A Solar-Lezama","year":"2013","unstructured":"Solar-Lezama, A.: Program sketching. STTT 15(5), 475\u2013495 (2013). https:\/\/doi.org\/10.1007\/s10009-012-0249-7","journal-title":"STTT"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-33125-1_10","volume-title":"Static Analysis","author":"A Thakur","year":"2012","unstructured":"Thakur, A., Elder, M., Reps, T.: Bilateral algorithms for symbolic abstraction. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 111\u2013128. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33125-1_10"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Thakur, A.V., Lal, A., Lim, J., Reps, T.W.: PostHat and all that: automating abstract interpretation. ENTCS 311 (2015). https:\/\/doi.org\/10.1016\/j.entcs.2015.02.003","DOI":"10.1016\/j.entcs.2015.02.003"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-31424-7_17","volume-title":"Computer Aided Verification","author":"A Thakur","year":"2012","unstructured":"Thakur, A., Reps, T.: A method for symbolic computation of abstract operations. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 174\u2013192. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_17"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Verma, A., Kalita, P.K., Pandey, A., Roy, S.: Interactive debugging of concurrent programs under relaxed memory models. In: CGO (2020). https:\/\/doi.org\/10.1145\/3368826.3377910","DOI":"10.1145\/3368826.3377910"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Verma, S., Roy, S.: Synergistic debug-repair of heap manipulations. In: FSE (2017). https:\/\/doi.org\/10.1145\/3106237.3106263","DOI":"10.1145\/3106237.3106263"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Wang, J., Sung, C., Raghothaman, M., Wang, C.: Data-driven synthesis of provably sound side channel analyses. In: ICSE (2021)","DOI":"10.1109\/ICSE43902.2021.00079"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-319-96145-3_22","volume-title":"Computer Aided Verification","author":"X Wang","year":"2018","unstructured":"Wang, X., Anderson, G., Dillig, I., McMillan, K.L.: Learning abstractions for program synthesis. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 407\u2013426. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_22"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74776-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:35:42Z","timestamp":1737351342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74776-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031747755","9783031747762"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74776-2_6","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":"21 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pasadena, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"20 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.splashcon.org\/home\/sas-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}