|Research Group Computer Science 2||Dept. of Computer Science|
Prof. Dr. Erika Ábrahám, Prof. Dr. Jürgen Giesl, Ahmed Abiba, László Antal, Daniel Cloerkes, Stefan Dollase, Rebecca Haehn, Jera Hensel, David Keller, Nils Lommen, Fabian Meyer, Jasper Nalbach, Sasan Vakili
The focus of this seminar is automatic satisfiability checking of formulas. Here we consider several logics, e.g., pure propositional logic, but also extensions like quantified boolean formulas or SAT modulo theories. We will discuss both techniques for efficient satisfiability checking and practical applications in program verification.
The seminar will take place as a block seminar in Summer 2022.
Theoretical Computer Science
For further details please contact Fabian Meyer.
|Disclaimer||Research Group Computer Science 2||Dept. of Computer Science|