| Date |
Tuesday, Thursday |
Friday |
Homework |
| Jan 29 - Feb 2 |
Introduction; functional programming (numbers, lists); basic proofs:
Coq Installation Notes;
Preface; Basics; Induction; Lists (
Basics.v,
Induction.v,
Lists.v
) |
Lab |
Homework 1 |
| Feb 5-9 |
Sequent Calculus,
Polymorphism, More basic tactics (Poly.v, Tactics.v) |
Lab |
Homework 2 |
| Feb 12-16 |
Logic in Coq,
Inductively defined propositions,
Curry-Howard correspondence
(Logic.v, IndProp.v,
ProofObjects.v) |
Lab |
Homework 3 |
| Feb 19-23 |
ML programming language;
Caml core language, Caml reference;
Installing Ocaml;
interp.ml, lambda.ml;
Denotational Semantics;
Binomial Queues (book, slides),
Maps
| Lab |
Homework 4 |
| Feb 26 - Mar 1 |
Proving correctness of functional programs,
permutations,
selection sort,
insertion sort
(VFA.v,
Perm.v,
Selection.v,
Sort.v)
Maps,
Search Trees,
Abstract Data Types
(Maps.v
SearchTree.v,
ADT.v)
|
Lab |
Homework 5 |
| Mar 4-8 |
SOS, Imperative programs,
Automation
( Imp.v, Auto.v);
Search trees,
Red-Black trees,
(SearchTree.v,
Redblack.v)
|
Take-home midterm due |
| Spring Break: No class March 11-15
|
| Mar 18-22 |
Program Equivalence (Equiv.v), Hoare Logic (Hoare.v) |
Lab |
Homework 6 |
| Mar 25-29 |
Hoare Logic 2 (Hoare2.v),
Small-step operational semantics (Smallstep.v),
Type systems
(lecture notes; Types.v)
|
Lab |
Homework 7 |
| Apr 1-5 |
Simply typed lambda calculus;
Type Soundness;
subtyping
(lecture notes,
Stlc.v, StlcProp.v, Sub.v)
|
Lab |
Homework 8 |
| Apr 8-12 |
SAT, SMT (reading: Boolean Satisfiability Solvers); Dafny (selection sort)
|
Lab |
Homework 9
|
| Apr 15-19 |
Separation Logic
(read Chapters 2 and 3 of PLCC); Verifiable C, vc.tgz
|
Lab |
|
| Apr 22-26 |
Verifying C programs (Verifiable C),
vc.tgz
|
Lab |
|
| April 29 |
Reading period |
|
| May 7 |
Homework 10 due (if you're not doing Homework 11) |
| Homework 10 |
| May 10 |
Homework 11 due (if you didn't do Homework 10) |
| Homework 11
|
