Formal verification

Summary

We introduce formal verification as an approach for developing highly reliable systems. Formal verification finds proofs that computer systems work under all relevant scenarios. We will learn how to use formal verification tools and explain the theory and the practice behind them.

Content

Learning Prerequisites

Recommended courses

CS-320 Computer language processing

Important concepts to start the course

Discrete Mathematics (e.g. Kenneth Rosen: Discrete Mathematics and Its Applications)

Learning Outcomes

By the end of the course, the student must be able to:

• Formalize specifications
• Synthesize loop invariants
• Specify software functionality
• Generalize inductive hypothesis
• Critique current software development practices
• Formalize specifications
• Synthesize loop invariants
• Specify software functionality
• Generalize inductive hypothesis
• Critique current software development practices

Teaching methods

Instructors will present lectures and exercises and supervise labs on student laptops.

Expected student activities

Follow the course materials, take mid-term, and complete and explain projects during the semester.

Assessment methods

The grade is based on the written mid-term, as well as code, documentation, and explanation of projects during the semester. Specific percentages will be communicated in the first class.

Supervision

Resources

Bibliography

• Harrison, J. (2009). Handbook of Practical Logic and Automated Reasoning. Cambridge: Cambridge University Press. doi:10.1017/CBO9780511576430
• Aaron Bradley and Zohar Manna: The Calculus of Computation - Decision Procedures with Applications to Verification, Springer 2007.
• Michael Huth and Mark Rayan: Logic in Computer Science - Modelling and Reasoning about Systems. Cambridge University Press 2004.
• Handbook of Model Checking, https://www.springer.com/de/book/9783319105741 Springer 2018. Including Chapter Model Checking Security Protocols by David Basin.
• Tobias Nipkow, Gerwin Klein: Concrete Semantics with Isabelle/HOL. http://concrete-semantics.org/concrete-semantics.pdf
• Nielson, Flemming, Nielson, Hanne R., Hankin, Chris: Principles of Program Analysis. ISBN 978-3-662-03811-6. Springer 1999.
• Peter B. Andrews: An Introduction to Mathematical Logic and Type Theory (To Truth Through Proof), Springer 2002.
• http://logitext.mit.edu/tutorial

Ressources en bibliothèque

• Handbook of Practical Logic and Automated Reasoning / Harrison
• Handbook of model checking / Clarke
• [chapter] Model Checking Security Protocols / Bassin
• Introduction to mathematical logic and type theory / Andrews
• The Calculus of Computation / Bradley
• Logic in Computer Science / Huth
• Principles of Program Analysis / Flemming

Notes/Handbook

See sldes on course page

Websites

• https://gitlab.epfl.ch/lara/cs550

Videos

• http://See links on course page

Prerequisite for

MSc thesis in the LARA group