|Website:||website containing additional information|
|Period:||period 2 (week 46 through 5, i.e., 14-11-2016 through 3-2-2017; retake week 16)
|Participants:||up till now 7 subscriptions|
|Schedule:||Official schedule representation can be found in Osiris|
|Teachers:||Dit is een oud rooster!
|week: 41||Wed 11-10-2017||8.30-10.30 uur||room: BBG-001|
|week: 45||Wed 8-11-2017||9.00-12.00 uur||room: BBG-001|
|week: 1||Tue 2-1-2018||17.00-20.00 uur||room: UNNIK-220||retake exam|
|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.
We will discuss several common ways to define the semantic of programs, from which correctness can be defined and proven. We will discuss the predicate transformation technique, which you can use to symbolically execute a program to calculate its range of input or output. We will discuss several model checking techniques, that can be used to fully verify the model of a program, even if the number of possible executions is infinite. We will also discuss higher order theorem proving. Verification in this setting is usually not fully automatic, but it is very expressive, and thus provides at least an alternative when a verification problem cannot be suitably mapped to one of the above solutions.
to become familiar with, and acquire insight on the underlying concepts of:
Additionally, to acquire hands-on experience with :
- program semantics: operational, denotational, axiomatic.
- formalisms to express programs' correctness: Hoare-style, LTL, CTL, higher order logic, CSP.
- automated verification techniques: predicate transformer, model checking (LTL,, CTL, symbolic), tactic-based theorem proving, refinement checking.
- using a verification tool to model a problem and conduct a verification of its solution.
- implementing a verification technique.
- embedding a simple programming language in a higher order theorem prover, and to use it to prove the correctness of some example programs.
|Literature:||Lecture notes, on-line documentation, and papers.|
|Exam form:||In principle 40% projects, 60% 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:||As in the Education and Examinations Regulation (EER/OER). Additionally participation in the projects and assignments are mandatory.|