News and materials can be found in the corresponding L2P learning room. Of course, there is also an appropriate Campus page.

Different approaches in computer science involve tools (solvers) to check if certain formulas are satisfiable. Examples can be found in the fields of hardware and software verification, counterexample generation, termination analysis of programs, and optimisation algorithms.

In this lecture we deal with the automatic check of satisfiability for different logics. Formulas of propositional logic can be checked for satisfiability using SAT-solvers (SAT=”satisfiability”). Extending the logic with different theories leads us to SMT-solvers (SMT=”satisfiability modulo theories”). To demonstrate practical relevance, we employ the above methods in the context of bounded model checking.

This course can be attended by bachelor students (as Wahlpflicht in theoretical computer science) as well as by master/diploma students.

Basic knowledge about algorithms is required.

For learning you can use the book

and the lecture slides that will be available in the L2P learning room.