{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:04:25Z","timestamp":1742400265403,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212973"},{"type":"electronic","value":"9783540247234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24723-4_12","type":"book-chapter","created":{"date-parts":[[2010,7,28]],"date-time":"2010-07-28T00:14:24Z","timestamp":1280276064000},"page":"167-184","source":"Crossref","is-referenced-by-count":9,"title":["Value-Based Partial Redundancy Elimination"],"prefix":"10.1007","author":[{"given":"Thomas","family":"VanDrunen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antony L.","family":"Hosking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","volume-title":"Compilers\u2014principles, techniques, and tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers\u2014principles, techniques, and tools. Addison Wesley, Reading (1986)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Alpern, B., Attanasio, C.R., Barton, J.J., Burke, M.G., Cheng, P., Choi, J.D., Cocchi, A., Fink, S.J., Grove, D., Hind, M., Hummel, S.F., Lieber, D., Litvinov, V., Mergen, M.F., Ngo, T., Russell, J.R., Sarkar, V., Serrano, M.J., Shepherd, J.C., Smith, S.E., Sreedhar, V.C., Srinivasan, H., Whaley, J.: The Jalape\u00f1o virtual machine. IBM System Journal\u00a039(1) (February 2000)","DOI":"10.1147\/sj.391.0211"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Alpern, B., Wegman, M., Zadeck, K.: Detecting equality of variables in programs. In: Proceedings of the Symposium on Principles of Programming Languages, San Diego, California, January 1988, pp. 1\u201311 (1988)","DOI":"10.1145\/73560.73561"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bod\u00edk, R., Anik, S.: Path-sensitive value-flow analysis. In: Proceedings of the Symposium on Principles of Programming Languages [26], pp. 237\u2013251","DOI":"10.1145\/268946.268966"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Briggs, P., Cooper, K.D.: Effective partial redundancy elimination. In: Proceedings of the Conference on Programming Language Design and Implemenation, Orlando, FL, June 1994, pp. 159\u2013170. SIGPLAN (1994)","DOI":"10.1145\/178243.178257"},{"issue":"6","key":"12_CR6","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1002\/(SICI)1097-024X(199706)27:6<701::AID-SPE104>3.0.CO;2-0","volume":"27","author":"P. Briggs","year":"1997","unstructured":"Briggs, P., Cooper, K.D., Taylor Simpson, L.: Value numbering. Software\u2014Practice and Experience\u00a027(6), 701\u2013724 (1997)","journal-title":"Software\u2014Practice and Experience"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Burke, M.G., Choi, J.-D., Fink, S., Grove, D., Hind, M., Sarkar, V., Serrano, M., Sreedhar, V., Srinvasan, H., Whaley, J.: The Jalape\u00f1o dynamic optimizing compiler for Java. In: ACM 1999 Java Grande Conference, June 1999, pp. 129\u2013141 (1999)","DOI":"10.1145\/304065.304113"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Chow, F., Chan, S., Kennedy, R., Liu, S.-M., Lo, R., Tu, P.: A new algorithm for partial redundancy elimination based on SSA form. In: Proceedings of the Conference on Programming Language Design and Implemenation, Las Vegas, Nevada, June 1997, pp. 273\u2013286 (1997)","DOI":"10.1145\/258915.258940"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Click, C.: Global code motion, global value numbering. In: Proceedings of the Conference on Programming Language Design and Implemenation, La Jolla, CA, June 1995. SIGPLAN Notices, vol.\u00a030(6), pp. 246\u2013257 (1995)","DOI":"10.1145\/207110.207154"},{"key":"12_CR10","unstructured":"Standard Performance Evalution Counsil. SPEC JVM 98 benchmarks (1998), http:\/\/www.spec.org\/osg\/jvm98\/"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Kenneth Zadeck, F.: Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems\u00a013(4), 451\u2013490 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"8","key":"12_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/596992.597004","volume":"37","author":"D.M. Dhamdhere","year":"2002","unstructured":"Dhamdhere, D.M.: E-path pre\u2014partial redundancy elimination made easy. ACM SIGPLAN Notices\u00a037(8), 53\u201365 (2002)","journal-title":"ACM SIGPLAN Notices"},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/152819.152823","volume":"28","author":"K.-H. Drechsler","year":"1993","unstructured":"Drechsler, K.-H., Stadel, M.P.: A variation of Knoop, R\u00fcthing, and Steffen\u2019s lazy code motion. ACM SIGPLAN Notices\u00a028(5), 29\u201338 (1993)","journal-title":"ACM SIGPLAN Notices"},{"key":"12_CR14","unstructured":"EPCC. The java grande forum benchmark suite, http:\/\/www.epcc.ed.ac.uk\/javagrande\/index_1.html"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Fink, S., Knobe, K., Sarkar, V.: Unified analysis of array and object references in strongly typed languages. In: Proceedings of the Static Analysis Symposium, Santa Barbara, California, July 2000, pp. 155\u2013174 (2000)","DOI":"10.1007\/978-3-540-45099-3_9"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Gargi, K.: A sparse algorithm for predicated global value numbering. In: Proceedings of the Conference on Programming Language Design and Implemenation, Berlin, Germany, June 2002, pp. 45\u201356 (2002)","DOI":"10.1145\/512529.512536"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/319301.319348","volume":"21","author":"R. Kennedy","year":"1999","unstructured":"Kennedy, R., Chan, S., Liu, S.-M., Lo, R., Tu, P., Chow, F.: Partial redundancy elimination. ACM Transactions on Programming Languages and Systems\u00a021(3), 627\u2013676 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Knobe, K., Sarkar, V.: Array SSA form and its use in Parallelizaiton. In: Proceedings of the Symposium on Principles of Programming Languages [26], pp. 107\u2013120","DOI":"10.1145\/268946.268956"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Lazy code motion. In: Proceedings of the Conference on Programming Language Design and Implemenation, San Francisco, CA, July 1992. SIGPLAN Notices, vol.\u00a027(7), pp. 224\u2013234 (1992)","DOI":"10.1145\/143103.143136"},{"issue":"4","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1145\/183432.183443","volume":"16","author":"J. Knoop","year":"1994","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Optimal code motion: Theory and practice. ACM Transactions on Programming Languages and Systems\u00a016(4), 1117\u20131155 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/BFb0053569","volume-title":"Programming Languages and Systems","author":"J. Knoop","year":"1998","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Code motion and code placement: Just synonyms? In: Hankin, C. (ed.) ESOP 1998. LNCS, vol.\u00a01381, pp. 154\u2013169. Springer, Heidelberg (1998)"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-49051-7_7","volume-title":"Compiler Construction","author":"J. Knoop","year":"1999","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Expansion-based removal of semantic partial redundancies. In: J\u00e4hnichen, S. (ed.) CC 1999. LNCS, vol.\u00a01575, pp. 91\u2013107. Springer, Heidelberg (1999)"},{"key":"12_CR23","unstructured":"Lee, H., Diwan, A., Eliot, J., Moss, B.: Understanding the behavior of compiler optimizations (submitted)"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/359060.359069","volume":"22","author":"E. Morel","year":"1979","unstructured":"Morel, E., Renvoise, C.: Global optimization by supression of partial redundancies. Communications of the ACM\u00a022(2), 96\u2013103 (1979)","journal-title":"Communications of the ACM"},{"key":"12_CR25","volume-title":"Advanced Compiler Design and Implementation","author":"S. Muchnick","year":"1997","unstructured":"Muchnick, S.: Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco (1997)"},{"key":"12_CR26","unstructured":"Proceedings of the Symposium on Principles of Programming Languages, San Diego, California (January 1998)"},{"key":"12_CR27","unstructured":"IBM Research. The Jikes Research Virtual Machine, http:\/\/www-124.ibm.com\/developerworks\/oss\/jikesrvm\/"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/73560.73562","volume-title":"Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"B.K. Rosen","year":"1988","unstructured":"Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Global value numbers and redundant computations. In: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 12\u201327. ACM Press, New York (1988)"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-48294-6_15","volume-title":"Static Analysis","author":"O. R\u00fcthing","year":"1999","unstructured":"R\u00fcthing, O., Steffen, B., Knoop, J.: Detecting equalities of variables\u2014combining efficiency with precision. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 232\u2013247. Springer, Heidelberg (1999)"},{"key":"12_CR30","unstructured":"Simpson, L.T.: Value-driven redundancy elimination. PhD thesis, Rice University (1996)"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-17660-8_47","volume-title":"TAPSOFT \u201987 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987.","author":"B. Steffen","year":"1987","unstructured":"Steffen, B.: Optimal run-time optimization\u2014proved by a new look at abstract interpretation. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT 1987. LNCS, vol.\u00a0249, pp. 52\u201368. Springer, Heidelberg (1987)"},{"key":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-52592-0_76","volume-title":"ESOP \u201990","author":"B. Steffen","year":"1990","unstructured":"Steffen, B., Knoop, J., R\u00fcthing, O.: The value flow graph\u2014a program representation for optimal program transformations. In: Jones, N.D. (ed.) ESOP 1990. LNCS, vol.\u00a0432, pp. 389\u2013405. Springer, Heidelberg (1990)"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","volume-title":"TAPSOFT \u201991. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991","author":"B. Steffen","year":"1991","unstructured":"Steffen, B., Knoop, J., R\u00fcthing, O.: Efficient code motion and an adaptation to strength reduction. In: Abramsky, S. (ed.) TAPSOFT 1991, CCPSD 1991, and ADC-Talks 1991. LNCS, vol.\u00a0494. Springer, Heidelberg (1991)"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"VanDrunen, T., Hosking, A.L.: Anticipation-based partial redundancy elimination for static single assignment form (submitted, 2003)","DOI":"10.1007\/978-3-540-24723-4_12"},{"key":"12_CR35","unstructured":"VanDrunen, T., Hosking, A.L.: Corner cases in value-based partial redundancy elimination. Technical Report CSD-TR#03-032, Purdue University Department of Computer Sciences (2003)"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24723-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T12:29:22Z","timestamp":1740313762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24723-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212973","9783540247234"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24723-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}