{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T03:10:29Z","timestamp":1700190629533},"reference-count":20,"publisher":"Wiley","issue":"15","license":[{"start":{"date-parts":[[2004,8,25]],"date-time":"2004-08-25T00:00:00Z","timestamp":1093392000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[2004,12]]},"abstract":"Abstract<\/jats:title>Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) execution paths of a program without increasing any path length. Chow, Kennedy and co\u2010workers devised an algorithm (SSAPRE) for performing partial redundancy elimination on intermediate representations in static single assignment (SSA) form. The practicality of that algorithm is limited by the following concerns: (1) it makes assumptions about the namespace that are stronger than those of SSA form and that may not be valid if other optimizations have already been performed on the program; (2) if redundancies occur in nested expressions, the algorithm may expose but not eliminate them (requiring a second pass of the algorithm); (3) it misses cases covered by the state of the art in PRE; and (4) it is difficult to understand and implement. We present an algorithm (A\u2010SSAPRE) structurally similar to SSAPRE that uses anticipation rather than availability; this algorithm is simpler than SSAPRE, covers more cases, eliminates nested redundancies on a single pass, and makes no assumptions about the namespace. Copyright \u00a9 2004 John Wiley & Sons, Ltd.<\/jats:p>","DOI":"10.1002\/spe.618","type":"journal-article","created":{"date-parts":[[2004,8,25]],"date-time":"2004-08-25T11:01:17Z","timestamp":1093431677000},"page":"1413-1439","source":"Crossref","is-referenced-by-count":3,"title":["Anticipation\u2010based partial redundancy elimination for static single assignment form"],"prefix":"10.1002","volume":"34","author":[{"given":"Thomas","family":"VanDrunen","sequence":"first","affiliation":[]},{"given":"Antony L.","family":"Hosking","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2004,8,25]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/359060.359069"},{"key":"e_1_2_1_3_2","volume-title":"Proceedings of the Conference on Programming Language Design and Implementation","author":"Chow F","year":"1997"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/319301.319348"},{"key":"e_1_2_1_5_2","first-page":"237","volume-title":"Proceedings of the Symposium on Principles of Programming Languages","author":"Bod\u00edk R","year":"1998"},{"key":"e_1_2_1_6_2","volume-title":"Proceedings of the Conference on Programming Language Design and Implementation","author":"Bod\u00edk R","year":"1998"},{"key":"e_1_2_1_7_2","volume-title":"Compilers\u2014Principles, Techniques, and Tools","author":"Aho AV","year":"1986"},{"key":"e_1_2_1_8_2","volume-title":"Proceedings of the Conference on Programming Language Design and Implementation","author":"Knoop J","year":"1992"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115320"},{"key":"e_1_2_1_10_2","volume-title":"Proceedings of the Conference on Programming Language Design and Implementation","author":"Briggs P","year":"1994"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.371"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45099-3_9"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/304065.304106"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1147\/sj.391.0211"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/304065.304113"},{"key":"e_1_2_1_16_2","unstructured":"Standard Performance Evalution Council. SPECjvm 98 benchmarks http:\/\/www.spec.org\/osg\/jvm98\/[30 June2004]."},{"key":"e_1_2_1_17_2","unstructured":"PozoR MillerB. Scimark 2.0.http:\/\/math.nist.gov\/scimark2\/[30 June2004]."},{"key":"e_1_2_1_18_2","unstructured":"EPCC. The Java Grande Forum Benchmark Suite.http:\/\/www.epcc.ed.ac.uk\/javagrande\/index_1.html[30 June2004]."},{"key":"e_1_2_1_19_2","unstructured":"LeeH DiwanA MossJEB.Understanding the behavior of compiler optimizations.Technical Report CU\u2010CS\u2010972\u201004 Department of Computer Science University of Colorado at Boulder 2004."},{"key":"e_1_2_1_20_2","volume-title":"Advanced Compiler Design and Implementation","author":"Muchnick S","year":"1997"},{"key":"e_1_2_1_21_2","first-page":"21","volume-title":"Workshop on Program Analysis for Software Tools and Engineering","author":"Choi J\u2010D","year":"1999"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.618","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T02:52:50Z","timestamp":1700189570000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,25]]},"references-count":20,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["10.1002\/spe.618"],"URL":"http:\/\/dx.doi.org\/10.1002\/spe.618","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8,25]]}}}
