{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:24:14Z","timestamp":1725578654831},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198601"},{"type":"electronic","value":"9783642198618"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19861-8_6","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T17:39:26Z","timestamp":1300124366000},"page":"82-103","source":"Crossref","is-referenced-by-count":4,"title":["Faster Alias Set Analysis Using Summaries"],"prefix":"10.1007","author":[{"given":"Nomair A.","family":"Naeem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Lhot\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48294-6_2","volume-title":"Static Analysis","author":"J. Aldrich","year":"1999","unstructured":"Aldrich, J., Chambers, C., Sirer, E.G., Eggers, S.J.: Static analyses for eliminating unnecessary synchronization from Java programs. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 19\u201338. Springer, Heidelberg (1999)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Allan, C., Avgustinov, P., Christensen, A.S., Hendren, L., Kuzins, S., Lhot\u00e1k, O., de Moor, O., Sereni, D., Sittampalam, G., Tibble, J.: Adding trace matching with free variables to AspectJ. In: OOPSLA 2005, pp. 345\u2013364 (2005)","DOI":"10.1145\/1103845.1094839"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: Escape analysis for object-oriented languages: application to Java. In: OOPSLA 1999, pp. 20\u201334 (1999)","DOI":"10.1145\/320385.320387"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Chatterjee, R., Ryder, B.G., Landi, W.A.: Relevant context inference. In: POPL 1999, pp. 133\u2013146 (1999)","DOI":"10.1145\/292540.292554"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, B.-C., Hwu, W.-M.W.: Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation. In: PLDI 2000, pp. 57\u201369 (2000)","DOI":"10.1145\/358438.349311"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Cherem, S., Rugina, R.: Compile-time deallocation of individual objects. In: ISMM 2006, pp. 138\u2013149 (2006)","DOI":"10.1145\/1133956.1133975"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-71229-9_12","volume-title":"Compiler Construction","author":"S. Cherem","year":"2007","unstructured":"Cherem, S., Rugina, R.: A practical escape and effect analysis for building lightweight method summaries. In: Adsul, B., Vetta, A. (eds.) CC 2007. LNCS, vol.\u00a04420, pp. 172\u2013186. Springer, Heidelberg (2007)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Choi, J.-D., Gupta, M., Serrano, M., Sreedhar, V.C., Midkiff, S.: Escape analysis for Java. In: OOPSLA 1999, pp. 1\u201319 (1999)","DOI":"10.1145\/320385.320386"},{"key":"6_CR9","unstructured":"Dufour, B.: Objective quantification of program behaviour using dynamic metrics. Master\u2019s thesis, McGill University (June 2004)"},{"issue":"2","key":"6_CR10","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":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-71316-6_18","volume-title":"Programming Languages and Systems","author":"S. Gulwani","year":"2007","unstructured":"Gulwani, S., Tiwari, A.: Computing procedure summaries for interprocedural analysis. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 253\u2013267. Springer, Heidelberg (2007)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Hind, M.: Pointer analysis: haven\u2019t we solved this problem yet? In: PASTE 2001, pp. 54\u201361 (2001)","DOI":"10.1145\/379605.379665"},{"key":"6_CR13","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\/222132.222146"},{"key":"6_CR14","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":"6_CR15","doi-asserted-by":"crossref","unstructured":"Lhot\u00e1k, O.: Comparing call graphs. In: PASTE 2007, pp. 37\u201342 (2007)","DOI":"10.1145\/1251535.1251542"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-36579-6_12","volume-title":"Compiler Construction","author":"O. Lhot\u00e1k","year":"2003","unstructured":"Lhot\u00e1k, O., Hendren, L.: Scaling Java points-to analysis using Spark. In: Hedin, G. (ed.) CC 2003. LNCS, vol.\u00a02622, pp. 153\u2013169. Springer, Heidelberg (2003)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Ma, K.-K., Foster, J.S.: Inferring aliasing and encapsulation properties for Java. In: OOPSLA 2007, pp. 423\u2013440 (2007)","DOI":"10.1145\/1297105.1297059"},{"key":"6_CR18","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":"6_CR19","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":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-11970-5_8","volume-title":"Compiler Construction","author":"N.A. Naeem","year":"2010","unstructured":"Naeem, N.A., Lhot\u00e1k, O., Rodriguez, J.: Practical extensions to the IFDS algorithm. In: Gupta, R. (ed.) CC 2010. LNCS, vol.\u00a06011, pp. 124\u2013144. Springer, Heidelberg (2010)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/11823230_26","volume-title":"Static Analysis","author":"M. Orlovich","year":"2006","unstructured":"Orlovich, M., Rugina, R.: Memory leak analysis by contradiction. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 405\u2013424. Springer, Heidelberg (2006)"},{"key":"6_CR22","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":"6_CR23","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\u00a0shape\u00a0analysis for\u00a0cutpoint-free\u00a0programs. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 284\u2013302. Springer, Heidelberg (2005)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-36579-6_10","volume-title":"Compiler Construction","author":"B.G. Ryder","year":"2003","unstructured":"Ryder, B.G.: Dimensions of precision in reference analysis of object-oriented programming languages. In: Hedin, G. (ed.) CC 2003. LNCS, vol.\u00a02622, pp. 126\u2013137. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"6_CR25","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"},{"issue":"1","key":"6_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/271510.271517","volume":"20","author":"M. Sagiv","year":"1998","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. ACM Trans. Program. Lang. Syst.\u00a020(1), 1\u201350 (1998)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR27","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":"6_CR28","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":"6_CR29","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":"6_CR30","doi-asserted-by":"crossref","unstructured":"Whaley, J., Rinard, M.: Compositional pointer and escape analysis for Java programs. In: OOPSLA 1999, pp. 187\u2013206 (1999)","DOI":"10.1145\/320385.320400"},{"key":"6_CR31","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)"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Yorsh, G., Yahav, E., Chandra, S.: Generating precise and concise procedure summaries. In: POPL 2008, pp. 221\u2013234 (2008)","DOI":"10.1145\/1328897.1328467"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19861-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:05:34Z","timestamp":1558436734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19861-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198601","9783642198618"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19861-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}