FI:IA159 Formal Verification Methods - Course Information
IA159 Formal Verification Methods
Faculty of InformaticsSpring 2009
- 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
Contact Person: prof. RNDr. Jan Strejček, Ph.D. - Timetable
- Thu 12:00–13:50 B411
- Prerequisites
- IA006 Automata theory
It is recommended to attend courses IA040 and IV113 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)
- Informatics (programme FI, M-IN)
- Informatics (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)
- Theoretical Informatics (programme FI, N-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
- 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
- Formal verification aims to verify correctness or improve reliability of software and hardware systems. At the end of this course, students should understand and be able to explain principles of basic formal verification methods (model checking methods, reachability analysis, abstract interpretations, and theorem proving). Students should also understand advantages and disadvantages of the metioned methods and techniques. Some crucial techniques (abstraction, partial order reduction, CEGAR, etc.) will be discussed in detail.
- Syllabus
- Models of systems
- Formal specification of program properties (modal and temporal logics)
- Automatic verification - reachability analysis, symbolic and explicit model checking, equivalence checking
- Deductive verification methods (theorem proving)
- Software testing
- Program analysis, abstraction, abstract interpretation
- Counter-example guided abstraction refinement
- Combining formal methods, SW tools BLAST, SPEC etc.
- Literature
- Assessment methods
- lectures, oral exam
- Language of instruction
- English
- Further Comments
- Study Materials
The course is taught annually.
- Enrolment Statistics (Spring 2009, recent)
- Permalink: https://is.muni.cz/course/fi/spring2009/IA159