{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:29:44Z","timestamp":1766068184790,"version":"build-2065373602"},"reference-count":82,"publisher":"Association for Computing Machinery (ACM)","issue":"8","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62032010, 62232001, and 62202220"],"award-info":[{"award-number":["62032010, 62232001, and 62202220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Collaborative Innovation Center of Novel Software Technology and Industrialization"},{"name":"Central Universities","award":["2024300364"],"award-info":[{"award-number":["2024300364"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2025,11,30]]},"abstract":"<jats:p>\n            Layered sparse value-flow analysis (SVFA) is a prominent static analysis for resolving program dependencies. Despite the significant progress, SVFA still suffers from scalability issue. In light of the natural, continuous evolution of software, we introduce\n            <jats:sans-serif>SILVA<\/jats:sans-serif>\n            , the first incremental layered SVFA that scales to large, real-world programs efficiently. At the core of\n            <jats:sans-serif>SILVA<\/jats:sans-serif>\n            lies a novel incremental pointer analysis and incremental Mod-Ref analysis. Our extensive experiments on large-scale, real-world C\/C++ programs demonstrate its effectiveness:\n            <jats:sans-serif>SILVA<\/jats:sans-serif>\n            achieves nearly a 7\u00d7 speedup over\n            <jats:sans-serif>SVF<\/jats:sans-serif>\n            , the state-of-the-art layered SVFA, without losing any precision. Moreover, our incremental pointer and Mod-Ref analysis algorithms are 12\u00d7 and 5\u00d7 faster than existing methods, respectively. Regarding the impact of the size of the code changes on\n            <jats:sans-serif>SILVA<\/jats:sans-serif>\n            \u2019s effectiveness, we find that\n            <jats:sans-serif>SILVA<\/jats:sans-serif>\n            outperforms\n            <jats:sans-serif>SVF<\/jats:sans-serif>\n            for changes up to 10K lines\u2014well beyond the typical scope of code commits in real-world software development.\n          <\/jats:p>","DOI":"10.1145\/3725214","type":"journal-article","created":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T10:21:05Z","timestamp":1742466065000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["SILVA: A Scalable Incremental Layered Sparse Value-Flow Analysis"],"prefix":"10.1145","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-5320-3724","authenticated-orcid":false,"given":"Jiayi","family":"Wang","sequence":"first","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, School of Computer Science, Nanjing University, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7216-6929","authenticated-orcid":false,"given":"Yu","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, School of Computer Science, Nanjing University, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0844-5023","authenticated-orcid":false,"given":"Ke","family":"Wang","sequence":"additional","affiliation":[{"name":"Visa Research, Foster City, California, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4794-1652","authenticated-orcid":false,"given":"Linzhang","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, School of Computer Science, Nanjing University, Nanjing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,10,4]]},"reference":[{"key":"e_1_3_3_2_2","unstructured":"Lars Ole Andersen. 1994. Program Analysis and Specialization for the C Programming Language. Ph.D. Dissertation. Citeseer."},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568243"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368118"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454099"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3436877"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3639220"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250789"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512538"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/646153.679523"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1013886.1007515"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485542"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277667"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11416-014-0203-1"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00027"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170066"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250767"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00034"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428267"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISSREW55968.2022.00038"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE52982.2021.00062"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3639092"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37051-9_3"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1201\/9780849332517"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3098572.3098578"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3632884"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/1217295.1217296"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3315568.3329968"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3492428"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3296979.3192390"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3527332"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3293606"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510075"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE56229.2023.00098"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/940071.940114"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37051-9_4"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22308-2_15"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-024-09819-3"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2501854"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9409"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2009.5306283"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","unstructured":"Esko Nuutila and Eljas Soisalon-Soininen. 1994. On finding the strongly connected components in a directed graph. Information Processing Letters 49 1 (1994) 9\u201314. DOI: 10.1016\/0020-0190(94)90047-7","DOI":"10.1016\/0020-0190(94)90047-7"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254092"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/1290520.1290524"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2009.9"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/1069774.1069785"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/11562931_19"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/2351676.2351720"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380346"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192418"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/1178625.1178628"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237727"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52592-0_76"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454044"},{"key":"e_1_3_3_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3648441"},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428301"},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/2854038.2854043"},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/2892208.2892235"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2018.09.038"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336784"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2014.2302311"},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276509"},{"key":"e_1_3_3_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454026"},{"key":"e_1_3_3_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970298"},{"key":"e_1_3_3_68_2","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_3_69_2","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM51674.2020.00008"},{"key":"e_1_3_3_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/3565800"},{"key":"e_1_3_3_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/358557.358577"},{"key":"e_1_3_3_72_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"key":"e_1_3_3_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996859"},{"key":"e_1_3_3_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081728"},{"key":"e_1_3_3_75_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00063"},{"key":"e_1_3_3_76_2","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180178"},{"key":"e_1_3_3_77_2","doi-asserted-by":"publisher","DOI":"10.1145\/3656400"},{"key":"e_1_3_3_78_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428252"},{"key":"e_1_3_3_79_2","doi-asserted-by":"publisher","DOI":"10.1145\/302405.302676"},{"key":"e_1_3_3_80_2","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24380"},{"key":"e_1_3_3_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950332"},{"key":"e_1_3_3_82_2","doi-asserted-by":"publisher","DOI":"10.1145\/3479394.3479415"},{"key":"e_1_3_3_83_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE-SEIP58684.2023.00048"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T11:08:32Z","timestamp":1759576112000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,4]]},"references-count":82,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,11,30]]}},"alternative-id":["10.1145\/3725214"],"URL":"https:\/\/doi.org\/10.1145\/3725214","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"type":"print","value":"1049-331X"},{"type":"electronic","value":"1557-7392"}],"subject":[],"published":{"date-parts":[[2025,10,4]]},"assertion":[{"value":"2024-08-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}