Class Tu/Th 9:00 - 10:20 a.m. in PH A18B
Recitation F 9:30 - 10:20 a.m. in GHC 4211
aldrich and clegoues at cs dot cmu dot edu
WEH 4216 and 5117
Office hours to be selected (with student input) on the first day of class
For appointments outside of office hours, email the instructor.
This course covers both foundations and practical aspects of the automated analysis of programs, which is becoming increasingly critical to find software errors and assure program correctness. The theory of abstract interpretation captures the essence of a broad range of program analyses and supports reasoning about their correctness. Building on this foundation, the course will describe program representations, data flow analysis, alias analysis, interprocedural analysis, dynamic analysis, and symbolic execution. Through assignments and projects, students will design and implement practical analysis tools that find bugs and verify properties of software.
New: For 2018, this course fulfills the Logic and Languages constrained elective category for the Computer Science major.
Why take this course?
- Explore the meaning of programs. One of the most basic questions that programmers ask is "What does this program do?" Program analysis is all about understanding programs--automatically!
- Learn deep theory. The theory of abstract interpretation stands with type theory as the most important and beautiful foundations of programming languages. Abstract interpretation is the fundamental theory of abstraction: how to precisely relate the concrete execution of a program to an abstraction of that execution. Naturally, this has many applications, which brings us to the third reason to take this course:
- Build awesome tools. Using program analysis, you can build tools that find bugs, prove important security and correctness properties, automatically generate useful tests, and much more--and you'll have a chance to do all of this in course assignments and a project that you can design yourself (if you want).
Course Syllabus and PoliciesThe syllabus covers course learning objectives, supplemental textbooks, assessments, late work policy, and policies.
|Date||Topic and Notes||Additional Reading or Code||Assignments Due|
|Jan 16||Introduction, Program Representation, and Syntactic Analysis
(notes, slides, in-class exercises)
|PPA ch. 1 (optional)|
|Jan 18||Program Semantics
|Jan 19||RecitationSyntactic Analysis in Soot||17-355-lab-1.zip|
|Jan 23||Dataflow Analysis and Abstract Interpretation||PPA ch. 2 (optional)
|Jan 25||Dataflow Analysis and Abstract Interpretation (continued)||PPA ch. 6 (optional)||hw1|
|Jan 30||Dataflow Analysis examples|
|Feb 1||Dataflow Analysis termination and complexity||PPA ch. 4 (optional)||hw2|
|Feb 2||recitationSpecifying Dataflow Analysis|
|Feb 6||Widening and collecting|
|Feb 8||Dataflow Analysis wrap-up||hw3|
|Feb 9||RecitationImplementing dataflow analysis|
|Feb 13||Interprocedural analysis|
|Feb 15||Control flow analysis and dynamic dispatch||hw4|
|Feb 16||RecitationProving analyses correct|
|Feb 20||Context-sensitive interprocedural analysis|
|Feb 22||Interprocedural analysis, continued||hw5|
|Feb 23||RecitationInterprocedural analysis in Soot|
|Feb 27||Pointer analysis|
|Mar 1||Hoare Logic||hw6|
|Mar 2||RecitationMidterm review|
|Mar 6||Hoare Logic|
|Mar 8||Midterm Exam|
|Mar 9||no recitationMid-Semester Break|
|Mar 20||Satisfiability Modulo Theories|
|Mar 22||Program synthesis||hw7|
|Mar 27||Program synthesis, continued|
|Mar 29||Symbolic execution||Mixing Type Checking and Symbolic Execution||Project proposal|
|Apr 3||Concolic execution and test generation|
|Apr 5||Dynamic analysis||hw8|
|Apr 10||Model checking|
|Apr 12||Model checking||hw9|
|Apr 17||Program repair|
|Apr 19||No lecture: Spring Carnival|
|Apr 20||no recitationSpring Carnival|
|Apr 26||Separation logic||Project checkpoint 1|
|May 4||No Recitation|
|Finals week||Project presentations||Project|