{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:29:12Z","timestamp":1761596952222},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330509"},{"type":"electronic","value":"9783540330516"}],"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_13","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T12:41:48Z","timestamp":1143549708000},"page":"139-154","source":"Crossref","is-referenced-by-count":7,"title":["A Fresh Look at PRE as a Maximum Flow Problem"],"prefix":"10.1007","author":[{"given":"Jingling","family":"Xue","sequence":"first","affiliation":[]},{"given":"Jens","family":"Knoop","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bodik, R.: Path-Sensitive Value-Flow Optimizations of Programs. PhD thesis, University of Pittsburgh (1999)","DOI":"10.1145\/268946.268966"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Bodik, R., Gupta, R., Soffa, M.L.: Complete removal of redundant computations. In: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, pp. 1\u201314 (1998)","DOI":"10.1145\/277650.277653"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Briggs, P., Cooper, K.D.: Effective partial redundancy elimination. In: Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation, pp. 159\u2013170 (1994)","DOI":"10.1145\/178243.178257"},{"key":"13_CR4","unstructured":"Cai, Q., Xue, J.: Optimal and efficient speculation-based partial redundancy elimination. In: 1st IEEE\/ACM International Symposium on Code Generation and Optimization, pp. 91\u2013104 (2003)"},{"key":"13_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"issue":"10","key":"13_CR6","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/51607.51621","volume":"23","author":"D.M. Dhamdhere","year":"1988","unstructured":"Dhamdhere, D.M.: A fast algorithm for code movement optimisation. SIGPLAN Not.\u00a023(10), 172\u2013180 (1988)","journal-title":"SIGPLAN Not."},{"issue":"8","key":"13_CR7","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: partial redundancy elimination made easy. SIGPLAN Not.\u00a037(8), 53\u201365 (2002)","journal-title":"SIGPLAN Not."},{"key":"13_CR8","first-page":"95","volume":"3","author":"V.M. Dhaneshwar","year":"1995","unstructured":"Dhaneshwar, V.M., Dhamdhere, D.M.: Strength reduction of large expressions. Journal of Programming Languages\u00a03, 95\u2013120 (1995)","journal-title":"Journal of Programming Languages"},{"issue":"5","key":"13_CR9","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 on Knoop, R\u00fcthing, and Steffen\u2019s lazy code motion. SIGPLAN Notices\u00a028(5), 29\u201338 (1993)","journal-title":"SIGPLAN Notices"},{"key":"13_CR10","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Gupta, R., Berson, D.A., Fang, J.Z.: Path profile guided partial redundancy elimination using speculation. In: Proceedings of the 1998 International Conference on Computer Languages, pp. 230\u2013239 (1998)","DOI":"10.1109\/ICCL.1998.674173"},{"issue":"6","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1145\/295656.295664","volume":"20","author":"M. Hailperin","year":"1998","unstructured":"Hailperin, M.: Cost-optimal code motion. ACM Transactions on Programming Languages and Systems\u00a020(6), 1297\u20131322 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Horspool, R., Ho, H.: Partial redundancy elimination driven by a cost-benefit analysis. In: 8th Israeli Conference on Computer System and Software Engineering, pp. 111\u2013118 (1997)","DOI":"10.1109\/ICCSSE.1997.599882"},{"key":"13_CR14","volume-title":"Integer Programming and Network Flows","author":"T.C. Hu","year":"1970","unstructured":"Hu, T.C.: Integer Programming and Network Flows. Addison-Wesley, Reading (1970)"},{"issue":"3","key":"13_CR15","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.: Partial redundancy elimination in SSA form. ACM Transactions on Programming Languages and Systems\u00a021(3), 627\u2013676 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BFb0026428","volume-title":"Proceedings of the 7th International Conference on Compiler Construction","author":"R. Kennedy","year":"1998","unstructured":"Kennedy, R., Chow, F.C., Dahl, P., Liu, S.-M., Lo, R., Streich, M.: Strength reduction via SSAPRE. In: Proceedings of the 7th International Conference on Compiler Construction, London, UK, pp. 144\u2013158. Springer, London (1998)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Lazy code motion. In: Proceedings of the ACM SIGPLAN 1992 Conference on Programming Language Design and Implementation, pp. 224\u2013234 (1992)","DOI":"10.1145\/143095.143136"},{"issue":"1","key":"13_CR18","first-page":"71","volume":"1","author":"J. Knoop","year":"1993","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Lazy strength reduction. Journal of Programming Languages\u00a01(1), 71\u201391 (1993)","journal-title":"Journal of Programming Languages"},{"issue":"4","key":"13_CR19","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 Trans. Program. Lang. Syst.\u00a016(4), 1117\u20131155 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Lin, J., Chen, T., Hsu, W.-C., Yew, P.-C., Ju, R.D.-C., Ngai, T.-F., Chan, S.: A compiler framework for speculative analysis and optimizations. In: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, pp. 289\u2013299 (2003)","DOI":"10.1145\/781131.781164"},{"issue":"5","key":"13_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/277652.277659","volume":"33","author":"R. Lo","year":"1998","unstructured":"Lo, R., Chow, F., Kennedy, R., Liu, S.-M., Tu, P.: Register promotion by sparse partial redundancy elimination of loads and stores. SIGPLAN Not.\u00a033(5), 26\u201337 (1998)","journal-title":"SIGPLAN Not."},{"issue":"2","key":"13_CR22","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 suppression of partial redundancies. Commun. ACM\u00a022(2), 96\u2013103 (1979)","journal-title":"Commun. ACM"},{"issue":"12","key":"13_CR23","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/307824.307851","volume":"33","author":"V.K. Paleri","year":"1998","unstructured":"Paleri, V.K., Srikant, Y.N., Shankar, P.: A simple algorithm for partial redundancy elimination. SIGPLAN Not.\u00a033(12), 35\u201343 (1998)","journal-title":"SIGPLAN Not."},{"key":"13_CR24","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/325694.325715","volume-title":"Conference Record of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"O. R\u00fcthing","year":"2000","unstructured":"R\u00fcthing, O., Knoop, J., Steffen, B.: Sparse code motion. In: Conference Record of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, Massachusetts, pp. 170\u2013183. ACM, New York (2000)"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Scholz, B., Horspool, R.N., Knoop, J.: Optimizing for space and time usage with speculative partial redundancy elimination. In: Proceedings of the 2004 ACM SIGPLAN\/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, pp. 221\u2013230 (2004)","DOI":"10.1145\/997163.997195"},{"key":"13_CR26","unstructured":"Xue, J., Cai, Q.: Profile-guided partial redundancy elimination using control speculation: a lifetime optimal algorithm and an experimental evaluation. Technical Report UNSW\u2013CSE\u2013TR\u20130420, School of Computer Science and Engigeering, University of New South Wales (July 2004)"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11688839_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,25]],"date-time":"2021-07-25T06:33:02Z","timestamp":1627194782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11688839_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330509","9783540330516"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11688839_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}