Lecturer	Alessandro Abate
Degrees	Schedule B2 (CS&P) — Computer Science and Philosophy Schedule B2 — Computer Science Schedule B2 — Mathematics and Computer Science Schedule B — MSc in Advanced Computer Science
Term	Michaelmas Term 2014  (16 lectures)

Overview

This course introduces the fundamentals of computer-aided formal verification. Computer-aided formal verification aims to improve the quality of digital systems by using logical reasoning, supported by software tools, to analyse their designs. The idea is to build a mathematical model of a system and then try to prove formal properties of it that validate the system's correctness, or at least help discover subtle bugs. The proofs can be millions of lines long, so specially-designed computer algorithms are used to search for and check them.

This course provides a survey of several major software-assisted verification methods, covering both theory and practical applications. The aim is to familiarise students with the mathematical principles behind current verification technologies and give them an appreciation of how these technologies are used in industrial system design today.

Synopsis

1. Introduction.
2. Modelling sequential systems, Kripke structures.
3. Temporal logic: LTL, CTL*, and CTL.
4. Specifying systems with temporal logic.
5. Reachability calculations, model checking.
6. Binary Decision Diagrams (BDDs).
7. Algorithms over BDDs.
8. Combinational equivalence checking.
9. Symbolic model checking.
10. Propositional SAT.
11. Model Checking with SAT.
12. Abstraction Refinement.
13. Decision procedures.
14. Decision procedures in Model Checking.
15. Practical, industrial-scale hardware verification.
16. Computer-aided software verification.

Syllabus

Introduction to formal hardware verification. Binary Decision Diagrams and their use in combinational equivalence checking. Modelling sequential systems; Kripke structures. Specifying systems with temporal logic; CTL*, CTL and LTL. Reachability and symbolic model checking. New model checking approaches based on algorithms for Boolean satisfiability. Automatic abstraction refinement. Decision procedures and their use in combination with model checking. Practical, industrial-scale hardware verification. Current approaches to computer-aided software verification.

Reading list

The lectures will be supplemented with notes and pointers to published articles in the field. The following may be helpful for reference or further reading on specific topics.

Surveys

• Formal Verification in Hardware Design: A Survey, by C. Kern and M. R. Greenstreet, ACM Transactions on Design Automation of Systems , vol. 4 (April 1999), pp. 123-193.
• A Survey of Automated Techniques for Formal Software Verification , by D'Silva et al., IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), 2008

Binary Decision Diagrams and SAT

• An Introduction to Binary Decision Diagrams, by Henrik Reif Andersen, Lecture Notes (Technical University of Denmark, October 1997).
• Formal Hardware Verification with BDDs: An Introduction, by Alan J. Hu, IEEE Pacific Rim Conference on Communications, Computers, and Signal Processing (1997), pp. 677-682.
• Chapter 2 in Decision Procedures, by Daniel Kroening and Ofer Strichman, Springer, 2008
• Handbook of Satisfiability, Biere, Heule, Van Maaren, Walsh, IOS Press 2009.

BDDs and Model Checking

• Logic in Computer Science: Modelling and reasoning about systems, by Michael Huth and Mark Ryan (Cambridge University Press, 2000).
• Model Checking, by Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled, Second printing (The MIT Press, 2000).
• Concepts, Algorithms, and Tools for Model Checking, Unpublished lecture notes by J.-P. Katoen, 1998.

Related research

Themes	Automated Verification
Activities	Model Checking | Concurrency | Software Model Checking

Taking our courses

This form is not to be used by students studying for a degree in the Department of Computer Science, or for Visiting Students who are registered for Computer Science courses

Other matriculated University of Oxford students who are interested in taking this, or other, courses in the Department of Computer Science, must complete this online form by 17.00 on Friday of 0th week of term in which the course is taught. Late requests, and requests sent by email, will not be considered. All requests must be approved by the relevant Computer Science departmental committee and can only be submitted using this form.