Possible NEW Papers for Presentation

• A. Chauhan, C. Mc Cosh, K. Kennedy, R. Hanson
  Automatic Type-Driven Library Generation for Telescoping Languages
  Proceedings of the 2003 Supercomputing, Phoenix, November 2003.
• K. Yotov, X. Li, G. Ren, M. Cibulskis, G. DeJong, M. Garzaran, D. Padua, K. Pingali, P. Stodghill, P. Wu
  A Comparison of Empirical and Model-driven Optimization
  Proceedings of the 2003 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI03), San Diego, June 2003.
• Y. Zhong, S. Dropsho, C. Ding
  Miss Rate Prediction Across All Program Inputs
  Proceedings of PACT 03.
• C. Ding,Y. Zhong
  Predicting Whole-Program Locality through Reuse Distance Analysis
  Proceedings of PLDI 03.
• C. Ding,Y. Zhong
  Compiler-Directed Run-Time Monitoring of Program Data Access
  ACM Workshop on Memory System Performance, June 2002.
• M. Poletto, V. Sarkar
  Linear Scan Register Allocation
  ACM Transactions on Programming Languages and Systems, Sept. 1999.
• M. Stephenson, U. O'Reilly, M. Martin, S. Amarasinghe
  Genetic Programming Applied to Compiler Heuristic Optimization
  Proceeding of the 6th European Conference on Genetic Programming, April 2003.
• M. Stephenson, U. O'Reilly, M. Martin, S. Amarasinghe
  Meta Optimization: Improving Compiler Heuristics With Machine Learning
  PLDI 03.
• B. Scholz, E. Mehofer
  Dataflow Frequency Analysis based on Whole Program Paths
  PACT 2002
• S. Lerner, T. Milstein, C. Chambers
  Automatically Proving the Correctness of Compiler Optimizations
  Tech Report, UW, shorter version appeared in PLDI 03
• K. Cooper, L. Xu
  An Efficient Static Analysis Algorithm to Detect Redundant Memory Operations
  ACM Workshop on Memory System Performance, June 2002.
• X. Zhang, R. Gupta
  Hiding Program Slices for Software Security
  IEEE/ACM CGO 2003.
• S. Tallam, R. Gupta
  Bitwidth Aware Global Register Allocation
  ACM POPL 2003
• S. Nandy, X. Gao, J. Ferrante
  TFP: Time-sensitive, Flow-specific Profiling at Runtime
  Proceedings of the Workshop on Languages and Compiling for Parallel Computing (LCPC), October, 2003.
  Note: There may be some potential projects associated with this paper.
• L. Carter, J. Ferrante, and C. Thomborson
  Folklore Confirmed: Reducible Flow Graphs are Exponentially Larger
  ACM Symposium on Principles of Programming Languages (POPL), January 2003.
  Note: There is a potential project on software obfuscation associated with this paper.
•