Formal verification is an exciting and fast-moving field of research. It borrows and contributes
ideas to many other areas of computer science e.g. automata theory, machine learning. In this course, we will study
some classical and some recent papers in formal verification applied to software.
The themes of this year are: program synthesis, applications of learning theory to verification,
and interprocedural analysis. Every participant will be assigned some papers to be presented in the class
and will also be required to make a presentation on his/her ongoing research work.
The pre-requisites for taking this course are Program Analysis and Verification (E0 227) or
Automated Verification (E0 223). In other cases, you can seek permission from the instructor.
Course contents
The list of papers that we want to study in this course is given below.
Name of the person presenting the paper is mentioned in parentheses.
Everyone else participating in the course is also expected to read the paper before the presentation
and engage in active participation in the class.