{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T03:09:51Z","timestamp":1769224191071,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642157684","type":"print"},{"value":"9783642157691","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15769-1_20","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T02:09:40Z","timestamp":1284343780000},"page":"320-339","source":"Crossref","is-referenced-by-count":18,"title":["Interprocedural Analysis with Lazy Propagation"],"prefix":"10.1007","author":[{"given":"Simon Holm","family":"Jensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"M\u00f8ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Thiemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/11531142_19","volume-title":"ECOOP 2005 - Object-Oriented Programming","author":"C. Anderson","year":"2005","unstructured":"Anderson, C., Giannini, P., Drossopoulou, S.: Towards type inference for JavaScript. In: Black, A.P. (ed.) ECOOP 2005. LNCS, vol.\u00a03586, pp. 428\u2013452. Springer, Heidelberg (2005)"},{"key":"20_CR2","volume-title":"Proc. International Symposium on Software Testing and Analysis, ISSTA 2008","author":"S. Artzi","year":"2008","unstructured":"Artzi, S., Kiezun, A., Dolby, J., Tip, F., Dig, D., Paradkar, A.M., Ernst, M.D.: Finding bugs in dynamic web applications. In: Proc. International Symposium on Software Testing and Analysis, ISSTA 2008. ACM, New York (July2008)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Atkinson, D.C., Griswold, W.G.: Implementation techniques for efficient data-flow analysis of large programs. In: Proc. International Conference on Software Maintenance, ICSM 2001, pp. 52\u201361 (November 2001)","DOI":"10.1109\/ICSM.2001.972711"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11823230_15","volume-title":"Static Analysis","author":"G. Balakrishnan","year":"2006","unstructured":"Balakrishnan, G., Reps, T.W.: Recency-abstraction for heap-allocated storage. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 221\u2013239. Springer, Heidelberg (2006)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Chase, D.R., Wegman, M., Kenneth Zadeck, F.: Analysis of pointers and structures. In: Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 1990 (June 1990)","DOI":"10.1145\/93542.93585"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BFb0053565","volume-title":"Programming Languages and Systems","author":"C. Fecht","year":"1998","unstructured":"Fecht, C., Seidl, H.: Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol.\u00a01381, p. 90. Springer, Heidelberg (1998)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Selected Areas in Cryptography","author":"M. Furr","year":"2009","unstructured":"Furr, M., An, Jong hoon (David), Foster, J.S., Hicks, M.W.: Static type inference for Ruby. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol.\u00a05867, Springer, Heidelberg (2009)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Guha, A., Krishnamurthi, S., Jim, T.: Using static analysis for Ajax intrusion detection. In: Proc. 18th International Conference on World Wide Web, WWW 2009 (2009)","DOI":"10.1145\/1526709.1526785"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-14107-2_10","volume-title":"ECOOP 2010 \u2013 Object-Oriented Programming","author":"P. Heidegger","year":"2010","unstructured":"Heidegger, P., Thiemann, P.: Recency types for analyzing scripting languages. In: D\u2019Hondt, T. (ed.) ECOOP 2010. LNCS, vol.\u00a06183, pp. 200\u2013224. Springer, Heidelberg (2010)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Hind, M.: Pointer analysis: haven\u2019t we solved this problem yet? In: Proc. ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, PASTE 2001, pp. 54\u201361 (June 2001)","DOI":"10.1145\/379605.379665"},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1145\/325478.325519","volume":"21","author":"M. Hind","year":"1999","unstructured":"Hind, M., Burke, M.G., Carini, P.R., Choi, J.-D.: Interprocedural pointer alias analysis. ACM Transactions on Programming Languages and Systems\u00a021(4), 848\u2013894 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"6","key":"20_CR12","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/BF00282621","volume":"24","author":"S. Horwitz","year":"1987","unstructured":"Horwitz, S., Demers, A., Teitebaum, T.: An efficient general iterative algorithm for dataflow analysis. Acta Informatica\u00a024(6), 679\u2013694 (1987)","journal-title":"Acta Informatica"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T., Sagiv, M.: Demand interprocedural dataflow analysis. In: Proc. 3rd ACM SIGSOFT Symposium on Foundations of Software Engineering, FSE 1995 (October 1995)","DOI":"10.1145\/222124.222146"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-03237-0_17","volume-title":"Static Analysis","author":"S.H. Jensen","year":"2009","unstructured":"Jensen, S.H., M\u00f8ller, A., Thiemann, P.: Type analysis for JavaScript. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol.\u00a05673, pp. 238\u2013255. Springer, Heidelberg (2009)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Jensen, S.H., M\u00f8ller, A., Thiemann, P.: Interprocedural analysis with lazy propagation. Technical report, Department of Computer Science, Aarhus University (2010), http:\/\/cs.au.dk\/~amoeller\/papers\/lazy\/","DOI":"10.1007\/978-3-642-15769-1_20"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Jones, N.D., Muchnick, S.S.: A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In: Proc. 9th ACM Symposium on Principles of Programming Languages, POPL 1982 (January 1982)","DOI":"10.1145\/582153.582161"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J.B. Kam","year":"1976","unstructured":"Kam, J.B., Ullman, J.D.: Global data flow analysis and iterative algorithms. Journal of the ACM\u00a023(1), 158\u2013171 (1976)","journal-title":"Journal of the ACM"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"J.B. Kam","year":"1977","unstructured":"Kam, J.B., Ullman, J.D.: Monotone data flow analysis frameworks. Acta Informatica\u00a07, 305\u2013317 (1977)","journal-title":"Acta Informatica"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: Proc. 1st ACM Symposium on Principles of Programming Languages. In: POPL 1973 (October 1973)","DOI":"10.1145\/512927.512945"},{"issue":"4","key":"20_CR20","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/942572.807045","volume":"9","author":"B. Liskov","year":"1974","unstructured":"Liskov, B., Zilles, S.N.: Programming with abstract data types. ACM SIGPLAN Notices\u00a09(4), 50\u201359 (1974)","journal-title":"ACM SIGPLAN Notices"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44802-0_1","volume-title":"Computer Science Logic","author":"P.W. O\u2019Hearn","year":"2001","unstructured":"O\u2019Hearn, P.W., Reynolds, J.C., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, p. 1. Springer, Heidelberg (2001)"},{"key":"20_CR22","volume-title":"The Implementation of Functional Programming Languages","author":"S.L.P. Jones","year":"1987","unstructured":"Jones, S.L.P.: The Implementation of Functional Programming Languages. Prentice Hall, Englewood Cliffs (1987)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Proc. 22th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u00a0 1995, pp. 49\u201361 (January 1995)","DOI":"10.1145\/199448.199462"},{"issue":"2","key":"20_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/383043.381532","volume":"23","author":"B.G. Ryder","year":"2001","unstructured":"Ryder, B.G., Landi, W., Stocks, P., Zhang, S., Altucher, R.: A schema for interprocedural modification side-effect analysis with pointer aliasing. ACM Transactions on Programming Languages and Systems\u00a023(2), 105\u2013186 (2001)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1&2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(96)00072-2","volume":"167","author":"S. Sagiv","year":"1996","unstructured":"Sagiv, S., Reps, T.W., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science\u00a0167(1&2), 131\u2013170 (1996)","journal-title":"Theoretical Computer Science"},{"key":"20_CR26","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 dataflow analysis. In: Program Flow Analysis: Theory and Applications, pp. 189\u2013233. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/978-3-540-31987-0_28","volume-title":"Programming Languages and Systems","author":"P. Thiemann","year":"2005","unstructured":"Thiemann, P.: Towards a type system for analyzing JavaScript programs. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 408\u2013422. Springer, Heidelberg (2005)"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11688839_3","volume-title":"Compiler Construction","author":"T.B. Tok","year":"2006","unstructured":"Tok, T.B., Guyer, S.Z., Lin, C.: Efficient flow-sensitive interprocedural data-flow analysis in the presence of pointers. In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 17\u201331. Springer, Heidelberg (2006)"},{"key":"20_CR29","unstructured":"Xie, Y., Aiken, A.: Static detection of security vulnerabilities in scripting languages. In: Proc. 15th USENIX Security Symposium (August 2006)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15769-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:40:18Z","timestamp":1606167618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15769-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157684","9783642157691"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15769-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}