FI:IA159 Formal Verification Methods - Course Information
IA159 Formal Verification Methods
Faculty of InformaticsSpring 2014
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- Teacher(s)
- prof. RNDr. Jan Strejček, Ph.D. (lecturer)
- Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics - Timetable
- Thu 14:00–15:50 B411
- Prerequisites
- IA006 Automata theory
It is recommended to attend courses IA040 Modal and Temporal Logics for Processes and IV113 Introduction to Validation and Verification before registering this course. - Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Applied Informatics (programme FI, N-AP)
- Information Technology Security (programme FI, N-IN)
- Bioinformatics (programme FI, N-AP)
- Information Systems (programme FI, N-IN)
- Parallel and Distributed Systems (programme FI, N-IN)
- Computer Graphics (programme FI, N-IN)
- Computer Networks and Communication (programme FI, N-IN)
- Computer Systems (programme FI, N-IN)
- Embedded Systems (eng.) (programme FI, N-IN)
- Embedded Systems (programme FI, N-IN)
- Service Science, Management and Engineering (eng.) (programme FI, N-AP)
- Service Science, Management and Engineering (programme FI, N-AP)
- Social Informatics (programme FI, B-AP)
- Theoretical Informatics (programme FI, N-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, N-SS) (2)
- Artificial Intelligence and Natural Language Processing (programme FI, N-IN)
- Image Processing (programme FI, N-AP)
- Course objectives
- At the end of this course, students should be able to: understand and explain principles, advandtages, and disadvantages of basic formal verification methods, namely model checking methods, symbolic execution, abstract interpretation, and theorem proving;
make reasoned decisions about suitability of various methods for verification of specific systems; - Syllabus
- Overview of formal verification methods.
- Deductive verification methods (theorem proving).
- LTL model checking of finite and infinite-state systems.
- State explosion problem, partial order reduction, abstraction.
- Counter-example guided abstraction refinement.
- Bounded model checking.
- Symbolic execution.
- Static analysis, abstract interpretation.
- Verification tools.
- Literature
- Teaching methods
- lectures
- Assessment methods
- oral exam
- Language of instruction
- English
- Further Comments
- Study Materials
The course is taught annually.
- Enrolment Statistics (Spring 2014, recent)
- Permalink: https://is.muni.cz/course/fi/spring2014/IA159