| Date |
Monday, Wednesday |
Thu/Fri |
Homework |
| Feb 3-7 |
Introduction; functional programming (numbers, lists); basic proofs:
Coq Installation Notes;
Preface; Basics; Induction; Lists (
Basics.v,
Induction.v,
Lists.v
) |
Lab |
Homework 1 |
| Feb 10-14 |
Sequent Calculus,
Polymorphism, More basic tactics (Poly.v, Tactics.v) |
Lab |
Homework 2 |
| Feb 17-21 |
Logic in Coq,
Inductively defined propositions,
Curry-Howard correspondence
(Logic.v, IndProp.v,
ProofObjects.v) |
Lab |
Homework 3 |
| Feb 24-28 |
ML programming language;
Caml core language, Caml reference;
Ocaml+Emacs;
interp.ml, lambda.ml;
Binomial Queues,
Maps
| Lab |
Homework 4 |
| Mar 2-6 |
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 9-13 |
SOS, Imperative programs,
Automation
( Imp.v, Auto.v);
Search trees
(SearchTree.v)
|
Take-home midterm due |
| Spring Break |
| Mar 23-27 |
Program Equivalence (Equiv.v), Hoare Logic (Hoare.v) |
Lab |
Homework 6 |
| Mar 30-Apr 3 |
Hoare Logic (Hoare2.v),
Small-step operational semantics (Smallstep.v),
Type systems
(lecture notes; Types.v)
|
Lab |
Homework 7 |
| Apr 6-10 |
Simply typed lambda calculus;
Type Soundness;
subtyping
(lecture notes,
Stlc.v, StlcProp.v, Sub.v)
|
Lab |
Homework 8 |
| Apr 13-17 |
Satisfiability (reading: Boolean Satisfiability Solvers); Dafny (selection sort)
|
Lab |
Homework 9
|
| Apr 20-26 |
Separation Logic
(read Chapters 2 and 3 of PLCC); Verifiable C.
| Lab |
|
|
| Apr 27-May 1 |
Verifying C programs (Verifiable C)
|
|
| May 4 |
reading period -- no class. Do Homework 10 or Homework 11, not both! |
Homework 10
due |
| May 13 |
Homework 11 due (if you didn't do Homework 10) |
Homework 11
|
