Diese Seite auf Deutsch  Research Group Computer Science 2  Dept. of Computer Science RWTH

Satisfiability Checking

(S2, WS 2011/12)

LuFG Informatik II


Prof. Dr. Erika Ábrahám, Prof. Dr. Jürgen Giesl, Marc Brockschmidt, Florian Corzilius, Fabian Emmes, Carsten Fuhs, Nils Jansen, Ulrich Loup, Johanna Nellen, Carsten Otto, Thomas Ströder


The focus of this seminar is automatic satisfiability checking of formulae. Here we consider several logics, e.g., pure propositional logic, but also extensions like quantified boolean formulae or SAT modulo theories. We will discuss both techniques for efficient satisfiability checking and practical applications in program verification.


The seminar will take place at the end of the lecture period in February 2012. We have the following deadlines:


Your seminar paper should have 10 pages and be written in either English or German. With this number of pages, there should not be any index or table of contents. Nevertheless, you should give a list of your references. If there are more than ten grammatical or spelling mistakes on a single page, the review of your paper will be aborted, and it will be returned to you immediately (please use an automated spell checker!).



Feb 10 10:30 Minimally Unsatisfiable Boolean Circuits U. Loup Andrej Dyck
Feb 10 11:15 Towards Incremental SAT J. Nellen Jens Hiller
Feb 10 12:00 Criss-Cross Methods F. Corzilius Hamza Abusalah
Feb 10 13:30 Integrating Simplex in an SMT-Solver N. Jansen Amith Belur Nagabushana
Feb 10 14:15 Termination Analysis using SAT C. Otto Matthias Volk
Feb 10 15:00 Program Synthesis using SAT T. Ströder Jean Louis Tekam

The talks should not take more than 25 minutes and can be held in either English or German. The schedule for the talks is tentative.

The slides of Prof. Ábrahám's presentation at the introductory meeting are available here.


The books and papers to be discussed in the seminar will be announced at the preliminary meeting.


Theoretical Computer Science, Area of Specialization

Further Details and Questions

For further details please contact Thomas Ströder.

Disclaimer  Research Group Computer Science 2  Dept. of Computer Science RWTH