Secure and Dependable Systems


  • Course: Secure and Dependable Systems (CO21-320203)

  • Semester: Spring 2020

  • Instructor: Jürgen Schönwälder

  • TA:

  • TA:

  • Class: Thursday, 14:15-15:30, R.1-53 Lecture Hall

  • Class: Friday, 11:15-12:30, RLH-274 Seminar Room

  • Office Hours: Monday, 11:15-12:30 (Research I, Room 87)

  • 1st Module Exam: TBD

  • 2nd Module Exam: TBD

  • Start: 2020-02-06


This course introduces formal methods for analyzing and assuring safety and security of software systems. The course starts off with a clarification of concepts such as dependability, quality, safety, and security of software systems, and how to achieve them in the software development process. We introduce the foundations of cryptography as a basis for security mechanisms. The main part of the course introduces different paradigms of safety/security analysis such as formal testing (code coverage), static program analysis (control/data flow analysis and abstract interpretation), model checking (computational tree logic), and program verification (Hoare calculus, dynamic logic). The formal techniques will be used for analyzing both safety and security properties of programs. Where possible, students will be given hands-on micro-projects in state-of-the-art tools (e.g., Isabelle for program verification).



  • Bruce Schneier: Applied Cryptography, 20th Anniversary Edition, Wiley, 2015

  • Wm.A. Conklin, Gregory White: Principles of Computer Security, 5th Edition, McGraw-Hill, 2018

  • Simon Singh: The Code Book: Science of Secrecy from Ancient Egypt to Quantum Cryptography, Anchor Books, 2000


Schedule (TBD)

Th 14:15 Fr 11:15 Topics
2020-02-06 2020-02-07 Dependability Concepts and Classic Computing Disasters
2020-02-13 2020-02-14 Software Engineering and Testing
2020-02-20 2020-02-21 Software Specification and Verification
2020-02-27 2020-03-28 Automated Generation of Proof Goals and Termination Proofs
2020-03-05 2020-03-06 Time, Events, and Causality in Distributed Systems
2020-03-12 2020-03-13 Broadcast Algorithms, Communicating Sequential Processes
2020-03-19 2020-03-20 Communicating Sequential Processes
2020-03-26 2020-03-27 pi Calculus
2017-04-02 2020-04-03 Cryptography, Symmetric Encryption Algorithms and Block Ciphers
2020-04-09 2020-04-10 [Spring Break]
2020-04-16 2020-04-17 Asymmetric Encryption Algorithms, Cryptographic Hash Functions
2020-04-23 2020-04-24 Certificates, Key Exchange Schemes, Pretty Good Privacy
2020-04-30 2020-05-01 Transport Layer Security, Secure Shell
2020-04-07 2020-05-08 Steganography, Covert Channels
2020-05-14 2020-05-15 Anonymity, Trusted Computing


Date/Due Name Topics


The final grade is determined by a final exam (100%). There will be graded homework assignments but the homework assignments do not impact the final grade.

Electronic submission is the preferred way to hand in homework solutions. Please submit documents (plain ASCII/UTF-8 text or PDF, no Word) and your source code (packed into a tar or zip archive after removing all binaries and temporary files) via the online submission system. If you have problems, please contact one of the TAs.

For any questions stated on assignment sheets, quiz sheets, exam sheets or during makeups, we by default expect a reasoning for the answer given, unless explicitely stated otherwise.

Any programs, which have to be written, will be evaluated based on the following criteria:

  • correctness including proper handling of error conditions

  • proper use of programming language constructs

  • clarity of the program organization and design

  • readability of the source code and any output produced

Source code must be accompanied by a README file providing an overview of the source files and giving instructions how to build the programs. A suitable Makefile is required if the build process involves more than a single source file.