{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T05:34:26Z","timestamp":1769751266877,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030411022","type":"print"},{"value":"9783030411039","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41103-9_5","type":"book-chapter","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T10:04:59Z","timestamp":1581674699000},"page":"132-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Incremental Abstract Interpretation"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Seidl","sequence":"first","affiliation":[]},{"given":"Julian","family":"Erhard","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Vogler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,15]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.scico.2015.12.005","volume":"120","author":"G Amato","year":"2016","unstructured":"Amato, G., Scozzari, F., Seidl, H., Apinis, K., Vojdani, V.: Efficiently intertwining widening and narrowing. Sci. Comput. Program. 120, 1\u201324 (2016). \nhttps:\/\/doi.org\/10.1016\/j.scico.2015.12.005","journal-title":"Sci. Comput. Program."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-35182-2_12","volume-title":"Programming Languages and Systems","author":"K Apinis","year":"2012","unstructured":"Apinis, K., Seidl, H., Vojdani, V.: Side-effecting constraint systems: a swiss army knife for program analysis. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 157\u2013172. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35182-2_12"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-27810-0_14","volume-title":"Semantics, Logics, and Calculi","author":"K Apinis","year":"2016","unstructured":"Apinis, K., Seidl, H., Vojdani, V.: Enhancing top-down solving with widening and narrowing. In: Probst, C.W., Hankin, C., Hansen, R.R. (eds.) Semantics, Logics, and Calculi. LNCS, vol. 9560, pp. 272\u2013288. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27810-0_14"},{"key":"5_CR4","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.) 36th International Conference on Software Engineering, ICSE 2014, Hyderabad, India, 31 May \u201307 June 2014, pp. 288\u2013298. ACM (2014). \nhttps:\/\/doi.org\/10.1145\/2568225.2568243","DOI":"10.1145\/2568225.2568243"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bolduc, C.: Lessons learned: using a static analysis tool within a continuous integration system. In: 2016 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW), pp. 37\u201340. IEEE (2016)","DOI":"10.1109\/ISSREW.2016.48"},{"key":"5_CR6","first-page":"237","volume-title":"Formal Descriptions of Programming Concepts","author":"P Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive programs. In: Neuhold, E. (ed.) Formal Descriptions of Programming Concepts, pp. 237\u2013277. North-Holland Publishing Company, Amsterdam (1977)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-55844-6_142","volume-title":"Programming Language Implementation and Logic Programming","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 269\u2013295. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/3-540-55844-6_142"},{"key":"5_CR8","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). \nhttps:\/\/doi.org\/10.1007\/3-540-45937-5_13"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2008.06.039","volume":"217","author":"P Emanuelsson","year":"2008","unstructured":"Emanuelsson, P., Nilsson, U.: A comparative study of industrial static analysis tools. Electron. Notes Theor. Comput. Sci. 217, 5\u201321 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10703-017-0288-5","volume":"53","author":"SS Frielinghaus","year":"2018","unstructured":"Frielinghaus, S.S., Seidl, H., Vogler, R.: Enforcing termination of interprocedural analysis. Formal Methods Syst. Design 53(2), 313\u2013338 (2018). \nhttps:\/\/doi.org\/10.1007\/s10703-017-0288-5","journal-title":"Formal Methods Syst. Design"},{"key":"5_CR11","unstructured":"Garcia-Contreras, I., Morales, J.F., Hermenegildo, M.V.: Towards incremental and modular context-sensitive analysis. In: Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). OpenAccess Series in Informatics (OASIcs). Dagstuhl Press, July 2018. (Extended Abstract)"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/349214.349216","volume":"22","author":"MV Hermenegildo","year":"2000","unstructured":"Hermenegildo, M.V., Puebla, G., Marriott, K., Stuckey, P.: Incremental analysis of constraint logic programs. ACM Trans. Program. Lang. Syst. 22(2), 187\u2013223 (2000)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Jones, N.D., Muchnick, S.S.: A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In: DeMillo, R.A. (ed.) Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, USA, January 1982, pp. 66\u201374. ACM Press (1982). \nhttps:\/\/doi.org\/10.1145\/582153.582161","DOI":"10.1145\/582153.582161"},{"key":"5_CR14","unstructured":"Muthukumar, K., Hermenegildo, M.: Deriving a fixpoint computation algorithm for top-down abstract interpretation of logic programs. Technical report ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC), Austin, TX, April 1990"},{"key":"5_CR15","unstructured":"Karbyshev, A.: Monadic parametricity of second-order functionals. Ph.D. thesis, Technical University Munich (2013). \nhttp:\/\/nbn-resolving.de\/urn:nbn:de:bvb:91-diss-20130923-1144371-0-6"},{"key":"5_CR16","unstructured":"Le Charlier, B., Van Hentenryck, P.: A universal top-down fixpoint algorithm. Technical report CS-92-25. CS Department, Brown University (1992)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-14125-1_5","volume-title":"Logic-Based Program Synthesis and Transformation","author":"U Liqat","year":"2014","unstructured":"Liqat, U., et al.: Energy consumption analysis of programs based on XMOS ISA-level models. In: Gupta, G., Pe\u00f1a, R. (eds.) LOPSTR 2013. LNCS, vol. 8901, pp. 72\u201390. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-14125-1_5"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"O\u2019Hearn, P.W.: Continuous reasoning: scaling the impact of formal methods. In: Dawar, A., Gr\u00e4del, E. (eds.) Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, 09\u201312 July 2018, pp. 13\u201325. ACM (2018). \nhttps:\/\/doi.org\/10.1145\/3209108.3209109","DOI":"10.1145\/3209108.3209109"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-61739-6_47","volume-title":"Static Analysis","author":"G Puebla","year":"1996","unstructured":"Puebla, G., Hermenegildo, M.: Optimized algorithms for incremental analysis of logic programs. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol. 1145, pp. 270\u2013284. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61739-6_47"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Ramalingam, G., Reps, T.W.: A categorized bibliography on incremental computation. In: Deusen, M.S.V., Lang, B. (eds.) Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, USA, January 1993, pp. 502\u2013510. ACM Press (1993). \nhttps:\/\/doi.org\/10.1145\/158511.158710","DOI":"10.1145\/158511.158710"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.W.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267\u2013305 (1996). \nhttps:\/\/doi.org\/10.1006\/jagm.1996.0046","journal-title":"J. Algorithms"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Reps, T.W., Horwitz, S., Sagiv, S.: Precise interprocedural dataflow analysis via graph reachability. In: Cytron, R.K., Lee, P. (eds.) Conference Record of POPL 1995: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, 23\u201325 January 1995, pp. 49\u201361. ACM Press (1995). \nhttps:\/\/doi.org\/10.1145\/199448.199462","DOI":"10.1145\/199448.199462"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Seidl, H., Vogler, R.: Three improvements to the top-down solver. In: Sabel, D., Thiemann, P. (eds.) Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, PPDP 2018, Frankfurt am Main, Germany, 03\u201305 September 2018, pp. 21:1\u201321:14. ACM (2018). \nhttps:\/\/doi.org\/10.1145\/3236950.3236967","DOI":"10.1145\/3236950.3236967"},{"key":"5_CR24","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications","author":"M Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Muchnick, S., Jones, N. (eds.) Program Flow Analysis: Theory and Applications, pp. 189\u2013233. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Vojdani, V., Apinis, K., R\u00f5tov, V., Seidl, H., Vene, V., Vogler, R.: Static race detection for device drivers: the Goblint approach. In: Proceedings of the 31st IEEE\/ACM International Conference on Automated Software Engineering, ASE 2016, pp. 391\u2013402. ACM (2016). \nhttps:\/\/doi.org\/10.1145\/2970276.2970337","DOI":"10.1145\/2970276.2970337"}],"container-title":["Lecture Notes in Computer Science","From Lambda Calculus to Cybersecurity Through Program Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41103-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T19:08:17Z","timestamp":1581707297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41103-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030411022","9783030411039"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41103-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}