Eliminating Dead Code on Recursive Data-Reference-Cited by-同舟云学术

Eliminating Dead Code on Recursive Data

Published:1999 Issue: Volume: Page:211-231
ISSN:0302-9743
Container-title:Static Analysis
language:
Short-container-title:

Author:

Liu Yanhong A.,Stoller Scott D.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48294-6_14

Reference60 articles.

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers, Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass., 1986.

2. A. Aiken and B. R. Murphy. Static type inference in a dynamically typed language. In Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, Jan. 1991.

3. K. Arnold and J. Golsing. The Java Programming Language. Addison-Wesley, Reading, Mass., 1996.

4. B. Blanchet. Escape analysis: correctness proof, implementation and experimental results. In Conference Record of the 25th Annual ACM Symposium on Principles of Programming Languages, pages 25–37. ACM, New York, Jan. 1998.

5. R. Bodík and R. Gupta. Partial dead code elimination using slicing transformations. In Proceedings of the ACM SIGPLAN’ 97 Conference on Programming Language Design and Implementation, pages 159–170. ACM, New York, June 1997.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dynamic Programming via Static Incrementalization;Automatic Program Development;2008

2. Redundancy of Arguments Reduced to Induction;Electronic Notes in Theoretical Computer Science;2002-11

3. Solving Regular Tree Grammar Based Constraints;Static Analysis;2001