Please make sure that you are registered for this course in Blackboard, as it will be used to send email and administrate results.
The course consists of five parts:
We use a course by Femke van Raamsdonk of the Free University Amsterdam. This will be taught by Freek using the following schedule:
|15 february||propositional logic & simple type theory||chapters 1 & 2|
|22 february||predicate logic & dependent types||chapters 4 & 6|
|29 february||second-order logic & polymorphism||chapters 7 & 8|
|7 march||inductive types & recursion||chapter 3|
|14 march||wrapping up Femke's course||chapters 5 & 9|
The students will be expected to have studied the chapters listed, and the material will be discussed then. You are welcome to ask for help at any time if you have any questions, either by email or by walking into our offices.
The practical work in Coq corresponding to Femke's course will be done using the ProofWeb system on the machine prover.cs.ru.nl. Each participant will get a login to the course page on this machine, and will get his/her password during the lectures.
The relevant links are:
Next we will go through another (slightly more advanced) introduction to Type Theory. This will be taught by Herman and Freek, using the following schedule:
|21 march||principal types and type checking||sections 4.1-4.3, 6.4||slides|
|4 april||Church-Rosser property||section 3.1||exercises|
|11 april||normalization of λ→ and λ2||sections 4.4, 5.6||slides|
This material overlaps with Femke's course, and therefore not all sections of the course notes will be discussed in the lectures in detail. (But you do have to know them for the test!)
The relevant links are:
After the fall break the course will be taught by Herman and Freek together. A research paper will be read, together with extra material needed to understand this. Each student will present part of this to the group.
This year the research paper will be on program verification:
As preparation we will read ten chapters from the book
Then we will read five papers from the CompCert community, culminating in the SHA-256 paper.
The student presentations will be held during the first hour. The assigned chapter(s) or paper needs to be presented, and we recommend to explain everything as much as possible through examples. During the second hour, the teachers will go deeper into the material presented.
The current schedule for the presentations is:
|9 may||Imp||Jeroen de Jong|
|13 may||ImpParser, ImpCEvalFun, Extraction, Tom's slides||Tom Salet|
|23 may||Hoare, Nico's slides||Nico Broeder|
|27 may||Hoare2, HoareAsLogic, Thomas' slides||Thomas Churchman|
|30 may||Smallstep, Auto, Zhuoran's slides||Zhuoran Liu|
|3 june||Mechanized semantics||Marta Parada Segui|
|6 june||Mechanized semantics for Clight, Pim's slides||Pim Jager|
|10 june||The CompCert Memory Model, Tom's slides||Tom Evers|
|13 june||Tactics for Separation Logic, Rick's slides||Rick Erkens|
|17 june||Verification of a Cryptographic Primitive: SHA-256,||(Freek)|
Each student will be doing a small Coq formalization assignment. This assignment will be chosen by the student from the following list of suggestions.
The test covers both the contents of the courses by Femke and Herman, as well as the contents of the presentations. The first test opportunity will be:
See the "paper exercises" above too, which are also exercises from old tests.
Each participant will get three grades: one for the presentation in the second half of the course, one for the individual Coq exercise, and one for the test. The final grade will be the average of these three grades.
There will be no grade for the practical work for Femke's course in ProofWeb, but this work will need to be finished to be allowed to pass the course.