Topic Selection due November 8, 2005
Write Up due December 1, 2005
Presentations during Final Exam: 8pm, December 12, 2005
Each student must choose a research paper (that is mutually agreeable with the professor) on a topic related to programming language or compilers. The student will read this paper and any background material and related work necessary to undertand the paper and its contribution. Each student will write a short summary and critique of the paper and give a brief presentation on that paper.
The write up should be one to two pages and include both a summary of the paper and also a critical evaluation (e.g., a discussion of the idea/techniques/tools applicability, an evaluation of the experimental methods used and their limitations, comparison with other approaches).
The oral presentations should be 4 to 5 minutes length and should--if applicable--discuss the problem being solved, outline the solution described in the paper, and give a brief evaluation of the solution. Presentations may make use of the chalk board, overhead-slides, or powerpoint or pdf. Powerpoint or pdf slides should be emailed to the professor in advance. A 4 to 5 minute presentation will probably require 2 to 6 slides.
Students should email vonronne@cs.utsa.edu by November 8 with their selected topic. They should also mention if they would like give a presentation prior to December 12.
| Presenter | Date/Time | Paper | |
|---|---|---|---|
| Atlas Cook | Dec. 12, 8:00pm | Kulkarni, et al. | Fast Searches for Effective Optimization Phase Sequences |
| Ankita Shah | Eric Allen, et al. | Object-Oriented Units of Measurement | |
| Humayun Zafar | D. Das and U. Ramakrishna | A practical and fast iterative algorithm for φ-function computation using DJ graphs | |
| Russel MacShane | Chen, et al. | A Simple Typed Intermediate Language for Object-Oriented | |
| Namwook Kang | Nathanael Schaerli, et al. | OO Encapsulation for Dynamically Typed Languages | |
| Mark Robinson | William R. Mark, et al. | Cg: A System for Programming Graphics Hardware in a C-like Language | |
| Olga Luganska | Suganuma, et al. | Design and Evaluation of Dynamic Optimization for a Java ... | |
| Adam Cramer | Lerner, et al. | Automatically Proving the Correctness of Compiler Optimizations | |
| Kevin Do | Birka, et al. | A Practical Type System and Language for Reference Immutability | |
| Emre Brookes | Hall, et al. | Interprocedural Parallelization Analysis in SUIF | |
| Xu Su | Venet, et al. | Precise and Efficient Static Array Bound Checking... | |
| John Doan | Rastello, et al. | Optimizing Translation Out of SSA Using Renaming Constraints | |
| Neil Kalinowksi | Alex Aleta, et al. | Demystifying On-the-fly Spill Code | |
| Jessica Alvarez | Cavazos, et al. | Inducing Heuristics to Decide Whether to Schedule | |
| Andrew Byrd | Manson, et al. | The Java Memory Model | |
| Fred Diehl | 9:30pm 12/12/05 | Cooper et al. | An Efficient Static Analysis Algorithm to detect redundant Memory Operations |
| Krishna Yetukuri | TBD | Boehm, et al. | Threads Cannot Be Implemented As a Library |
Presentations will be evaluated using a rubric similar to the following:
There may need to be corrections, clarifications, or other modifications to these instructions, you are responsible for monitoring the class web site, monitoring your CS account mailboxes, and listening during lecture for announcements related to this assignment.