{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T16:28:29Z","timestamp":1680020909277},"reference-count":65,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3730,"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,5]]},"DOI":"10.1016\/s0167-6423(02)00134-x","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"221-242","source":"Crossref","is-referenced-by-count":11,"title":["Eliminating dead code on recursive data"],"prefix":"10.1016","volume":"47","author":[{"given":"Yanhong A.","family":"Liu","sequence":"first","affiliation":[]},{"given":"Scott D.","family":"Stoller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(02)00134-X_BIB1","series-title":"Compilers, Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB2","series-title":"Conf. Record of the 18th Annu. ACM Symp. on Principles of Programming Languages","article-title":"Static type inference in a dynamically typed language","author":"Aiken","year":"1991"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB3","series-title":"The Java Programming Language","author":"Arnold","year":"1996"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB4","series-title":"Conf. Record of the 25th Annu. ACM Symp. on Principles of Programming Languages","first-page":"25","article-title":"Escape analysis","author":"Blanchet","year":"1998"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB5","series-title":"Proc. ACM SIGPLAN \u201997 Conf. on Programming Language Design and Implementation","first-page":"159","article-title":"Partial dead code elimination using slicing transformations","author":"Bod\u0131\u0301k","year":"1997"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB6","series-title":"LFP 1992, Proc. 1992 ACM Conf. on LISP and Functional Programming","first-page":"11","article-title":"Safe fusion of functional expressions","author":"Chin","year":"1992"},{"issue":"11","key":"10.1016\/S0167-6423(02)00134-X_BIB7","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1145\/359863.359888","article-title":"An algorithm for reduction of operator strength","volume":"20","author":"Cocke","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB8","unstructured":"J. Cocke, J.T. Schwartz, Programming languages and their compilers; preliminary notes, Technical Report, Courant Institute of Mathematical Sciences, New York University, 1970."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB9","series-title":"Proc. 7th Internat. Conf. on Functional Programming Languages and Computer Architecture","first-page":"170","article-title":"Formal language, grammar and set-constraint-based program analysis by abstract interpretation","author":"Cousot","year":"1995"},{"issue":"4","key":"10.1016\/S0167-6423(02)00134-X_BIB10","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/115372.115320","article-title":"Efficiently computing static single assignment form and the control dependence graph","volume":"13","author":"Cytron","year":"1991","journal-title":"ACM Trans. Program. Lang. Systems"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB11","series-title":"Proc. Symp. on Partial Evaluation and Semantics-Based Program Manipulation","first-page":"142","article-title":"Program bifurcation for a polymorphically typed functional language","author":"De Niel","year":"1991"},{"issue":"9","key":"10.1016\/S0167-6423(02)00134-X_BIB12","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1002\/spe.4380200905","article-title":"Calendrical calculations","volume":"20","author":"Dershowitz","year":"1990","journal-title":"Software Practice Exper."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB13","series-title":"Conf. Record of the 24th Annu. ACM Symp. on Principles of Programming Languages","first-page":"358","article-title":"On the complexity of escape analysis","author":"Deutsch","year":"1997"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB14","series-title":"The Scheme Programming Language","author":"Dybvig","year":"1987"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB15","series-title":"Proc. 7th European Symp. on Programming","first-page":"90","article-title":"Propagating differences","volume":"vol. 1381","author":"Fecht","year":"1998"},{"issue":"2","key":"10.1016\/S0167-6423(02)00134-X_BIB16","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1145\/316686.316703","article-title":"Componential set-based analysis","volume":"21","author":"Flanagan","year":"1999","journal-title":"ACM Trans. Program. Lang. Systems"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB17","unstructured":"FPCA 1989, Proc. 4th Internat. Conf. on Functional Programming Languages and Computer Architecture, ACM, New York, September 1989."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB18","series-title":"Tree Automata","author":"Gecseg","year":"1984"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB19","series-title":"Semantics of Programming Languages","author":"Gunter","year":"1992"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB20","series-title":"Proc. Joint Internat. Conf. and Symp. on Logic Programming","first-page":"765","article-title":"Practical aspects of set based analysis","author":"Heintze","year":"1992"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB21","unstructured":"N. Heintze, Set-based program analysis, Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, October 1992."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB22","series-title":"Proc. 1994 ACM Conf. on LISP and Functional Programming","first-page":"306","article-title":"Set-based analysis of ML programs","author":"Heintze","year":"1994"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB23","series-title":"Proc. 5th Internat. Conf. on Functional Programming Languages and Computer Architecture","first-page":"448","article-title":"Efficient type inference for higher-order binding-time analysis","volume":"vol. 523","author":"Henglein","year":"1991"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB24","series-title":"Research Topics in Functional Programming","first-page":"117","article-title":"Compile-time analysis of functional programs","author":"Hughes","year":"1990"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB25","unstructured":"The Internet Scheme Repository, http:\/\/www.cs.indiana.edu\/scheme-repository\/."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB26","series-title":"Conf. Record of the 6th Annu. ACM Symp. on Principles of Programming Languages","first-page":"244","article-title":"Flow analysis and optimization of LISP-like structures","author":"Jones","year":"1979"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB27","series-title":"Program Flow Analysis","first-page":"102","article-title":"Flow analysis and optimization of LISP-like structures","author":"Jones","year":"1981"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB28","series-title":"FPCA 1989, Proc. 4th Internat. Conf. on Functional Programming Languages and Computer Architecture","first-page":"54","article-title":"Compile-time garbage collection by sharing analysis","author":"Jones","year":"1989"},{"issue":"3","key":"10.1016\/S0167-6423(02)00134-X_BIB29","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0096-0551(78)90009-7","article-title":"Use-definition chains with applications","volume":"3","author":"Kennedy","year":"1978","journal-title":"J. Comput. Lang."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB30","series-title":"Proc. ACM SIGPLAN \u201994 Conf. on Programming Language Design and Implementation","first-page":"147","article-title":"Partial dead code elimination","author":"Knoop","year":"1994"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB31","unstructured":"J. Launchbury, Projection factorisations in partial evaluation, Ph.D. Thesis, Department of Computing, University of Glasgow, Glasgow, Scotland, 1989."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB32","series-title":"Proc. ACM SIGPLAN \u201991 Conf. on Programming Language Design and Implementation","first-page":"80","article-title":"Strictness and binding-time analysis","author":"Launchbury","year":"1991"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB33","unstructured":"LFP 1992, Proc. 1992 ACM Conf. on LISP and Functional Programming, ACM, New York, June 1992."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB34","series-title":"Proc. IEEE 1998 Internat. Conf. on Computer Languages","first-page":"206","article-title":"Dependence analysis for recursive data","author":"Liu","year":"1998"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB35","series-title":"Proc. 8th Internat. Static Analysis Symp.","first-page":"213","article-title":"Solving regular tree grammar based constraints","author":"Liu","year":"2001"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB36","series-title":"Proc 8th European Symp. on Programming","first-page":"288","article-title":"Dynamic programming via static incrementalization","volume":"vol. 1576","author":"Liu","year":"1999"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB37","series-title":"Conf. Record of the 23rd Annu. ACM Symp. on Principles of Programming Languages","first-page":"157","article-title":"Discovering auxiliary information for incremental computation","author":"Liu","year":"1996"},{"issue":"3","key":"10.1016\/S0167-6423(02)00134-X_BIB38","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1145\/291889.291895","article-title":"Static caching for incremental computation","volume":"20","author":"Liu","year":"1998","journal-title":"ACM Trans. Program. Lang. Systems"},{"issue":"1","key":"10.1016\/S0167-6423(02)00134-X_BIB39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(94)00031-9","article-title":"Systematic derivation of incremental programs","volume":"24","author":"Liu","year":"1995","journal-title":"Sci. Comput. Program"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB40","series-title":"Proc. 1997 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation","article-title":"Interconvertibility of set constraints and context-free language reachability","author":"Melski","year":"1997"},{"issue":"1\u20132","key":"10.1016\/S0167-6423(02)00134-X_BIB41","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0304-3975(00)00049-9","article-title":"Interconvertibility of a class of set constraints and context-free language reachability","volume":"248","author":"Melski","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB42","series-title":"The definition of Standard ML","author":"Milner","year":"1990"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB43","series-title":"Conf. Record of the 12th Annu. ACM Symp. on POPL","first-page":"7","article-title":"Declaration-free type checking","author":"Mishra","year":"1985"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB44","series-title":"FPCA 1989, Proc. 4th Internat. Conf. on Functional Programming Languages and Computer Architecture","first-page":"12","article-title":"Separating binding times in language specifications","author":"Mogensen","year":"1989"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB45","series-title":"Program Flow Analysis","year":"1981"},{"issue":"3","key":"10.1016\/S0167-6423(02)00134-X_BIB46","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/357172.357177","article-title":"Finite differencing of computable expressions","volume":"4","author":"Paige","year":"1982","journal-title":"ACM Trans. Program. Lang. Systems"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB47","series-title":"Proc. ACM SIGPLAN \u201992 Conf. on Programming Language Design and Implementation","first-page":"116","article-title":"Escape analysis on lists","author":"Park","year":"1992"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB48","doi-asserted-by":"crossref","unstructured":"W. Pugh, E. Rosser, Iteration space slicing and its application to communication optimization, in: Internat. Conf. on Supercomputing, Vienna, Austria, July 1997.","DOI":"10.1145\/263580.263637"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB49","series-title":"The Synthesizer Generator","author":"Reps","year":"1988"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB50","series-title":"Proc. Dagstuhl Sem. on Partial Evaluation","first-page":"409","article-title":"Program specialization via program slicing","volume":"vol. 1110","author":"Reps","year":"1996"},{"issue":"1","key":"10.1016\/S0167-6423(02)00134-X_BIB51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/271510.271517","article-title":"Solving shape-analysis problems in languages with destructive updating","volume":"20","author":"Sagiv","year":"1998","journal-title":"ACM Trans. Program. Lang. Systems"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB52","series-title":"Theoretical Foundations of Programming Methodology","first-page":"145","article-title":"Lectures on a mathematical theory of computation","author":"Scott","year":"1982"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB53","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0167-6423(97)00031-2","article-title":"Constraints to stop deforestation","volume":"32","author":"Seidl","year":"1998","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB54","series-title":"Proc. ACM SIGPLAN \u201988 Conf. on Programming Language Design and Implementation","article-title":"Control flow analysis in scheme","author":"Shivers","year":"1988"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB55","series-title":"CAAP\u201994: Proc. 19th Internat. Colloq. on Trees in Algebra and Programming","first-page":"335","article-title":"A grammar-based data-flow analysis to stop deforestation","volume":"vol. 787","author":"S\u00f8rensen","year":"1994"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB56","series-title":"Common Lisp the Language","author":"Steele","year":"1984"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB57","series-title":"Proc. ACM SIGPLAN \u201998 Conf. on Programming Language Design and Implementation","first-page":"324","article-title":"A study of dead data members in c++ applications","author":"Sweeney","year":"1998"},{"issue":"3","key":"10.1016\/S0167-6423(02)00134-X_BIB58","first-page":"121","article-title":"A survey of program slicing techniques","volume":"3","author":"Tip","year":"1995","journal-title":"J. Program. Lang."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB59","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","article-title":"Deforestation","volume":"73","author":"Wadler","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB60","series-title":"Proc. 3rd Internat. Conf. on Functional Programming Languages and Computer Architecture","first-page":"385","article-title":"Projections for strictness analysis","volume":"vol. 274","author":"Wadler","year":"1987"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB61","series-title":"Proc. IEEE 1998 Internat. Conf. on Computer Languages","first-page":"184","article-title":"Set constraints for destructive array update optimization","author":"Wand","year":"1998"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB62","series-title":"Conf. Record of the 26th Annu. ACM Symp. on Principles of Programming Languages","first-page":"291","article-title":"Constraint systems for useless variable elimination","author":"Wand","year":"1999"},{"key":"10.1016\/S0167-6423(02)00134-X_BIB63","series-title":"LEP 1992, Proc. 1992 ACM Conf. on LISP and Functional Programming","first-page":"216","article-title":"Analysis of recursive types in lisp-like languages","author":"Wang","year":"1992"},{"issue":"4","key":"10.1016\/S0167-6423(02)00134-X_BIB64","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","article-title":"Program slicing","volume":"SE-10","author":"Weiser","year":"1984","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0167-6423(02)00134-X_BIB65","series-title":"The Formal Semantics of Programming Languages","author":"Winskel","year":"1993"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016764230200134X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016764230200134X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:58:21Z","timestamp":1553907501000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016764230200134X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":65,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S016764230200134X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(02)00134-x","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}