inf407 - Program Verification (Complete module description)

# inf407 - Program Verification (Complete module description)

 Module label Program Verification Modulkürzel inf407 Credit points 6.0 KP Workload 180 h Institute directory Department of Computing Science Verwendbarkeit des Moduls Bachelor's Programme Computing Science (Bachelor) > Akzentsetzungsbereich - Wahlbereich Informatik Dual-Subject Bachelor's Programme Computing Science (Bachelor) > Wahlpflicht Theoretische Informatik (30 KP) Master of Education Programme (Gymnasium) Computing Science (Master of Education) > Wahlpflichtmodule (Theoretische Informatik) Zuständige Personen Wehrheim, Heike (module responsibility) Olderog, Ernst-Rüdiger (module responsibility) Lehrenden, Die im Modul (Prüfungsberechtigt) Prerequisites Skills to be acquired in this module Introduction to methods for proving the correctness of sequential and parallel programs. Professional competenceThe students:describe operational semantics of sequential and parallel  programs Know the concepts of partial and total correctness of programsestablish soundness and completeness of proof systemsconstruct input-output specifications of programsconduct correctness proofs for programs of different classes with the help of proof rulescheck interference and deadlock freedom of parallel programs construct correctness proof for weak memory modelsMethodological competenceThe students:recognize correctness as an important aspect of programs and informatics systemsrecognize formal calculi as means of specification and verificationSocial competenceThe students:work together in small groups to solve problemspresent their solutions to groups of other studentsSelf-competenceThe students:learn persistence in pursuing difficult taskslearn precision in specifying problems Module contents Program verification is a systematic approach to show the absence of errors in programs. For this purpose desirable behavioural properties of a given program are proven. For instance, a sorting program should only deliver sorted arrays. Partial correctness, termination, and the absence of runtime errors are essential for sequential programs. Additional behavioural properties are of interest for parallel programs: absence of interference, absence of deadlocks, and fair behaviour. The module focuses on the verification of parallel programs. For this purpose classic methods of Hoare's logic  and their extension to parallel programs, in particular also weak memory models, are studied. Sequential programs are covered in preparation for this. Literaturempfehlungen essential:"K.R. Apt, E.-R. Olderog, Programmverifikation, Springer-Verlag, 1994''Or the extended English version:"K.R. Apt, F.S. de Boer, E.-R. Olderog, Verfication of Sequential and Concurrent Programs, Third Edition, Springer-Verlag, 2008'' Links Language of instruction English Duration (semesters) 1 Semester Module frequency every second winter term Module capacity unlimited Teaching/Learning method V+Ü Previous knowledge Helpful prerequisites: set theory, relations, functions, propositional logic, predicate logic, programming in an imperative language
Form of instruction Comment SWS Frequency Workload of compulsory attendance
Lecture 3 siehe Angebotsrhythmus Modul 42
Exercises 1 siehe Angebotsrhythmus Modul 14
Präsenzzeit Modul insgesamt 56 h
Examination Prüfungszeiten Type of examination
Final exam of module

At the end of the lecture period

Written exam or oral exam