Research Group Computer Science 2

Dept. of Computer Science

Seminar: Satisfiability Checking (S2, WS 2011/12)

Instructors

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

Contents

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.

Times

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

• Oct 28: Contact your supervisor to obtain and discuss the literature
• Nov 21: Understand the content of your literature sources and discuss the conception of your paper with your supervisor
• Dec 20: Submit your complete seminar paper (10 pages incl. title and references)
• Jan 30: Submit your complete slides
• Feb 10: Bring sufficiently many copies of your corrected seminar paper to the seminar; you can make these copies at the research group

Requirements

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!).

Prerequisites

• Participants should have knowledge in satisfiability checking and/or program verification or related areas (for example from courses on "Satisfiability Checking", "Modeling and Analysis of Hybrid Systems", "Term Rewriting", "Functional Programming", "Logic Programming", or "Mechanized Program Verification")
• Interest in algorithmic aspects and practical applications of logical formalisms

Topics

Date	Time	Topic	Supervisor	Speaker
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.

References

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

Area

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