The L2P-room is not yet available. Please have some patience, ITC/L2P are working on it.
|Lecture+exercise times:||Monday 14:15 – 15:45, AH I
Wednesday 10:15 – 11:45, AH II
|First lecture:||October 09, 2017|
|Language:||English or German (depending on the students’ preferences)|
|Prerequisites:||For Bachelor or Master (“Wahlpflicht” in Theoretical Computer Science)
Basic knowledge about algorithms is required.
|First exam:||21.02.2018, 16:00 – 18:00, Aula 2, AH VI|
|Revision:||02.03.2018, 10:00 – 11:30, AH I|
|Second exam:||21.03.2018, 14:00 – 16:00, Aula 2|
|Revision:||27.03.2018, 10:00 – 11:30, AH I|
News and materials can be found in the corresponding L2P learning room. For additional information see also the Campus page.
Different approaches in computer science involve tools (solvers) to check whether certain formulas are satisfiable. Examples can be found in the fields of hardware and software verification, counterexample generation, termination analysis of programs, and optimization algorithms, just to mention a few.
In this lecture we deal with the automatic check of satisfiability of formulas from 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”). During the semester we will discuss extensions of propositional logic with equalities, uninterpreted functions, and linear and non-linear constraints involving real- and integer-valued variables (linear/non-linear real/integer arithmetic). To demonstrate practical relevance, we employ the above methods in the context of bounded model checking.
For learning you can use the book
Daniel Kroening and Ofer Strichman: Decision Procedures: An Algorithmic Point of View, Springer-Verlag, Berlin, 2008.
which is available in the computer science library, the lecture slides and the lecture notes that will be made available in the L2P learning room.
The slides from previous semesters are available here.