JKU

TNF / INF

team
contact
software
publications
teaching
jobs


GI-Dissertation Award 2020

FMCAD'20 Student Forum Best Student Contribution

SAT'20 Best Presentation Award

GCAI'19 Post and Interaction Award

IJCAI-JAIR 2019 Award

SAT'19 Best Student Paper

CAV'18 Award

HVC'17 Best Paper

ETAPS'17 Test of Time Award

HVC'15 Award

FMCAD'17 Best Paper

CADE'17 Best Paper

BMC

Handbook of Satisfiability

UML@Classroom

UML@Classroom

www.digitaltechnik.org

Advanced Topics in Informatics

Satisfiability Modulo Theory

Spezielle Kapitel in Informatik (3KV)

Summer Semester 2014

Organizers

Prof. Armin Biere, Dr. Martina Seidl

Overview

SMT (Satisfiability Modulo Theories) extends logic formulas by theories of various kinds. Examples of such theories are integer arithmetic, bit vectors, arrays, etc. On this basis, many SMT solvers have been implemented which are successfully used in applications like verification, testing, program analysis and scheduling.

This lecture is about algorithms for SMT and their practical implementation.

Resources