FI:IA159 Formal Verification Methods - Course Information

IA159 Formal Verification Methods

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

Tue 8:00–9:50 A107

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)
• 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)
• 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

At the end of this course, students should be able to: understand and explain principles of basic formal verification methods, namely model checking methods, reachability analysis, abstract interpretations, and theorem proving;
make reasoned decisions about suitability of various methods for verification of specific systems;

Syllabus

• Overview of formal verification methods.
• Software testing.
• 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.
• Static analysis, abstract interpretation.
• Verification tools.

Literature

• PELED, Doron A. Software reliability methods. New York: Springer, 2001, xix, 331. ISBN 0387951067. info
• GRUMBERG, Orna, Doron A. PELED and E. M. CLARKE. Model checking. Cambridge: MIT Press, 1999, xiv, 314. ISBN 0262032708. info
• Model-Based Testing, http://www.goldpractices.com/practices/mbt/

Teaching methods

lectures

Assessment methods

oral exam

Language of instruction

English

Further Comments

Study Materials
The course is taught annually.

• Enrolment Statistics (Spring 2011, recent)
  
• Permalink: https://is.muni.cz/course/fi/spring2011/IA159