- Instructor: Kihong Heo ([email protected])
- TAs: Hyunsu Kim ([email protected]) and Wooseok Kang ([email protected])
- Time: Mon/Wed 09:00 - 10:30
- Office hour: Mon 10:30 - 11:30, N5 #2321
- Location: Zoom
"How to estimate the behavior of a program before it runs?"
This course introduces a technique called program analysis that answers the question. Instead of running programs with potentially infinite inputs, program analysis statically estimates runtime behaviors of programs within a finite time. The course will cover fundamental theories, designs and implementations of program analysis including formal semantics of programming languages and the theory of abstract interpretation.
- Homework 50%
- Final exam 40%
- Participation 10%
- Lecture slides will be provided
- Xavier Rival and Kwangkeun Yi, Introduction to Static Analysis: an Abstract Interpretation Perspective, MIT Press, 2020
This course includes programming assignments through which students will learn how to design and implement program analyzers. Students will use a few tools which are described here.
All submissions will be managed using Github.
For each assignment, a unique invitation URL for Github Classroom will be posted in the issue board.
Once you accept the invitation, a private repository for your assignment will be created.
You can push as many commits as you want before the deadline. We will grade the final commit of your master branch.
The late homework policy is as follows:
- 80% credit for one day late
- 50% credit for two days late
- NO credit given after two days late
Students who violates academic integrity will get an F.
| # | Topics | Reading | Homework |
|---|---|---|---|
| 0 | Functional Programming in OCaml | ||
| 1 | Introduction | [Chap. 1] |  HW0: Hello-world |
| 2 | Operational Semantics | HW1: OCaml Programming |
|
| 3 | Denotational Semantics | ||
| 4 | Concepts in Program Analysis | [Chap. 2], [Chap. 9] | HW2: SmaLLVM Interpreter |
| 5 | Abstract Interpretation | [Chap. 3] | |
| 6 | Design and Implementation of Static Analysis | [Chap. 4] | HW3: SmaLLVM Analyzer |
| 7 | Static Analysis for Advanced Programming Features | [Chap. 8.1], [Chap. 8.2] | |
| 8 | Advanced Static Analysis Techniques (1): Iteration Techniques |
[Chap. 5.2] | HW4 : ThriLLVM Analyzer |
| 9 | Advanced Static Analysis Techniques (2): Sparse Analysis |
[Chap. 5.3], [PLDI12] | |
| 10 | Advanced Static Analysis Techniques (3): Selective X-sensitivity |
[PLDI14] | |
| 11 | Advanced Static Analysis Techniques (4): Modular Analysis |
[Chap. 5.4], [InferBo] | |
| 12 | Specialized frameworks (1): Static Analysis by Equations |
[Chap. 10.1] | |
| 13 | Specialized frameworks (2): Static Analysis by Monotonic Closure |
[Chap. 10.2] | HW5: SmaLLVM Constraint-based analyzer |
| 14 | Specialized frameworks (3): Static Analysis by Proof Construction |
[Chap. 10.3] | HW6: SmaLLVM Type Checker |
| 15 | Program Analysis with AI | [PLDI18], [PLDI19], [ICSE19] | |
| - | Final Exam |