{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:28:06Z","timestamp":1760171286661,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031249495"},{"type":"electronic","value":"9783031249501"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-24950-1_14","type":"book-chapter","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T14:03:19Z","timestamp":1673877799000},"page":"296-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Result Invalidation for\u00a0Incremental Modular Analyses"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7475-576X","authenticated-orcid":false,"given":"Jens","family":"Van der Plas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9985-9808","authenticated-orcid":false,"given":"Quentin","family":"Sti\u00e9venart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1710-1268","authenticated-orcid":false,"given":"Coen","family":"De Roover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,17]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Andreasen, E.S., M\u00f8ller, A., Nielsen, B.B.: Systematic approaches for increasing soundness and precision of static analyzer. In: Proceedings of the 6th ACM SIGPLAN International Workshop on State of the Art in Program Analysis, SOAP 2017, pp. 31\u201336. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3088515.3088521","DOI":"10.1145\/3088515.3088521"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Arzt, S., Bodden, E.: Reviser: efficiently updating IDE-\/IFDS-based data-flow analyses in response to incremental program changes. In: Jalote, P., Briand, L.C., van der Hoek, A. (eds.) Proceedings of the 36th International Conference on Software Engineering, ICSE 2014, Hyderabad, India, 31 May\u201307 June 2014, pp. 288\u2013298. ACM Press, New York (2014). https:\/\/doi.org\/10.1145\/2568225.2568243","DOI":"10.1145\/2568225.2568243"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/78969.78963","volume":"12","author":"MG Burke","year":"1990","unstructured":"Burke, M.G.: An interval-based approach to exhaustive and incremental interprocedural data-flow analysis. ACM Trans. Program. Lang. Syst. 12(3), 341\u2013395 (1990). https:\/\/doi.org\/10.1145\/78969.78963","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Carroll, M.D., Ryder, B.G.: Incremental data flow analysis via dominator and attribute updates. In: Ferrante, J., Mager, P. (eds.) Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, San Diego, California, USA, 10\u201313 January 1988, pp. 274\u2013284. ACM Press (1988). https:\/\/doi.org\/10.1145\/73560.73584","DOI":"10.1145\/73560.73584"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45937-5_13","volume-title":"Compiler Construction","author":"P Cousot","year":"2002","unstructured":"Cousot, P., Cousot, R.: Modular static program analysis. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol. 2304, pp. 159\u2013179. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45937-5_13"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Falleri, J., Morandat, F., Blanc, X., Martinez, M., Monperrus, M.: Fine-grained and accurate source code differencing. In: Crnkovic, I., Chechik, M., Gr\u00fcnbacher, P. (eds.) ACM\/IEEE International Conference on Automated Software Engineering, ASE 2014, Vasteras, Sweden, 15\u201319 September 2014, pp. 313\u2013324. ACM, New York (2014). https:\/\/doi.org\/10.1145\/2642937.2642982","DOI":"10.1145\/2642937.2642982"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MS.2009.6","volume":"26","author":"HC Gall","year":"2009","unstructured":"Gall, H.C., Fluri, B., Pinzger, M.: Change analysis with evolizer and changedistiller. IEEE Softw. 26(1), 26\u201333 (2009). https:\/\/doi.org\/10.1109\/MS.2009.6","journal-title":"IEEE Softw."},{"key":"14_CR8","unstructured":"Garcia-Contreras, I., Caballero, J.F.M., Hermenegildo, M.V.: An Approach to Incremental and Modular Context-Sensitive Analysis (2018). http:\/\/oa.upm.es\/53067\/"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1017\/S1471068420000496","volume":"21","author":"I Garcia-Contreras","year":"2021","unstructured":"Garcia-Contreras, I., Morales, J.F., Hermenegildo, M.V.: Incremental and modular context-sensitive analysis. Theory Pract. Logic Program. 21(2), 196\u2013243 (2021). https:\/\/doi.org\/10.1017\/S1471068420000496","journal-title":"Theory Pract. Logic Program."},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Hattori, L., Lanza, M.: Syde: a tool for collaborative software development. In: Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering, ICSE 2010, vol. 2, p. 235\u2013238. Association for Computing Machinery, New York (2010). https:\/\/doi.org\/10.1145\/1810295.1810339","DOI":"10.1145\/1810295.1810339"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Liu, B., Huang, J., Rauchwerger, L.: Rethinking incremental and parallel pointer analysis. ACM Trans. Program. Lang. Syst. 41(1), 6:1\u20136:31 (2019)","DOI":"10.1145\/3293606"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-31057-7_5","volume-title":"ECOOP 2012 \u2013 Object-Oriented Programming","author":"S Negara","year":"2012","unstructured":"Negara, S., Vakilian, M., Chen, N., Johnson, R.E., Dig, D.: Is it dangerous to use version control histories to study source code evolution? In: Noble, J. (ed.) ECOOP 2012. LNCS, vol. 7313, pp. 79\u2013103. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31057-7_5"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Nichols, L., Emre, M., Hardekopf, B.: Fixpoint reuse for incremental JavaScript analysis. In: Grech, N., Lavoie, T. (eds.) Proceedings of the 8th ACM SIGPLAN International Workshop on State of the Art in Program Analysis, SOAP@PLDI 2019, Phoenix, AZ, USA, 22 June 2019, pp. 2\u20137. ACM (2019). https:\/\/doi.org\/10.1145\/3315568.3329964","DOI":"10.1145\/3315568.3329964"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Nicolay, J., Noguera, C., De Roover, C., De Meuter, W.: Determining dynamic coupling in JavaScript using object type inference. In: 2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM), pp. 126\u2013135. IEEE (2013)","DOI":"10.1109\/SCAM.2013.6648193"},{"issue":"12","key":"14_CR15","volume":"29","author":"J Nicolay","year":"2017","unstructured":"Nicolay, J., Sti\u00e9venart, Q., De Meuter, W., De Roover, C.: Purity analysis for JavaScript through abstract interpretation. J. Softw.: Evol. Process 29(12), e1889 (2017)","journal-title":"J. Softw.: Evol. Process"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-11245-5_12","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"J Nicolay","year":"2019","unstructured":"Nicolay, J., Sti\u00e9venart, Q., De Meuter, W., De Roover, C.: Effect-driven flow analysis. In: Enea, C., Piskac, R. (eds.) VMCAI 2019. LNCS, vol. 11388, pp. 247\u2013274. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11245-5_12"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Palikareva, H., Kuchta, T., Cadar, C.: Shadow of a doubt: testing for divergences between software versions. In: Dillon, L.K., Visser, W., Williams, L. (eds.) Proceedings of the 38th International Conference on Software Engineering, ICSE 2016, Austin, TX, USA, 14\u201322 May 2016, pp. 1181\u20131192. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2884781.2884845","DOI":"10.1145\/2884781.2884845"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Van der Plas, J., Sti\u00e9venart, Q., Van Es, N., De Roover, C.: Incremental flow analysis through computational dependency reification. In: 20th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2020, 27\u201328 September 2020, pp. 25\u201336. IEEE Computer Society (2020). https:\/\/doi.org\/10.1109\/SCAM51674.2020.00008","DOI":"10.1109\/SCAM51674.2020.00008"},{"issue":"12","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1109\/32.58766","volume":"15","author":"LL Pollock","year":"1989","unstructured":"Pollock, L.L., Soffa, M.L.: An incremental version of iterative data flow analysis. IEEE Trans. Softw. Eng. 15(12), 1537\u20131549 (1989). https:\/\/doi.org\/10.1109\/32.58766","journal-title":"IEEE Trans. Softw. Eng."},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Saha, D., Ramakrishnan, C.R.: Incremental and demand-driven points-to analysis using logic programming. In: Barahona, P., Felty, A.P. (eds.) Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, Lisbon, Portugal, 11\u201313 July 2005, pp. 117\u2013128. ACM (2005). https:\/\/doi.org\/10.1145\/1069774.1069785","DOI":"10.1145\/1069774.1069785"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Stievenart, Q., Nicolay, J., De Meuter, W., De Roover, C.: Detecting concurrency bugs in higher-order programs through abstract interpretation. In: Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, pp. 232\u2013243 (2015)","DOI":"10.1145\/2790449.2790530"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jss.2018.10.001","volume":"147","author":"Q Sti\u00e9venart","year":"2019","unstructured":"Sti\u00e9venart, Q., Nicolay, J., De Meuter, W., De Roover, C.: A general method for rendering static analyses for diverse concurrency models modular. J. Syst. Softw. 147, 17\u201345 (2019). https:\/\/doi.org\/10.1016\/j.jss.2018.10.001","journal-title":"J. Syst. Softw."},{"key":"14_CR23","unstructured":"Szab\u00f3, T.: Incrementalizing static analyses in datalog. Doctoral dissertation, Johannes Gutenberg-Universit\u00e4t Mainz, Mainz, Germany (2021). http:\/\/doi.org\/10.25358\/openscience-5613"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Szab\u00f3, T., Bergmann, G., Erdweg, S., Voelter, M.: Incrementalizing lattice-based program analyses in Datalog. Proc. ACM Program. Lang. 2(OOPSLA), 1\u201329 (2018). https:\/\/doi.org\/10.1145\/3276509","DOI":"10.1145\/3276509"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Szab\u00f3, T., Erdweg, S., Bergmann, G.: Incremental whole-program analysis in datalog with lattices. In: Freund, S.N., Yahav, E. (eds.) Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI 2021, pp. 1\u201315. ACM, New York (2021). https:\/\/doi.org\/10.1145\/3453483.3454026","DOI":"10.1145\/3453483.3454026"},{"key":"14_CR26","unstructured":"Szab\u00f3, T., Bergmann, G., Erdweg, S.: Incrementalizing inter-procedural program analyses with recursive aggregation in Datalog, p. 3 (2019). Presented at the Second Workshop on Incremental Computing, IC 2019, Athens, Greece, 21 October 2019"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Szab\u00f3, T., Erdweg, S., Voelter, M.: IncA: a DSL for the definition of incremental program analyses. In: Lo, D., Apel, S., Khurshid, S. (eds.) Proceedings of the 31st IEEE\/ACM International Conference on Automated Software Engineering, ASE 2016, pp. 320\u2013331. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2970276.2970298","DOI":"10.1145\/2970276.2970298"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-37057-1_15","volume-title":"Fundamental Approaches to Software Engineering","author":"O Tripp","year":"2013","unstructured":"Tripp, O., Pistoia, M., Cousot, P., Cousot, R., Guarnieri, S.: Andromeda: accurate and scalable security analysis of web applications. In: Cortellessa, V., Varr\u00f3, D. (eds.) FASE 2013. LNCS, vol. 7793, pp. 210\u2013225. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37057-1_15"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Van Es, N., Van der Plas, J., Sti\u00e9venart, Q., De Roover, C.: MAF: a framework for modular static analysis of higher-order languages. In: 20th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2020, Adelaide, Australia, 27\u201328 September 2020. IEEE Computer Society (2020)","DOI":"10.1109\/SCAM51674.2020.00009"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Van Horn, D., Might, M.: Abstracting abstract machines. In: Hudak, P., Weirich, S. (eds.) Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP 2010, Baltimore, MD, USA, 27\u201329 September 2010, pp. 51\u201362. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1863543.1863553","DOI":"10.1145\/1863543.1863553"},{"issue":"2","key":"14_CR31","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1007\/s10664-019-09750-5","volume":"25","author":"C Vassallo","year":"2019","unstructured":"Vassallo, C., Panichella, S., Palomba, F., Proksch, S., Gall, H.C., Zaidman, A.: How developers engage with static analysis tools in different contexts. Empir. Softw. Eng. 25(2), 1419\u20131457 (2019). https:\/\/doi.org\/10.1007\/s10664-019-09750-5","journal-title":"Empir. Softw. Eng."},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Yoon, Y., Myers, B.A.: Capturing and analyzing low-level events from the code editor. In: Proceedings of the 3rd ACM SIGPLAN Workshop on Evaluation and Usability of Programming Languages and Tools, PLATEAU 2011, pp. 25\u201330. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/2089155.2089163","DOI":"10.1145\/2089155.2089163"},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"Yur, J., Ryder, B.G., Landi, W.: An incremental flow- and context-sensitive pointer aliasing analysis. In: Boehm, B.W., Garlan, D., Kramer, J. (eds.) Proceedings of the 1999 International Conference on Software Engineering, ICSE 1999, Los Angeles, CA, USA, 16\u201322 May 1999, pp. 442\u2013451. ACM (1999). https:\/\/doi.org\/10.1145\/302405.302676","DOI":"10.1145\/302405.302676"},{"key":"14_CR34","doi-asserted-by":"publisher","unstructured":"Zadeck, F.K.: Incremental data flow analysis in a structured program editor. In: Deusen, M.S.V., Graham, S.L. (eds.) Proceedings of the 1984 SIGPLAN Symposium on Compiler Construction, Montreal, Canada, 17\u201322 June 1984, pp. 132\u2013143. ACM (1984). https:\/\/doi.org\/10.1145\/502874.502888","DOI":"10.1145\/502874.502888"},{"key":"14_CR35","doi-asserted-by":"publisher","unstructured":"Zhan, S., Huang, J.: ECHO: instantaneous in situ race detection in the IDE. In: Proceedings of the 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2016, Seattle, WA, USA, 13\u201318 November 2016, pp. 775\u2013786 (2016). https:\/\/doi.org\/10.1145\/2950290.2950332","DOI":"10.1145\/2950290.2950332"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24950-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T14:04:30Z","timestamp":1715695470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24950-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031249495","9783031249501"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24950-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston, MA","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vmcai-2023.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}