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: Mon (16.50-17.40), Wed (14.00-15.15), Thu (15.25-16.40); J slot. Class room CS26.
Teacher : V. Krishna Nandivada
Office hours / Doubt sessions : Anytime.
TA : Akash Mishra (CS19M008@smail)
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.
- Paper 5: Improved Bitwidth-aware Variable Packing: Nandivada and Barik, TACO 2013.
- Paper 6: Improved MHP Analysis: A Shankar, S S Chakraborty, and V K Nandivada, CC 2016.
- Paper 7: A loop transformation theory and an algorithm to maximize parallelism, Wolf and Lam, IEEE TPDS 1991.
- Paper 8: Uniprocessor Garbage Collection Techniques, Paul R Wilson, 1992.

Slides for the Lectures:

Two LH. Introduction, overview of lexical and syntax analysis.
Two LH. JavaCC, Visitor Pattern and JTB.
Six LH. Symbol Table Creation and IR Generation, IR generation for OO languages.
Six LH. Data Flow Analysis, constant propagation, conditional constant propagation.
Four LH. Control Flow Analysis and optimizations (forward dataflow analysis).
Four LH. Call graph construction, interprocedural constant propagation, function inlining (using CHA).
Eight LH. Alias and Points-to analysis for C and Java. Flow sensitive and insensitive analysis. Introduction to Escape Analysis. On the board teaching.
Eight LH. Dependence Analysis, Dependence Testing, overview of optimizations, loop optimizations.
Four LH. SSA and optimizations, sparse conditional constants paper.
Five LH. Register Allocation. Paper on iterated register coalescing register allocation. Paper on linear scan register allocation.

Assignment	What?	Credit	Start date	Mid-Eval date	Due-date
P1	Refresh Scanning+Parsing	5%	16 Jan 2020	-	23 Jan 2020, 11:59PM
P2	IR Generation	5%	31 Jan 2020	05 Feb 2020	13 Feb 2020, 11:59PM
P3	Conditional Constant Propagation	10%	14 Feb 2020	17 Feb 2020	05 Mar 2020, 11:59PM
P4	Function Inlining	10%	06 Mar 2020	09 Mar 2020,	30 Mar 2020, 11:59PM
P5	~~MHP Analysis~~	~~10%~~	31 Mar 2020	06 Mar 2020	Covid-19 effect

Paper reading / presentation / critic: 10+5 marks. Papers' details: here.

Written Exams:

Quiz 1 exam (10%) on Feb 19th 2020 (Wed), 02.00pm. Closed book, closed notes, closed neighbor.
~~Quiz 2 exam (10%) on Mar 18th 2020 (Wed), 02.00pm. Closed book, closed notes, closed neighbor.~~ Covid-19 effect
Final exam (30% + 15%) on May 03th 2020 (Sat), 02.00pm. Open book, Open notes, closed neighbor.

Semester Over Last updated: Mon May 4 09:49:15 IST 2020