A hands-on introduction to the theory and construction of deductive software verifiers, covering both cutting-edge methodologies for formal program reasoning, and a perspective over the broad tool stacks making up modern verification tools.
Students will earn the necessary skills for designing and developing deductive verification tools which can be applied to modularly analyse complex software, including features challenging for reasoning such as heap-based mutable data and concurrency. Students will learn both a variety of fundamental reasoning principles, and how these reasoning ideas can be made practical via automatic tools.
Students will be gain practical experience with reasoning tools at various levels of abstraction, from SAT and SMT solvers at the lowest level, up through intermediate verification languages and tools, to verifiers which target front-end code in executable languages.
By the end of the course, students should have a good working understanding and experience of the issues and decisions involved with designing and building practical verification tools, and the theoretical techniques which underpin them.
The course will be organized around building up a "tool stack", starting at the lowest-level with background on SAT and SMT solving techniques, and working upwards through tools at progressively-higher levels of abstraction. The notion of intermediate verification languages will be explored, and the Boogie (Microsoft Research) and Viper (ETH) languages will be used in depth to tackle increasingly ambitious verification tasks.
The course will intermix technical content with hands-on experience; at each level of abstraction, we will build small tools on top which can tackle specific program correctness problems, starting from simple puzzle solvers (Soduko) at the SAT level, and working upwards to full functional correctness of application-level code. This practical work will include three mini-projects (each worth 10% of the final grade) spread throughout the course, which count towards the final grade. An oral examination (worth 70% of the final grade) will cover the technical content covered.
Course catalogue: 263-2812-00L
Lecturer: Dr. Alexander Summers
Credits: 4 credits
Some programming experience is essential, as the course contains several practical assignments. A basic familiarity with propositional and first-order logic will be assumed.
Courses with an emphasis on formal reasoning about programs (such as Formal Methods and Functional Programming) are advantageous background, but are not a requirement.
Make sure to register your group (of two students) for the first project by 14:00 on Monday 27th February. Please email your intended group to
You can find the description of the first assessed project here (PDF, 115 KB). The initial files can be found in this .zip file (ZIP, 349 KB). The project must be carried out in your pre-registered groups. The deadline is Tuesday 28th March (by midnight).
|22nd February (Week 1)||Overview, SAT Solving Algorithms|
|1st March (Week 2)||Encoding Problems to SAT||2. Encoding Problems to SAT (PDF, 1.7 MB)|
|8th March (Week 3)||SMT Solving Algorithms||3. SMT Solving Algorithms (PDF, 1.3 MB)|
|15th March (Week 4)||Quantifiers||4. Quantifiers (PDF, 1.7 MB)|
|22nd March (Week 5)||Encoding to SMT||5. Encoding to SMT (PDF, 1.1 MB)|
|22nd February (Week 1)||1. SAT Solving Algorithms (PDF, 85 KB)||1. SAT Solving Algorithms (PDF, 187 KB)|
|1st March (Week 2)||2. Encoding Problems to SAT (PDF, 74 KB)||2. Encoding Problems to SAT (PDF, 130 KB)|
|8th March (Week 3)||3. SMT Solving Algorithms (PDF, 94 KB)||3. SMT Solving Algorithms (PDF, 138 KB)|
|15th March (Week 4)||4. Quantifiers (PDF, 84 KB)|
|22nd March (Week 5)||5. Encoding to SMT (PDF, 85 KB)|