You have come to an old website. Our new URL is ths.rwth-aachen.de. Please update your bookmarks!




Satisfiability Checking


Schedule WS 10/11

Type

Day

Time

Place

Start

Lecturer

V2

Mo

13:00-14:30

6019

October 18

V1+Ü1

Tue

13:15-14:45

AH IV

October 19

 

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


Motivation

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.


Prerequisites

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.


Materials

For learning you can use the book

 

               

Decision Procedures: An Algorithmic Point of View

 

by Daniel Kroening and Ofer Strichman

 

Springer Berlin, 2008

 

 

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