CS243: Program Analysis and Optimization Winter 2016This page is updated frequently, so check back often. All materials for the course will be posted here.
What do we teach?
This course teaches program analysis techniques used in compilers and software development tools to improve productivity, reliability, and security. Emphasis on the methodology of applying mathematical abstractions such as graphs, fixpoint computations and binary decision diagrams to writing complex software, using compilers as an example.
How do you learn this?
This is a course where math and programming meet. Learning compiler techniques has much in common with learning mathematical proofs. You learn by trying, finding your own insights. This means the assignments can take a variable amount of time! We want you to formulate your own variations of problems and solve them.
How is the course structured?
- Highly interactive lectures, textbook reading.
- Programming assignments analyze Java code.
- Problem sessions for discussion.
- Piazza for offline questions.
- Midterm and Final.
Logistics When, where, what and how
|Lectures||Tuesdays and Thursdays 3:00pm - 4:20pm in Gates B01|
|Problem Session||Friday 1:30pm - 2:20pm in Gates B03|
|Prerequisites||CS 103 or CS 103B, and CS 107; Java programming language experience|
|Textbook||Compilers: Principles, Techniques, & Tools (Second Edition), Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, Addison-Wesley, 2007.|
|Class Q&A Website||CS243 on Piazza - for all questions related to the material|
|Videos of Lectures||SCPD Webcast for Stanford Students|
|Staff Mailing List||for administrative questions|
|Midterm||February 11 in Gates B01|
|Final||March 15 (Tuesday) 7:00pm-10:00pm|
Staff Professor and TA details
IMPORTANT Contact us using the for administrative questions.
Monica Lam, Instructor
|Office Hours||By arrangement via|
Megan Harris, Admin
Neeral Dodhia, TA
|Office Hours||Wed 4:30-6 pm
Thur 9-10:30 am
Rakesh Ramesh, TA
|Office Hours||Mon 6-7:30 pm
Fri 4:30-6 pm