The set of topics and especially the dates when each topic will be discussed
is subject to change.
Lecture |
Date |
Topic |
|
1 |
Tue, Aug. 31 |
Course overview, motivation and historical perspective. A language and its operational sematics (PDF) |
Winskel chapter 2 |
2 |
Thu, Sep. 2 |
Axiomatic Semantics. Hoare Rules (PDF) |
|
3 |
Tue, Sep.7 |
Weakest preconditions. Verification condition generation (same slides as above). |
|
4 |
Thu, Sep. 9 |
VC Generation by Symbolic Evaluation Extensions and Pitfalls of VC Generation (same slides as above). |
|
5 |
Tue, Sep.14 |
Finish VC Generation (same slides as above). |
|
6 |
Thu, Sep. 16 |
Theories. Decision Procedures. (PDF) |
|
7 |
Tue, Sep. 21 |
The Nelson-Oppen prover architecture (PDF) |
|
8 |
Thu, Sep. 23 |
Proof generation for Nelson-Oppen Provers. Proof representation. (same slides as above) |
|
9 |
Tue, Sep. 28 |
Linear Arithmetic Algorithms: (some of) Pratt, Shostak, Fourier-Motzkin, SUP-INF (PDF) |
|
10 |
Thu, Sep. 30 |
Linear Arithmetic: Simplex (same slides as above) |
|
11 |
Tue, Oct. 5 |
ACL2 prover (lecture by J. Strother Moore) |
|
12 |
Thu, Oct. 7 |
Equality and Congruence Closure (PDF) |
|
13 |
Tue, Oct. 12 |
Finding Satisfiability Procedures based on Congruence Closure: Lists, Arrays (same slides as above) |
|
14 |
Thu, Oct. 14 |
Java Modeling Language and ESC-Java (Marco Zennaro) (PDF) |
|
15 |
Tue, Oct. 19 |
Tactic Based Theorem Proving (PDF) |
|
16 |
Thu, Oct. 21 |
Reasoning about pointer-based data structures (Scott McPeak) (PDF) |
|
17 |
Tue, Oct. 26 |
More pointer-based data structures (Scott McPeak) (same slides as above) |
|
|
Thu, Oct. 28 |
No lecture |
|
18 |
Tue, Nov. 2 |
Interactive Theorem Proving with CoQ (Adam Chlipala) (PDF) |
|
|
Thu, Nov. 4 |
No lecture |
|
19 |
Tue, Nov. 9 |
Randomized decision procedures (Sumit Gulwani) |
|
|
Thu, Nov. 11 |
Veterans Day |
|
20 |
Tue, Nov. 16 |
Synthesizing |
|
21 |
Thu, Nov. 18 |
Lazy Abstraction (Ranjit Jhala) |
|
22 |
Tue, Nov. 23 |
Lazy Abstraction (Ranjit Jhala) |
|
|
Thu, Nov. 25 |
Thanksgiving |
|
23 |
Tue, Nov. 30 |
Temporal Logics (Arindam Chakrabarti) (PDF) |
|
24 |
Thu, Dec. 2 |
SAT solvers (Manu Shridharan) (PDF) |
|
25 |
Tue, Dec . 7 |
Decision Procedures based on SAT solvers (Evan Chang) |
|
26 |
Thu, Dec. 9 |
Project presentations |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The textbooks referenced above are the following:
·
Glynn Winskel, “The Formal Semantics of
Programming Languages”, MIT press, ISBN 0-262-23169-7, 1996 edition.