{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:06:15Z","timestamp":1762916775228},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0167-6423(02)00083-7","type":"journal-article","created":{"date-parts":[[2002,12,27]],"date-time":"2002-12-27T15:25:06Z","timestamp":1041002706000},"page":"1-20","source":"Crossref","is-referenced-by-count":11,"title":["Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm"],"prefix":"10.1016","volume":"48","author":[{"given":"V.K.","family":"Paleri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.N.","family":"Srikant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Shankar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(02)00083-7_BIB1","series-title":"Compilers: Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S0167-6423(02)00083-7_BIB2","unstructured":"F. Chow, A portable machine independent optimizer\u2014design and implementation, Ph.D. Thesis, Dept. of Electrical Engineering, Stanford University, Stanford, Calif., and Technical Report 83-254, Computer Systems Lab., Stanford University, 1983."},{"issue":"10","key":"10.1016\/S0167-6423(02)00083-7_BIB3","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/51607.51621","article-title":"A fast algorithm for code movement optimization","volume":"23","author":"Dhamdhere","year":"1988","journal-title":"SIGPLAN Notices"},{"issue":"2","key":"10.1016\/S0167-6423(02)00083-7_BIB4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/103135.214520","article-title":"Practical adaptation of the global optimization algorithm of Morel and Renvoise","volume":"13","author":"Dhamdhere","year":"1991","journal-title":"ACM TOPLAS"},{"key":"10.1016\/S0167-6423(02)00083-7_BIB5","doi-asserted-by":"crossref","unstructured":"D.M. Dhamdhere, U.P. Khedker, Complexity of bidirectional data-flow analysis, in: Conf. Record of 20th ACM Symp. on the Principles of Programming Languages, ACM, New York, 1993 pp. 397\u2013409.","DOI":"10.1145\/158511.158696"},{"issue":"2","key":"10.1016\/S0167-6423(02)00083-7_BIB6","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/169701.169684","article-title":"An elimination algorithm for bidirectional data-flow problems using edge placement","volume":"15","author":"Dhamdhere","year":"1993","journal-title":"ACM TOPLAS"},{"key":"10.1016\/S0167-6423(02)00083-7_BIB7","doi-asserted-by":"crossref","unstructured":"D.M. Dhamdhere, B.K. Rosen, F.K. Zadeck, How to analyse large programs efficiently and informatively, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation \u201992, ACM SIGPLAN Notices 27(7) (1992) 212\u2013223.","DOI":"10.1145\/143103.143135"},{"key":"10.1016\/S0167-6423(02)00083-7_BIB8","first-page":"95","article-title":"Strength reduction of large expressions","volume":"3","author":"Dhaneshwar","year":"1995","journal-title":"J. Program. Lang."},{"issue":"5","key":"10.1016\/S0167-6423(02)00083-7_BIB9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/152819.152823","article-title":"A variation of Knoop, R\u00fcthing, and Steffen's lazy code motion","volume":"28","author":"Dreshler","year":"1993","journal-title":"ACM SIGPLAN Notices"},{"issue":"7","key":"10.1016\/S0167-6423(02)00083-7_BIB10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/143103.143136","article-title":"Lazy code motion","volume":"27","author":"Knoop","year":"1992","journal-title":"ACM SIGPLAN Notices"},{"issue":"4","key":"10.1016\/S0167-6423(02)00083-7_BIB11","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1145\/183432.183443","article-title":"Optimal code motion","volume":"16","author":"Knoop","year":"1994","journal-title":"ACM TOPLAS"},{"issue":"2","key":"10.1016\/S0167-6423(02)00083-7_BIB12","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/359060.359069","article-title":"Global optimization by suppression of partial redundancies","volume":"22","author":"Morel","year":"1979","journal-title":"Comm. ACM"},{"issue":"12","key":"10.1016\/S0167-6423(02)00083-7_BIB13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/307824.307851","article-title":"A simple algorithm for partial redundancy elimination","volume":"33","author":"Paleri","year":"1998","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642302000837?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642302000837?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T02:10:28Z","timestamp":1580868628000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642302000837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0167642302000837"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(02)00083-7","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}