Improving the ability to think and argue in an abstract, formal and logically consistent way; training in specific formal methods of computer science.

Introduction to complexity theory: problem reductions, P versus NP, undecidability; SAT solving and its applications in computer science; introduction to the formal semantics of programming languages; formal verification of programs; model checking and its applications in hard- and software verification.

FIRST LECTURE: 3 October 2017, 12:15, EI10

Ects breakdown

  2 h introduction (first meeting)
 60 h lecture (20 dates à 2h + 1h preparation)
 40 h exercise sheets (4 sheets, 10 exercises/sheet, 1h/exercise)
 16 h discussion of exercises (8 dates à 2h)
 30 h preparation for written exam
  2 h written exam
-----------------------------------------------------------
150 h = 6 Ects

The assessment is based on the final written exam (max. 60 points). The grade is determined according to the following table:

• 0-29 points: failed (nicht genügend, 5)
• 30-35 points: passed (genügend, 4)
• 36-41 Punkte: satisfactory (befriedigend, 3)
• 42-47 Punkte: good (gut, 2)
• 48-60 Punkte: excellent (sehr gut, 1)

For slides and other material see the TUWEL course.