Decision Procedures for Verification

  • Viorica Sofronie-Stokkermans <>
  • Registration and/or questions: e-mail to

  • Slides
  • Exercises

  • Exam

  • Exam: 21.02.2012, 12:00-14:00 (oral examination)
  • Question and answer session: 17.02.2012, 13:00-15:00, Room B 225.
  • List of topics: [summary.pdf]
  • Collection of suplementary exercises: [additional-exercises.pdf]

  • Contents

    The goal of this lecture is to present the recent results in automated reasoning, especially decision procedures, and their applications in verification (e.g. in program 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 verification for which efficient methods for automated reasoning exist.

    Recommended literature

    Course material from other lectures

    Propositional logic, first-order logic

    Decision procedures