Course Overview

This course presents shared data structures, like BDD (Binary Decision
Diagrams), CEGAR algorithms, and SAT solving techniques based on
interpolation.

Learning Achievement

Competence

Course prerequisites

- Level B2 CEFR in English.
- Previous studies (Bachelor level) within the domain of computer
science or similar.

Grading Philosophy

Continuous assessment and final exam.

Course schedule

The following techniques are presented: symbolic verification of
finite models, static analysis, and verification through abstraction.

Course type

Lectures and practical work: 24 hours of lectures, 24 hours of tutorials.

Online Course Requirement

Instructor

Other information

Duration: 12 weeks

Language of instruction: English
Mode of delivery: Face-to-face teaching: lectures, tutorials

Site for Inquiry