Eliminating dead code on recursive data

Science of Computer Programming

Volumn 47, Issue 2-3, 2003, Pages 221-242

  Liu, Yanhong A ^a   Stoller, Scott D ^a  

^a USA   (United States)

Author keywords

Constraints; Dead code elimination; Program analysis; Recursive data structures; Regular tree grammars; Slicing

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; DATA REDUCTION; DATA STRUCTURES; SEMANTICS;

DEAD-CODE ELIMINATION;

COMPUTER PROGRAMMING;

EID: 0037400724     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(02)00134-X     Document Type: Conference Paper

References (65)

1. Aho A.V., Sethi R., Ullman J.D. Compilers, Principles, Techniques, and Tools. 1986;Addison-Wesley, Reading, MA.
2. Aiken A., Murphy B.R. Static type inference in a dynamically typed language. Conf. Record of the 18th Annu. ACM Symp. on Principles of Programming Languages. January 1991;ACM, New York.
3. Arnold K., Golsing J. The Java Programming Language. 1996;Addison-Wesley, Reading, MA.
4. Blanchet B. Escape analysis. correctness proof, implementation and experimental results Conf. Record of the 25th Annu. ACM Symp. on Principles of Programming Languages. January 1998;25-37 ACM, New York.
5. Bodík R., Gupta R. Partial dead code elimination using slicing transformations. Proc. ACM SIGPLAN '97 Conf. on Programming Language Design and Implementation. June 1997;159-170 ACM, New York.
6. Chin W.-N. Safe fusion of functional expressions. LFP 1992, Proc. 1992 ACM Conf. on LISP and Functional Programming. June 1992;11-20 ACM, New York.
7. Cocke J., Kennedy K. An algorithm for reduction of operator strength. Comm. ACM. 20(11):1977;850-856.
8. J. Cocke, J.T. Schwartz, Programming languages and their compilers; preliminary notes, Technical Report, Courant Institute of Mathematical Sciences, New York University, 1970.
9. Cousot P., Cousot R. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. Proc. 7th Internat. Conf. on Functional Programming Languages and Computer Architecture. June 1995;170-181 ACM, New York.
10. Cytron R., Ferrante J., Rosen B.K., Wegman M.M., Zadeck F.K. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Systems. 13(4):1991;451-490.
11. De Niel A., Bevers E., De Vlaminck K. Program bifurcation for a polymorphically typed functional language. Proc. Symp. on Partial Evaluation and Semantics-Based Program Manipulation. June 1991;142-153 ACM, New York.
12. Dershowitz N., Reingold E.M. Calendrical calculations. Software Practice Exper. 20(9):1990;899-928.
13. Deutsch A. On the complexity of escape analysis. Conf. Record of the 24th Annu. ACM Symp. on Principles of Programming Languages. January 1997;358-371 ACM, New York.
14. Dybvig R.K. The Scheme Programming Language. 1987;Prentice-Hall, Englewood Cliffs, NJ.
15. Fecht C., Seidl H. Propagating differences. an efficient new fixpoint algorithm for distributive constraint systems Hankin C. Proc. 7th European Symp. on Programming. Lecture Notes in Computer Science. vol. 1381:1998;90-104 Springer, Berlin.
16. Flanagan C., Felleisen M. Componential set-based analysis. ACM Trans. Program. Lang. Systems. 21(2):1999;370-416.
17. FPCA 1989, Proc. 4th Internat. Conf. on Functional Programming Languages and Computer Architecture, ACM, New York, September 1989.
18. Gecseg F., Steinb M. Tree Automata. 1984;Akademiai Kiado, Budapest.
19. Gunter C.A. Semantics of Programming Languages. 1992;The MIT Press, Cambridge, MA.
20. Heintze N. Practical aspects of set based analysis. Apt K. Proc. Joint Internat. Conf. and Symp. on Logic Programming. November 1992;765-779 The MIT Press, Cambridge, MA.
21. N. Heintze, Set-based program analysis, Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, October 1992.
22. Heintze N. Set-based analysis of ML programs. Proc. 1994 ACM Conf. on LISP and Functional Programming. June 1994;306-317 ACM, New York.
23. Henglein F. Efficient type inference for higher-order binding-time analysis. Proc. 5th Internat. Conf. on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science. vol. 523:August 1991;448-472 Springer, Berlin.
24. Hughes J. Compile-time analysis of functional programs. Turner D. Research Topics in Functional Programming. 1990;117-153 Addison-Wesley, Reading, MA.
25. The Internet Scheme Repository, http://www.cs.indiana.edu/scheme-repository/.
26. Jones N.D., Muchnick S.S. Flow analysis and optimization of LISP-like structures. Conf. Record of the 6th Annu. ACM Symp. on Principles of Programming Languages. January 1979;244-256 ACM, New York.
27. Jones N.D., Muchnick S.S. Flow analysis and optimization of LISP-like structures. Muchnick S.S., Jones N.D. Program Flow Analysis. 1981;102-131 Prentice-Hall, Englewood Cliffs, NJ.
28. Jones S.B., Le Métayer D. Compile-time garbage collection by sharing analysis. FPCA 1989, Proc. 4th Internat. Conf. on Functional Programming Languages and Computer Architecture. September 1989;54-74 ACM, New York.
29. Kennedy K. Use-definition chains with applications. J. Comput. Lang. 3(3):1978;163-179.
30. Knoop J., Rüthing O., Steffen B. Partial dead code elimination. Proc. ACM SIGPLAN '94 Conf. on Programming Language Design and Implementation. June 1994;147-158 ACM, New York.
31. J. Launchbury, Projection factorisations in partial evaluation, Ph.D. Thesis, Department of Computing, University of Glasgow, Glasgow, Scotland, 1989.
32. Launchbury J. Strictness and binding-time analysis. two for the price of one Proc. ACM SIGPLAN '91 Conf. on Programming Language Design and Implementation. June 1991;80-91 ACM, New York.
33. LFP 1992, Proc. 1992 ACM Conf. on LISP and Functional Programming, ACM, New York, June 1992.
34. Liu Y.A. Dependence analysis for recursive data. Proc. IEEE 1998 Internat. Conf. on Computer Languages. May 1998;206-215 IEEE CS Press, Los Alamitos, CA.
35. Liu Y.A., Li N., Stoller S.D. Solving regular tree grammar based constraints. Proc. 8th Internat. Static Analysis Symp. July 2001;213-233 Springer, Berlin.
36. Liu Y.A., Stoller S.D. Dynamic programming via static incrementalization. Proc 8th European Symp. on Programming. Lecture Notes in Computer Science. vol. 1576:March 1999;288-305 Springer, Berlin.
37. Liu Y.A., Stoller S.D., Teitelbaum T. Discovering auxiliary information for incremental computation. Conf. Record of the 23rd Annu. ACM Symp. on Principles of Programming Languages. January 1996;157-170 ACM, New York.
38. Liu Y.A., Stoller S.D., Teitelbaum T. Static caching for incremental computation. ACM Trans. Program. Lang. Systems. 20(3):1998;546-585.
39. Liu Y.A., Teitelbaum T. Systematic derivation of incremental programs. Sci. Comput. Program. 24(1):1995;1-39.
40. Melski D., Reps T. Interconvertibility of set constraints and context-free language reachability. Proc. 1997 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation. June 1997;ACM, New York.
41. Melski D., Reps T. Interconvertibility of a class of set constraints and context-free language reachability. Theoret. Comput. Sci. 248(1-2):2000;29-98.
42. Milner R., Tofte M., Harper R. The definition of Standard ML. 1990;The MIT Press, Cambridge, MA.
43. Mishra P., Reddy U. Declaration-free type checking. Conf. Record of the 12th Annu. ACM Symp. on POPL. January 1985;7-21 ACM, New York.
44. Mogensen T. Separating binding times in language specifications. FPCA 1989, Proc. 4th Internat. Conf. on Functional Programming Languages and Computer Architecture. September 1989;12-25 ACM, New York.
45. Muchnick S.S., Jones N.D. Program Flow Analysis. Theory and Applications:1981;Prentice-Hall, Englewood Cliffs, NJ.
46. Paige R., Koenig S. Finite differencing of computable expressions. ACM Trans. Program. Lang. Systems. 4(3):1982;402-454.
47. Park Y.G., Goldberg B. Escape analysis on lists. Proc. ACM SIGPLAN '92 Conf. on Programming Language Design and Implementation. June 1992;116-127 ACM, New York.
48. W. Pugh, E. Rosser, Iteration space slicing and its application to communication optimization, in: Internat. Conf. on Supercomputing, Vienna, Austria, July 1997.
49. Reps T., Teitelbaum T. The Synthesizer Generator. A System for Constructing Language-Based Editors:1988;Springer, New York.
50. Reps T., Turnidge T. Program specialization via program slicing. Danvy O., Glück R., Thiemann P. Proc. Dagstuhl Sem. on Partial Evaluation. Lecture Notes in Computer Science. vol. 1110:1996;409-429 Springer, Berlin.
51. Sagiv M., Reps T., Wilhelm R. Solving shape-analysis problems in languages with destructive updating. ACM Trans. Program. Lang. Systems. 20(1):1998;1-50.
52. Scott D.S. Lectures on a mathematical theory of computation. Broy M., Schmidt G. Theoretical Foundations of Programming Methodology. 1982;145-292 D. Reidel Publishing Company, Dordrecht.
53. Seidl H., S ø rensen M.H. Constraints to stop deforestation. Sci. Comput. Program. 32:1998;73-107.
54. Shivers O. Control flow analysis in scheme. Proc. ACM SIGPLAN '88 Conf. on Programming Language Design and Implementation. eJune 1988;ACM, New York.
55. Sørensen M.H. A grammar-based data-flow analysis to stop deforestation. Tison S. CAAP'94: Proc. 19th Internat. Colloq. on Trees in Algebra and Programming. Lecture Notes in Computer Science. vol. 787:April 1994;335-351 Springer, Berlin.
56. Steele G.L. Common Lisp the Language. 1984;Digital Press, Belford, MA.
57. Sweeney P.F., Tip F. A study of dead data members in c++ applications. Proc. ACM SIGPLAN '98 Conf. on Programming Language Design and Implementation. June 1998;324-332 ACM, New York.
58. Tip F. A survey of program slicing techniques. J. Program. Lang. 3(3):1995;121-189.
59. Wadler P. Deforestation. Transforming programs to eliminate trees Theoret. Comput. Sci. 73:1990;231-248. (Special issue of selected papers from the 2nd European Symposium on Programming).
60. Wadler P., Hughes R.J.M. Projections for strictness analysis. Proc. 3rd Internat. Conf. on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science. vol. 274:September 1987;385-407 Springer, Berlin.
61. Wand M., Clinger W.D. Set constraints for destructive array update optimization. Proc. IEEE 1998 Internat. Conf. on Computer Languages. May 1998;184-193 IEEE CS Press, Los Alamitos, CA.
62. Wand M., Siveroni I. Constraint systems for useless variable elimination. Conf. Record of the 26th Annu. ACM Symp. on Principles of Programming Languages. January 1999;291-302 ACM, New York.
63. Wang E., Hilfinger P.M. Analysis of recursive types in lisp-like languages. LEP 1992, Proc. 1992 ACM Conf. on LISP and Functional Programming. June 1992;216-225 ACM, New York.
64. Weiser M. Program slicing. IEEE Trans. Software Eng. SE-10(4):1984;352-357.
65. Winskel G. The Formal Semantics of Programming Languages. 1993;The MIT Press, Cambridge, MA.