{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:18:59Z","timestamp":1771024739028,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540330509","type":"print"},{"value":"9783540330516","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11688839_3","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T12:41:48Z","timestamp":1143549708000},"page":"17-31","source":"Crossref","is-referenced-by-count":30,"title":["Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers"],"prefix":"10.1007","author":[{"given":"Teck Bok","family":"Tok","sequence":"first","affiliation":[]},{"given":"Samuel Z.","family":"Guyer","sequence":"additional","affiliation":[]},{"given":"Calvin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Ullman, J.D.: Node listings for reducible flow graphs. In: Proc. 7th Annual ACM Symp. on Theory of Computing, pp. 177\u2013185 (1975)","DOI":"10.1145\/800116.803767"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Atkinson, D.C., Griswold, W.G.: Implementation techniques for efficient data-flow analysis of large programs. In: Proc. IEEE Int\u2019l Conf. on Software Maintenance (ICSM 2001), November 2001, pp. 52\u201361 (2001)","DOI":"10.1109\/ICSM.2001.972711"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Choi, J., Burke, M., Carini, P.: Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In: POPL, pp. 232\u2013245 (1993)","DOI":"10.1145\/158511.158639"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Choi, J., Cytron, R., Ferrante, J.: Automatic construction of sparse data flow evaluation graphs. In: POPL, pp. 55\u201366 (1991)","DOI":"10.1145\/99583.99594"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Cobleigh, J.M., Clarke, L.A., Osterweil, L.J.: The right algorithm at the right time: comparing data flow analysis algorithms for finite state verification. In: Int\u2019l Conf. on Software Engineering, pp. 37\u201346 (May 2001)","DOI":"10.1109\/ICSE.2001.919079"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Foster, J.S., Terauchi, T., Aiken, A.: Flow-sensitive type qualifiers. In: ACM SIGPLAN 2002 Proc. 2002 PLDI, pp. 1\u201312 (June 2002)","DOI":"10.1145\/512529.512531"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-44898-5_12","volume-title":"Static Analysis","author":"S.Z. Guyer","year":"2003","unstructured":"Guyer, S.Z., Lin, C.: Client driven pointer analysis. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 214\u2013236. Springer, Heidelberg (2003)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Guyer, S.Z., Lin, C.: An annotation language for optimizing software libraries. In: 2nd Conf. on Domain Specific Languages, pp. 39\u201353 (October 1999)","DOI":"10.1145\/331960.331970"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Hind, M., Pioli, A.: Which pointer analysis should I use? In: ACM SIGSOFT Int\u2019l Symp. on Software Testing and Analysis (ISSTA 2000), pp. 113\u2013123 (August 2000)","DOI":"10.1145\/347324.348916"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-49727-7_4","volume-title":"Static Analysis","author":"M. Hind","year":"1998","unstructured":"Hind, M., Pioli, A.: Assessing the Effects of Flow-Sensitivity on Pointer Alias Analyses. In: Levi, G. (ed.) SAS 1998. LNCS, vol.\u00a01503, pp. 57\u201381. Springer, Heidelberg (1998)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T., Sagiv, M.: Demand interprocedural dataflow analysis. In: ACM 3rd Symp. on the Foundations of Software Engineering, pp. 104\u2013115 (1995)","DOI":"10.1145\/222124.222146"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Hecht, M.S., Ullman, J.D.: Analysis of a simple algorithm for global data flow problems. In: POPL, pp. 207\u2013217 (1973)","DOI":"10.1145\/512927.512946"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Kennedy, K.W.: Node listings applied to data flow analysis. In: Proc. 2th ACM Symp. on Principles of Programming Languages, pp. 10\u201321 (1975)","DOI":"10.1145\/512976.512978"},{"issue":"1","key":"3_CR14","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 ACM\u00a023(1), 158\u2013171 (1976)","journal-title":"Journal of ACM"},{"key":"3_CR15","unstructured":"Moon, S., et al.: SYZYGY \u2014 a framework for scalable cross-module IPO. In: 2004 Int\u2019l Symp. on Code Generation and Optimization with Special Emphasis on Feedback-Directed and Runtime Optimization, pp. 65\u201374 (March 2004)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Myers, E.M.: A precise inter-procedural data flow algorithm. In: Proc. 8th ACM Symp. on Principles of Programming Languages, January 1981, pp. 219\u2013230 (1981)","DOI":"10.1145\/567532.567556"},{"key":"3_CR17","unstructured":"Ramalingam, G.: On sparse evaluation representations. Research Report RC 21245(94831), IBM Research (July 1998)"},{"issue":"1","key":"3_CR18","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/383043.381532","volume":"23","author":"B.G. Ryder","year":"2001","unstructured":"Ryder, B.G., Landi, W.A., Stocks, P.A., Zhang, S., Altucher, R.: A schema for interprocedural modification side-effect analysis with pointer aliasing. ACM Transactions on Programming Languages and Systems\u00a023(1), 105\u2013186 (2001)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Rountev, A., Ryder, B.G., Landi, W.A.: Data-flow Analysis of Program Fragments. In: Proc. 7th Symposium on the Foundations of Software Engineering, pp. 235\u2013253 (September 1999)","DOI":"10.1007\/3-540-48166-4_15"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Ruf, E.: Partitioning dataflow analyses using types. In: Proc. 24th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pp. 15\u201326 (January 1997)","DOI":"10.1145\/263699.263705"},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/27632.27649","volume":"18","author":"B.G. Ryder","year":"1986","unstructured":"Ryder, B.G., Paull, M.C.: Elimination algorithms for data flow analysis. ACM Computing Surveys (CSUR)\u00a018(3), 277\u2013316 (1986)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"3_CR22","unstructured":"Tip, F.: A survey of program slicing techniques. Journal of Programming Languages\u00a03 (1995)"},{"issue":"2","key":"3_CR23","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/103135.103136","volume":"13","author":"M.N. Wegman","year":"1991","unstructured":"Wegman, M.N., Zadeck, F.K.: Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems\u00a013(2), 181\u2013210 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Whaley, J., Lam, M.S.: Cloning-Based Context-Sensitive Pointer Alias Analyses Using Binary Decision Diagrams. In: ACM SIGPLAN 2004 Proc. 2004 PLDI, pp. 131\u2013144 (June 2004)","DOI":"10.1145\/996841.996859"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Zhu, J., Calman, S.: Symbolic Pointer Analysis Revisited. In: ACM SIGPLAN 2004 Proc. 2004 PLDI, pp. 145\u2013157 (June 2004)","DOI":"10.1145\/996841.996860"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11688839_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,25]],"date-time":"2021-07-25T06:33:04Z","timestamp":1627194784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11688839_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330509","9783540330516"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11688839_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}