Course Projects

(due Mar 28, Apr 11)
These are possible topics, but you can choose your own project (not in this list) after discussing with the instructor.

Number of students per team: Maximum 2 (you can work alone, but the amount of work expected from the project would be the same as that with two students)
Evaluation: In two phases (CP1, CP2), presentations and project demo on the due dates.

Topics

  1. From the traversal trace of a data structure, find out if it is a list, tree, DAG or a general graph.
  2. Using Steensgaard's equivalence classes, improve Andersen's analysis.
  3. Create a language (and perform optimizations) for board games.
  4. Identify strongly connected components on GPU.
  5. Implement parallel grep.
  6. Machine learning to choose memory allocation strategy.
  7. Approximate static analysis with hashing.
  8. Approximate parallel shortest paths computation.
  9. Implement Steensgaard's analysis and GH shape analysis in PHP (similar to Andersen's analysis).
  10. Your choice...

course home page