{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T06:50:06Z","timestamp":1768027806168,"version":"3.49.0"},"reference-count":30,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5586,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0304-3975(97)00208-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"365-393","source":"Crossref","is-referenced-by-count":12,"title":["Eliminating partially dead code in explicitly parallel programs"],"prefix":"10.1016","volume":"196","author":[{"given":"Jens","family":"Knoop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00208-9_BIB1","first-page":"246","article-title":"Optimizing parallel programs using affinity regions","volume":"vol. II","author":"Appelbe","year":"1993"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB2","series-title":"Proc. Internat. Conf. on Computer Languages (ICCL'94)","first-page":"277","article-title":"State space reduction in abstract interpretation of parallel programs","author":"Chow","year":"1994"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB3","series-title":"Conf. Record of the 4th ACM Symp. on Principles of Programming Languages (POPL'77)","first-page":"238","article-title":"Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints","author":"Cousot","year":"1977"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB4","series-title":"5 of Software Engineering Notes","first-page":"62","article-title":"Data flow analysis for verifying properties of concurrent programs","volume":"vol. 19","author":"Dwyer","year":"1994"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB5","series-title":"Conf. Record of the 21st ACM Symp. on Principles of Programming Languages (POPL'94)","first-page":"421","article-title":"The revival transformation","author":"Feigen","year":"1994"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB6","series-title":"Proc. 6th Internat. Conf. on Compiler Construction (CC'96)","first-page":"106","article-title":"Nondashmonotone fixpoint iterations to resolve second order effects","volume":"vol. 1060","author":"Geser","year":"1996"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB7","series-title":"7 of ACM SIGPLAN Notices","first-page":"159","article-title":"Data flow equations for explicitly parallel programs","volume":"vol. 28","author":"Grunwald","year":"1993"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB8","series-title":"Flow Analysis of Computer Programs","author":"Hecht","year":"1977"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF00290339","article-title":"Monotone data flow analysis frameworks","volume":"7","author":"Kam","year":"1977","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00208-9_BIB10","series-title":"7 of ACM SIGPLAN Notices","first-page":"224","article-title":"Lazy code motion","volume":"vol. 27","author":"Knoop","year":"1992"},{"issue":"4","key":"10.1016\/S0304-3975(97)00208-9_BIB11","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1145\/183432.183443","article-title":"Optimal code motion: theory and practice","volume":"16","author":"Knoop","year":"1994","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB12","series-title":"6 of ACM SIGPLAN Notices","first-page":"147","article-title":"Partial dead code elimination","volume":"vol. 29","author":"Knoop","year":"1994"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB13","series-title":"6 of ACM SIGPLAN Notices","first-page":"233","article-title":"The power of assignment motion","volume":"vol. 30","author":"Knoop","year":"1995"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB14","series-title":"Proc. 4th Internat. Conf. on Compiler Construction (CC'92)","first-page":"125","article-title":"The interprocedural coincidence theorem","volume":"vol. 641","author":"Knoop","year":"1992"},{"issue":"3","key":"10.1016\/S0304-3975(97)00208-9_BIB15","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/229542.229545","article-title":"Parallelism for free: efficient and optimal bitvector analyses for parallel programs","volume":"18","author":"Knoop","year":"1996","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB16","series-title":"6 of ACM SIGPLAN Notices","first-page":"196","article-title":"Optimizing parallel programs with explicit synchronization","volume":"vol. 30","author":"Krishnamurthy","year":"1995"},{"issue":"9","key":"10.1016\/S0304-3975(97)00208-9_BIB17","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","article-title":"How to make a multiprocessor computer that correctly executes multiprocess programs","volume":"C-28","author":"Lamport","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)00208-9_BIB18","series-title":"Proc. ACM SIGSOFT Symp. on Testing, Analysis, and Verification (TAV'91)","first-page":"21","article-title":"Data flow analysis of concurrent systems that use the rendezvous model of synchronization","volume":"vol. 16","author":"Long","year":"1991"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF01178576","article-title":"Frameworks for abstract interpretation","volume":"30","author":"Marriot","year":"1993","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00208-9_BIB20","first-page":"105","article-title":"Issues in the optimization of parallel programs","volume":"vol. II","author":"Midkiff","year":"1990"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB21","series-title":"Program Flow Analysis: Theory and Applications","year":"1981"},{"issue":"2","key":"10.1016\/S0304-3975(97)00208-9_BIB22","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","article-title":"On theories with a combinatorial definition of equivalence","volume":"43","author":"Newman","year":"1942","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(97)00208-9_BIB23","series-title":"Program Flow Analysis: Theory and Applications","first-page":"189","article-title":"Two approaches to interprocedural data flow analysis","author":"Sharir","year":"1981"},{"issue":"2","key":"10.1016\/S0304-3975(97)00208-9_BIB24","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1145\/42190.42277","article-title":"Efficient and correct execution of parallel programs that share memory","volume":"10","author":"Shasha","year":"1988","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB25","series-title":"Conf. Record of the 20th ACM Symp. on Principles of Programming Languages (POPL'93)","first-page":"260","article-title":"Static single assignment form for explicitly parallel programs","author":"Srinivasan","year":"1993"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB26","series-title":"Proc. 4th Internat. Conf. on Languages and Compilers for Parallel Computing (LCPC'91)","first-page":"405","article-title":"Analyzing programs with explicit parallelism","volume":"vol. 589","author":"Srinivasan","year":"1991"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB27","series-title":"Proc. IFIP WG 10.3 Working Conf. on Parallel Architectures and Compilation Techniques (PACT'95)","first-page":"168","article-title":"Data flow analysis of parallel programs","author":"Vollmer","year":"1995"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB28","series-title":"High performance compilers for parallel computing","author":"Wolfe","year":"1996"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB29","series-title":"Proc. 1st Internat. Conf. of the Austrian Center for Parallel Computation","first-page":"139","article-title":"Data structures for optimizing programs with explicit parallelism","volume":"vol. 591","author":"Wolfe","year":"1991"},{"key":"10.1016\/S0304-3975(97)00208-9_BIB30","series-title":"Supercompilers for Parallel and Vector Computers","author":"Zima","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:00:34Z","timestamp":1555419634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0304397597002089"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00208-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}