{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:08Z","timestamp":1763468048511},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592938"},{"type":"electronic","value":"9783540492337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59293-8_226","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:12:46Z","timestamp":1330276366000},"page":"651-665","source":"Crossref","is-referenced-by-count":14,"title":["Precise interprocedural dataflow analysis with applications to constant propagation"],"prefix":"10.1007","author":[{"given":"Mooly","family":"Sagiv","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[]},{"given":"Susan","family":"Horwitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"D. Callahan. The program summary graph and flow-sensitive interprocedural data flow analysis. In SIGPLAN Conference on Programming Languages Design and Implementation, pages 47\u201356, 1988.","DOI":"10.1145\/960116.53995"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"D. Callahan, K.D. Cooper, K. Kennedy, and L. Torczon. Interprocedural constant propagation. In SIGPLAN Symposium on Compiler Construction, pages 152\u2013161, 1986.","DOI":"10.1145\/12276.13327"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"E. Duesterwald, R. Gupta, and M.L. Soffa. Demand-driven computation of interprocedural data flow. In ACM Symposium on Principles of Programming Languages, pages 37\u201348, 1995.","DOI":"10.1145\/199448.199461"},{"key":"43_CR4","volume-title":"Crafting a Compiler","author":"C.N. Fischer","year":"1988","unstructured":"C.N. Fischer and R.J. LeBlanc. Crafting a Compiler. Benjamin\/Cummings Publishing Company, Inc., Menlo Park, CA, 1988."},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"D. Grove and L. Torczon. A study of jump function implementations. In SIGPLAN Conference on Programming Languages Design and Implementation, pages 90\u201399, 1993.","DOI":"10.1145\/173262.155099"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. Unpublished manuscript, 1995.","DOI":"10.1145\/222124.222146"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"N.D. Jones and A. Mycroft. Data flow analysis of applicative programs using minimal function graphs. In ACM Symposium on Principles of Programming Languages, pages 296\u2013306, 1986.","DOI":"10.1145\/512644.512672"},{"key":"43_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M. Karr","year":"1976","unstructured":"M. Karr. Affine relationship among variables of a program. Acta Inf., 6:133\u2013151, 1976.","journal-title":"Acta Inf."},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"G.A. Kildall. A unified approach to global program optimization. In ACM Symposium on Principles of Programming Languages, pages 194\u2013206, 1973.","DOI":"10.1145\/512927.512945"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"J. Knoop and B. Steffen. The interprocedural coincidence theorem. In International Conference on Compiler Construction, pages 125\u2013140, 1992.","DOI":"10.1007\/3-540-55984-1_13"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"W. Landi and B.G. Ryder. Pointer induced aliasing: A problem classification. In ACM Symposium on Principles of Programming Languages, pages 93\u2013103, 1991.","DOI":"10.1145\/99583.99599"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"R. Metzger and S. Stroud. Interprocedural constant propagation: An empirical study. ACM Letters on Programming Languages and Systems, 2, 1993.","DOI":"10.1145\/176454.176526"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"T. Reps. Solving demand versions of interprocedural analysis problems. In International Conference on Compiler Construction, pages 389\u2013403, 1994.","DOI":"10.1007\/3-540-57877-3_26"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In ACM Symposium on Principles of Programming Languages, pages 49\u201361, 1995.","DOI":"10.1145\/199448.199462"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"T. Reps, M. Sagiv, and S. Horwitz. Interprocedural dataflow analysis via graph reachability. Technical Report TR 94-14, Datalogisk Institut, University of Copenhagen, 1994.","DOI":"10.1145\/199448.199462"},{"issue":"2","key":"43_CR16","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(91)90392-F","volume":"80","author":"B. Steffen","year":"1991","unstructured":"B. Steffen and J. Knoop. Finite constants: Characterizations of a new decidable set of constants. Theoretical Computer Science, 80(2):303\u2013318, 1991.","journal-title":"Theoretical Computer Science"},{"key":"43_CR17","unstructured":"M. Sharir and A. Pnueli. Two approaches for interprocedural data flow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189\u2013234. Prentice-Hall, 1981."},{"key":"43_CR18","unstructured":"SPEC Component CPU Integer Release 2\/1992 (Cint92). Standard Performance Evaluation Corporation (SPEC), Fairfax, VA, 1992."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '95: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59293-8_226.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:08:12Z","timestamp":1640941692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59293-8_226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592938","9783540492337"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-59293-8_226","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}