Decision Procedures for Verification

  • Viorica Sofronie-Stokkermans <>
  • For questions: e-mail to

  • You can also ask question on the newsgroup infko.logik
    (Please add the keyword "Decision Procedures" in your subject line.)

  • Time and place:
  • Lecture: Tue, 14:00s.t.-16:00, Room K 107 (new)
  • Exercise: Thu, 12:00s.t.-14:00, Room E 427

  • Slides
  • Exercise Sheets

  • News

  • Tuesday, January 13, 2015: lecture
  • Thursday, January 8, 2015: lecture (not exercise)
  • The first exercise will take place on Thursday, 6.11.2014
  • No exercise on Thursday, 30.10.2014

  • Exam

  • 1. Termin: Thu, 12.03.2015, 13:00-15:00, Room B 016 (written exam, 120 min)

    You are allowed to use an A4 sheet with notes you made about the lecture (written on both sides, written by you, and marked with your name)

  • Question/Answer Session: 10.03.2015, 14:15, Room B225
  • List of topics: [summary.pdf]
  • 2. Termin: TBA

  • Contents

    The goal of this lecture is to present the recent results in automated reasoning, especially decision procedures, and their applications in verification.


    One of the most important research objectives in mathematics and computer science is to obtain means of reasoning in and about complex systems. Proving properties of such systems is extremely important. In safety-critical systems even small mistakes can provoke disasters. Since the amount of data which has to be handled in all the application domains mentioned above is usually huge, computer support is necessary. General-purpose programs for solving all types of problems mentioned above do not exist. However, for concrete application domains automatic procedures exist. The goal of this lecture is to present specific domains in computer science (with an emphasis on verification) for which efficient methods for automated reasoning exist.