|Website:||website containing additional information|
|Period:||period 1 (week 36 through 45, i.e., 3-9-2020 through 6-11-2020; retake week 1)|
|Participants:||up till now 27 subscriptions|
|Schedule:||Official schedule representation can be found in MyTimetable|
|Note:||No up-to-date course description available.|
Text below is from year 2019/2020
|Contents:||Most modern software is quite complex. The most widely used approach to verify them is still by testing, which is inherently incomplete and hard to scale up to cover the complexity. In this course we will discuss a number of advanced validation and verification techniques that go far beyond ad-hoc testing. Exploiting them is an important key towards more reliable complex software. We will in particular focus on techniques that can be automated, or at least partially automated:
Learning goals: to become familiar with, and acquire insight on the underlying concepts of:
Prerequisites: background in predicate logic, experience with a functional programming language, e.g. Haskell or ML.
Lecture notes, on-line documentation, and papers.
|Exam form:||In principle 20% assignments, 25% projects, 55% exams. This can be changed depending on the composition of the projects, but in any case the exam form and grading will be announced and fixed at the start of the course.|
|Minimum effort to qualify for 2nd chance exam:||To qualify for the retake exam, the grade of the original must be at least 4.|