You are here: Home Teaching Summer Term 2018 Decision Procedures (Lecture)

Decision Procedures

Decision Procedures are the basis for program verification: The task of program verification is to give a formal proof that a program meets its specification. This amounts to determining the truth value of a logical formula. A decision procedure is an algorithm that can for a certain type of formulas decide whether the formula is true or false. We will investigate decision procedures for different logics. Starting with propositional logic we will investigate decision procedures for logics with integers, reals, recursive structures (lists and trees), arrays, etc.
Course type Lecture
Instructors Andreas Podelski, Jochen Hoenicke, Tanja Schindler
Lecture Tuesday, 16:00–18:00, Bld. 101, Room 00-010/014
Thursday, 16:00–17:00, Bld. 101, Room 00-010/014
Exercise Thursday, 17:00–18:00, Bld. 101, Room 00-010/014
First session Tuesday 17.04.2018
Language of instruction English
Credits 6
Exams t.b.a.
Course Catalog Decision Procedures - Lecture
Decision Procedures - Exercises



  • May 3: Sheet 3 is online. You can submit your solutions until Tuesday, May 15.
  • May 3: Our Ilias group can be found here.
  • Apr. 24: Due to the holiday next Tuesday, May 1, you can submit the second exercise sheet until Thursday, May 3.
    Our schedule for the next two weeks is also altered:
    Tuesday, May 1: holiday. Thursday, May 3: lecture 16:00 - 18:00.
    Tuesday, May 8: lecture 16:00 - 17:00, exercise 17:00 - 18:00. Thursday, May 10: holiday.
    This week, the lectures and exercise take place as announced in the box above.
  • Apr. 17: The course starts with lectures on Tuesday and Thursday, 16:00 - 18:00, this week.
    The first exercise sheet is online. 



Admission criteria

Half of the maximum points from the exercises have to be achieved in order to be admitted for the exam. There will be an exercise sheet each week, usually with three exercises and a maximum of 12 points. You can usually hand in your submission before the lecture on Tuesday -- alone or in groups of two.


The exam will be oral or written, depending on the number of participants.

 Please register via the examination office as usual.



Course Materials


  • Bradley A. R., Manna Z.: The Calculus of Computation: Decision Procedures with Applications to Verification, 2007, Springer, New York.
  • Kroening D., Strichmann O.: Decision Procedures - An Algorithmic Point of View, 2008, Springer.



  • B. Dutertre, L. de Moura: Integrating Simplex with DPLL(T), Technical Report, SRI_CSL-06-01, 2006.
  • B. Dutertre, L. de Moura: A fast linear-arithmetic solver for DPLL(T), CAV 2006.


Tools and Standards

  • SMTInterpol  (Interpolating SMT-Solver developed by us --- the chair of software engineering)
  • CVC4 (SMT-Solver developed by New York University and the University of Iowa)
  • Yices (SMT-Solver developed by Stanford Research Institute)
  • Z3 (SMT-Solver developed by Microsoft Research)
  • SMTLIB (A standard for encoding SMT-problems which is read by many solvers)
  • PiVC (Tool for program verification by Stanford University)


Old Decision Procedures Lectures