{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T00:29:46Z","timestamp":1772411386802,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642119699","type":"print"},{"value":"9783642119705","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11970-5_8","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T00:23:33Z","timestamp":1268007813000},"page":"124-144","source":"Crossref","is-referenced-by-count":44,"title":["Practical Extensions to the IFDS Algorithm"],"prefix":"10.1007","author":[{"given":"Nomair A.","family":"Naeem","sequence":"first","affiliation":[]},{"given":"Ond\u0159ej","family":"Lhot\u00e1k","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Rodriguez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., Garner, R., Hoffman, C., Khan, A.M., McKinley, K.S., Bentzur, R., Diwan, A., Feinberg, D., Frampton, D., Guyer, S.Z., Hirzel, M., Hosking, A., Jump, M., Lee, H., Moss, J.E.B., Phansalkar, A., Stefanovi\u0107, D., Van Drunen, T., von Dincklage, D., Wiedermann, B.: The DaCapo benchmarks: Java benchmarking development and analysis. In: OOPSLA 2006, pp. 169\u2013190 (2006)","DOI":"10.1145\/1167473.1167488"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: An efficient method of computing static single assignment form. In: POPL 1989, pp. 25\u201335 (1989)","DOI":"10.1145\/75277.75280"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Duesterwald, E., Gupta, R., Soffa, M.L.: Demand-driven computation of interprocedural data flow. In: POPL 1995, pp. 37\u201348 (1995)","DOI":"10.1145\/199448.199461"},{"issue":"6","key":"8_CR4","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1145\/267959.269970","volume":"19","author":"E. Duesterwald","year":"1997","unstructured":"Duesterwald, E., Gupta, R., Soffa, M.L.: A practical framework for demand-driven interprocedural data flow analysis. ACM Trans. Program. Lang. Syst.\u00a019(6), 992\u20131030 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"8_CR5","unstructured":"Dufour, B.: Objective quantification of program behaviour using dynamic metrics. Master\u2019s thesis, McGill University (June 2004)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Fink, S., Yahav, E., Dor, N., Ramalingam, G., Geay, E.: Effective typestate verification in the presence of aliasing. In: ISSTA 2006, pp. 133\u2013144 (2006)","DOI":"10.1145\/1146238.1146254"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1348250.1348255","volume":"17","author":"S.J. Fink","year":"2008","unstructured":"Fink, S.J., Yahav, E., Dor, N., Ramalingam, G., Geay, E.: Effective typestate verification in the presence of aliasing. ACM Trans. Softw. Eng. Methodol.\u00a017(2), 1\u201334 (2008)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T., Sagiv, M.: Demand interprocedural dataflow analysis. In: SIGSOFT FSE 1995, pp. 104\u2013115 (1995)","DOI":"10.1145\/222124.222146"},{"key":"8_CR9","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 Inf.\u00a07, 305\u2013317 (1977)","journal-title":"Acta Inf."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: POPL 1973, pp. 194\u2013206 (1973)","DOI":"10.1145\/512927.512945"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Lhot\u00e1k, O.: Comparing call graphs. In: PASTE 2007, pp. 37\u201342 (2007)","DOI":"10.1145\/1251535.1251542"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Naeem, N.A., Lhot\u00e1k, O.: Typestate-like analysis of multiple interacting objects. In: OOPSLA 2008, pp. 347\u2013366 (2008)","DOI":"10.1145\/1449955.1449792"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Naeem, N.A., Lhot\u00e1k, O.: Efficient alias set analysis using SSA form. In: ISMM 2009, pp. 79\u201388 (2009)","DOI":"10.1145\/1542431.1542443"},{"key":"8_CR14","unstructured":"Odersky, M., Spoon, L., Venners, B.: Programming in Scala. Artima Press (2008)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL 1995, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-57877-3_26","volume-title":"Compiler Construction","author":"T.W. Reps","year":"1994","unstructured":"Reps, T.W.: Solving demand versions of interprocedural analysis problems. In: Fritzson, P.A. (ed.) CC 1994. LNCS, vol.\u00a0786, pp. 389\u2013403. Springer, Heidelberg (1994)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11547662_20","volume-title":"Static Analysis","author":"N. Rinetzky","year":"2005","unstructured":"Rinetzky, N., Sagiv, M., Yahav, E.: Interprocedural shape analysis for cutpoint-free programs. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 284\u2013302. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(96)00072-2","volume":"167","author":"M. Sagiv","year":"1996","unstructured":"Sagiv, M., Reps, T., 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":"8_CR19","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.S., Jones, N.D. (eds.) Program Flow Analysis: Theory and Applications, ch. 7, pp. 189\u2013233. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Shoham, S., Yahav, E., Fink, S., Pistoia, M.: Static specification mining using automata-based abstractions. In: ISSTA 2007, pp. 174\u2013184 (2007)","DOI":"10.1145\/1273463.1273487"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Sundaresan, V., Hendren, L., Razafimahefa, C., Vall\u00e9e-Rai, R., Lam, P., Gagnon, E., Godin, C.: Practical virtual method call resolution for Java. In: OOPSLA 2000, pp. 264\u2013280 (2000)","DOI":"10.1145\/354222.353189"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-46423-9_2","volume-title":"Compiler Construction","author":"R. Vall\u00e9e-Rai","year":"2000","unstructured":"Vall\u00e9e-Rai, R., Gagnon, E., Hendren, L.J., Lam, P., Pominville, P., Sundaresan, V.: Optimizing Java bytecode using the Soot framework: is it feasible? In: Watt, D.A. (ed.) CC 2000. LNCS, vol.\u00a01781, pp. 18\u201334. Springer, Heidelberg (2000)"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-70545-1_36","volume-title":"Computer Aided Verification","author":"H. Yang","year":"2008","unstructured":"Yang, H., Lee, O., Berdine, J., Calcagno, C., Cook, B., Distefano, D., O\u2019Hearn, P.W.: Scalable shape analysis for systems code. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 385\u2013398. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11970-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:46:01Z","timestamp":1606185961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11970-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119699","9783642119705"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11970-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}