CS 6013 - Modern Compilers - Theory and Practice

Goal of the course: At the end of the course, students will have a fair understanding of some standard passes in a general purpose compiler. Students will have hands on experience on implementing a few program analyses and optimization techniques.

Time and Place: Wed (2.00-3.40pm), Fri (3.00-4.40pm), R-T slots. Class room # CS 24.
Teacher : V. Krishna Nandivada
Office hours / Doubt sessions : Anytime.
TA : Aman Nougrahiya (amannoug@cse).
Office hours / Doubt sessions : Fix a time by sending an email.
Course outline.
Software, documentation and tools link is here.
Submission guidelines.
Discussion website is here (access restricted).
Texts:
- Book 1: Advanced Compiler Design and Implementation: Steven Muchnick.
- Book 2: Compilers: Principles, Techniques, and Tools: A V Aho, Monical Lam, R Sethi, J D Ullman.
- Book 3: Principles of Program Analysis: Flemming Nielson, Hanne Riis Nielson, Chris Hankin, Springer, 2005.
- Book 4: Modern compiler implementation in Java, Second Edition, Andrew W. Appel, Jens Palsberg, Cambridge University Press, 2002.
- Book 5: The Java programming language, Arnold, Gosling and Holmes, Addison-Wesley, 2005. Also see the online manuals in the documentation section.
- Paper 0: The Fortran Automatic Coding system, Backus et al, 1957.
- Paper 1: A unified approach to program optimization: Gary A Kildall, 1973.
- Paper 2: Constant Propagation with conditional branches: Wegman and Zadeck.
- Paper 3: Interprocedural constant propagation: Callahan, Cooper, Kennedy and Torczon.
- Paper 4: Linear Scan Register Allocation: Poletto and Sarkar.

Slides for the Lectures:

July 31, Aug 2, 5 2013. Introduction, overview of lexical and syntax analysis
Aug 5 2013. JavaCC, Visitor Pattern and JTB
Aug 6, 7, 9 2013. IR Generation
Aug 14, 16 2013. IR Generation for OO code and Control Flow Analysis
Aug 28, 30, Sep 04 2013. Data Flow Analysis and Constant Propagation
Sep 06 2013. Interprocedural Constant Propagation
Sep 11, 13 2013. SSA and optimizations. SSA and sparse conditional constants paper.
Sep 18, 20, 25 2013. Control flow analysis and control flow optimizations.
Sep 27, Oct 01 2013. Alias and Points-to analysis for C and Java.
Oct 04, 09, 11 2013. Register Allocation. Paper on iterated register coalescing register allocation. Paper on linear scan register allocation.
Oct 16, 18 2013. Bitwdith Aware Register Allocation. Paper on Bitwidth Aware Register Allocation. Paper on Improved Bitwidth-Aware Variable Packing.
Oct 23, 25, 30, Nov 1 2013 Dependence Analysis, Optimizations overview and Loop optimizations, Garbage Collection.

Assignment	What?	Credit	Start date	Mid-Eval date	Due-date
P1	Refresh Scanning+Parsing	5%	02 Aug 2013	-	09 Aug 2013, 11:59AM
P2	IR Generation	5%	12 Aug 2013	19 Aug 2013, 11:59AM	28 Aug 2013, 11:59AM
P3	Constant Propagation	5%	30 Aug 2013	06 Sep 2013, 11:59AM	13 Sep 2013, 11:59AM
P4	Sparse Conditional Constant Propagation	10%	13 Sep 2013	23 Sep 2013, 11:59AM	04 Oct 2013, 11:59AM
P5	Points-to Analysis	10%	04 Oct 2013	14 Oct 2013, 11:59AM	23 Oct 2013, 11:59AM
P6	Bitwidth-sensitive Register Allocation	10%	24 Oct 2013	29 Oct 2013, 11:59AM	14 Nov 2013, 11:59AM
P7	Paper reading	10%	22 Oct 2013	-	-

Written Exams:

Midterm exam (20%) on Sep 27th 2013, 2pm. Closed book, closed notes, closed neighbor. sample solution.
Final exam (25%) on Nov 20th 2013, 2pm. Closed book, closed notes, closed neighbor. sample solution.

Under construction Last updated: Thu Oct 24 21:13:55 IST 2013