{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:58Z","timestamp":1725493498344},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672630"},{"type":"electronic","value":"9783540464235"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46423-9_7","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T19:48:40Z","timestamp":1193341720000},"page":"94-110","source":"Crossref","is-referenced-by-count":4,"title":["Constant Propagation on the Value Graph: Simple Constants and Beyond"],"prefix":"10.1007","author":[{"given":"Jens","family":"Knoop","sequence":"first","affiliation":[]},{"given":"Oliver","family":"R\u00fcthing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"7_CR1","unstructured":"A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1985. 94"},{"key":"7_CR2","first-page":"1","volume-title":"Conf. Rec. 15th Symp. Principles of Prog. Lang. (POPL\u201988)","author":"B. Alpern","year":"1988","unstructured":"B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In Conf. Rec. 15th Symp. Principles of Prog. Lang. (POPL\u201988), pages 1\u201311. ACM, NY, 1988. 95, 99, 107, 108"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1145\/12276.13327","volume":"21","author":"D. Callahan","year":"1986","unstructured":"D. Callahan, K. D. Cooper, K. W. Kennedy, and L. M. Torczon. Interprocedural constant propagation. In Proc. ACM SIGPLAN Symp. on Compiler Construction (SCC\u201986), volume 21, 7 of ACM SIGPLAN Not., pages 152\u2013161, 1986. 95, 107, 108","journal-title":"Proc. ACM SIGPLAN Symp. on Compiler Construction (SCC\u201986)"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/201059.201061","volume":"17","author":"C. Click","year":"1995","unstructured":"C. Click and K. D. Cooper. Combining analyses, combining optimizations. ACM Trans. Prog. Lang. Syst., 17(2):181\u2013196, 1995. 107, 108","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"7_CR5","volume-title":"Courant Inst. Math.","author":"J. Cocke","year":"1970","unstructured":"J. Cocke and J. T. Schwartz. Programming languages and their compilers. Courant Inst. Math. Sciences, NY, 1970. 107"},{"key":"7_CR6","first-page":"238","volume-title":"Conf. Rec. 4th Symp. Principles of Prog. Lang. (POPL\u201977)","author":"P. Cousot","year":"1977","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conf. Rec. 4th Symp. Principles of Prog. Lang. (POPL\u201977), pages 238\u2013252. ACM, NY, 1977. 98"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Prog. Lang. Syst., 13(4):451\u2013490, 1991. 99, 107","journal-title":"ACM Trans. Prog. Lang. Syst."},{"issue":"6","key":"7_CR8","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1145\/267959.269970","volume":"19","author":"E. Duesterwald","year":"1997","unstructured":"E. Duesterwald, R. Gupta, and M. L. Soffa. A practical framework for demand-driven interprocedural data flow analysis. ACM Trans. Prog. Lang. Syst., 19(6):992\u20131030, 1997. 95, 107","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"7_CR9","volume-title":"Conf. Rec. 10th Symp. on Principles of Prog. Lang. (POPL\u201983)","author":"J. Ferrante","year":"1983","unstructured":"J. Ferrante and K. J. Ottenstein. A program form based on data dependency in predicate regions. In Conf. Rec. 10th Symp. on Principles of Prog. Lang. (POPL\u201983). ACM, NY, 1983. 94, 95, 107, 108"},{"key":"7_CR10","volume-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, San Francisco, CA, 1979. 102"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/321921.321939","volume":"23","author":"S. L. Graham","year":"1976","unstructured":"S. L. Graham and M. N. Wegman. A fast and usually linear algorithm for global flow analysis. J. ACM, 23(1):172\u2013202, 1976. 98","journal-title":"J. ACM"},{"key":"7_CR12","first-page":"90","volume":"28","author":"D. Grove","year":"1993","unstructured":"D. Grove and L. Torczon. Interprocedural constant propagation: A study of jump function implementation. In Proc. ACM SIGPLAN Conf. on Prog. Lang. Design and Impl. (PLDI\u201993), volume 28,6 of ACM SIGPLAN Not., pages 90\u201399, 1993. 95, 107","journal-title":"Proc. ACM SIGPLAN Conf. on Prog. Lang. Design and Impl. (PLDI\u201993)"},{"issue":"SE-3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TSE.1977.231133","volume":"3","author":"W. H. Harrison","year":"1977","unstructured":"W. H. Harrison. Compiler analysis of the value range of variables. IEEE Trans. Softw. Eng., 3(SE-3):243\u2013250, 1977. 108","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/12276.13322","volume":"21","author":"H. Johnson","year":"1986","unstructured":"H. Johnson. Dataflow analysis for intractable systems software. In Proc ACM SIGPLAN Symp. on Compiler Construction (SCC\u201986), volume 21, 7 of ACM SIGPLAN Not., pages 109\u2013117, 1986. 108","journal-title":"Proc ACM SIGPLAN Symp. on Compiler Construction (SCC\u201986)"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J. B. Kam","year":"1976","unstructured":"J. B. Kam and J. D. Ullman. Global data flow analysis and iterative algorithms. J. ACM, 23(1):158\u2013171, 1976. 107","journal-title":"J. ACM"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"J. B. Kam","year":"1977","unstructured":"J. B. Kam and J. D. Ullman. Monotone data flow analysis frameworks. Acta Informatica, 7:305\u2013317, 1977. 94, 95, 97, 98, 99, 101, 102, 107, 108","journal-title":"Acta Informatica"},{"key":"7_CR17","volume-title":"Variable subsumption with constant folding","author":"K. Kennedy","year":"1973","unstructured":"K. Kennedy. Variable subsumption with constant folding, August 1973. Courant Institute of Mathematical Sciences, New York University, SETL Newsletter 112. 107"},{"key":"7_CR18","first-page":"5","volume-title":"Program Flow Analysis: Theory and Applications","author":"K. Kennedy","year":"1981","unstructured":"K. Kennedy. A survey of data flow analysis techniques. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 1, pages 5\u201354. Prentice Hall, Englewood Cliffs, NJ, 1981. 94, 107"},{"key":"7_CR19","first-page":"194","volume-title":"Conf. Rec. 1st Symp. Principles of Prog. Lang. (POPL\u201973)","author":"G. A. Kildall","year":"1973","unstructured":"G. A. Kildall. A unified approach to global program optimization. In Conf. Rec. 1st Symp. Principles of Prog. Lang. (POPL\u201973), pages 194\u2013206. ACM, NY, 1973. 94, 95, 97, 98, 107, 108"},{"key":"7_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/BFb0057887","volume-title":"Proc. 4th Europ. Conf. on Parallel Processing (Euro-Par\u201998)","author":"J. Knoop","year":"1998","unstructured":"J. Knoop. Parallel constant propagation. In Proc. 4th Europ. Conf. on Parallel Processing (Euro-Par\u201998), LNCS 1470, pages 445\u2013455. Springer-V., 1998. 95, 107"},{"issue":"5","key":"7_CR21","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1023\/A:1018772514882","volume":"26","author":"J. Lee","year":"1998","unstructured":"Jaejin Lee, S. P. Midkiff, and D. A. Padua. A constant propagation algorithm for explicitly parallel programs. Int. J. Parallel Programming, 26(5):563\u2013589, 1998. 95, 107","journal-title":"Int. J. Parallel Programming"},{"issue":"1\u20134","key":"7_CR22","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/176454.176526","volume":"2","author":"R. Metzger","year":"1993","unstructured":"R. Metzger and S. Stroud. Interprocedural constant propagation: An empirical study. ACM LOPLAS, 2(1\u20134):213\u2013232, 1993. 95, 107","journal-title":"ACM LOPLAS"},{"key":"7_CR23","volume-title":"Advanced Compiler Design and Implementation","author":"S. S. Muchnick","year":"1997","unstructured":"S. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco, CA, 1997. 94, 99, 101"},{"key":"7_CR24","first-page":"104","volume-title":"Conf. Rec. 4th Symp. Principles of Prog. Lang. (POPL\u201977)","author":"J. H. Reif","year":"1977","unstructured":"J. H. Reif and R. Lewis. Symbolic evaluation and the global value graph. In Conf. Rec. 4th Symp. Principles of Prog. Lang. (POPL\u201977), pages 104\u2013118. ACM, NY, 1977. 94, 95, 97, 107, 108"},{"key":"7_CR25","series-title":"Technical Report","volume-title":"Efficient symbolic analysis of programs","author":"J. H. Reif","year":"1982","unstructured":"J. H. Reif and R. Lewis. Efficient symbolic analysis of programs. Technical Report 37-82, Aiken Computation Laboratory, Harvard University, 1982. 94, 95, 107, 108"},{"key":"7_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-48294-6_15","volume-title":"Proc. 6th Static Analysis Symposium (SAS\u201999)","author":"O. R\u00fcthing","year":"1999","unstructured":"O. R\u00fcthing, J. Knoop, and B. Steffen. Detecting equalities of variables: Combining efficiency with precision. In Proc. 6th Static Analysis Symposium (SAS\u201999), LNCS 1694, pages 232\u2013247. Springer-V., 1999. 95, 108"},{"issue":"1\u20132","key":"7_CR27","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(96)00072-2","volume":"167","author":"M. Sagiv","year":"1996","unstructured":"M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. TCS, 167(1\u20132):131\u2013170, 1996. (Special issue devoted to TOPLAS\u201995). 95, 107","journal-title":"TCS"},{"issue":"2","key":"7_CR28","doi-asserted-by":"publisher","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. TCS, 80(2):303\u2013318, 1991. (Special issue devoted to MFCS\u201989). 94, 96, 102, 107","journal-title":"TCS"},{"issue":"SE-3","key":"7_CR29","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/TSE.1975.6312852","volume":"1","author":"B. Wegbreit","year":"1975","unstructured":"B. Wegbreit. Property extraction in well-founded property sets. IEEE Trans. Softw. Eng., 1(SE-3):270\u2013285, 1975. 107","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR30","first-page":"291","volume-title":"Conf. Rec. 12th Annual Symp. on Principles of Prog. Lang. (POPL\u201985)","author":"M. N. Wegman","year":"1985","unstructured":"M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. In Conf. Rec. 12th Annual Symp. on Principles of Prog. Lang. (POPL\u201985), pages 291\u2013299. ACM, New York, 1985. 94, 95, 96, 107, 108"},{"issue":"2","key":"7_CR31","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/103135.103136","volume":"13","author":"M. N. Wegman","year":"1991","unstructured":"M. N.Wegman and F. K. Zadeck. Constant propagation with conditional branches. ACM Trans. Prog. Lang. Syst., 13(2):181\u2013210, 1991. 94, 95, 96, 101, 107, 108","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"7_CR32","first-page":"132","volume-title":"Program Flow Analysis: Theory and Applications","author":"R. Wilhelm","year":"1981","unstructured":"R. Wilhelm. Global flow analysis and optimization in the MUG2 compiler generating system. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 5, pages 132\u2013159. Prentice Hall, Englewood Cliffs, NJ, 1981. 94"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46423-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T15:42:26Z","timestamp":1551022946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46423-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672630","9783540464235"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-46423-9_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}