E-mail senden E-Mail Adresse kopieren

Robert Künnemann



Kaiserstraße 21
66386 St. Ingbert (Germany)

Weitere Informationen


Robert Künnemann promovierte an der École normale supérieure de Cachan unter der Leitung von Steve Kremer und Graham Steel. Er arbeitete in den Teams SECSI und PROSECCO am INRIA (Paris, Frankreich), absolvierte ein Praktikum an der Cambridge University (UK) und war an der Technischen Universität Darmstadt und der Universität des Saarlandes (Deutschland) tätig. Seit 2019 ist er Leiter einer Forschungsgruppe am CISPA. Seine Spezialgebiete sind Protokollverifizierung, Verlässlichkeit und Infrastrukturanalyse.

Veröffentlichungen von Robert Künnemann

Jahr 2023

Konferenz / Medium

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS)ACM SIGSAC Conference on Computer and Communications Security (CCS)

Konferenz / Medium

32st USENIX Security Symposium (USENIX Security 23)32st USENIX Security Symposium (USENIX Security 23)

Konferenz / Medium

Web SecurityNDSS Symposium 2023

Jahr 2022

Konferenz / Medium

USENIX Security Symposium (USENIX Security), 2022.USENIX Security Symposium (USENIX Security), 2022.

Jahr 2021

Konferenz / Medium

2021 IEEE 34th Computer Security Foundations Symposium (CSF)34th IEEE Computer Security Foundations Symposium

Konferenz / Medium

2021 IEEE 34th Computer Security Foundations Symposium (CSF)2021 IEEE 34th Computer Security Foundations Symposium (CSF)

Konferenz / Medium

35th AAAI Conference on Artificial Intelligence35th AAAI Conference on Artificial Intelligence

Jahr 2020

Lehre von Robert Künnemann

Winter 2021/22

Formal Methods in Security

Despite decades of research in computer security, security vulnerabilities still plague computer systems with an ever-growing number of new vulnerabilities discovered every day. How can we ensure that computer systems are really secure? Formal methods offer a promising approach towards this goal: they can guarantee the absence of specific security vulnerabilities with mathematical certainty and therefore help us develop mode reliable systems.

In this course, we will study how formal methods can be applied to verify that the design and implementation of computer systems respect their intended security policies. The course is structured in three independent parts, which focus on specific techniques for different domains: language-based information-flow control, security protocols, and system-level verification. As a whole, the course will give you hands-on experience in reasoning about security at different layers of abstraction through established principled techniques and a broad introduction to state-of-the-art research in the area.

Topics and Instructors

  1. Introductory Lecture (20 October 2021)  
    We'll give an overview of the three parts. Marco will give it live (find the zoom link in the calendar entry, calendar link is below -- not in the CMS timetable). Hamed and Robert prepared videos for the occasion given their travel obligations:
     - Hamed's Video: https://dl.cispa.de/s/8Z5kbp8yifL7tsg
     - Robert's Video: https://dl.cispa.de/s/LJFsXzfr8xWoT7Y
    - Class Recording: https://dl.cispa.de/s/ZMT3oCqPTyxgHcd

  2. Language-based Information-Flow Control (Marco Patrignani

    In the first part of the course, we will study information-flow control techniques that track how data flows in a program to enforce data confidentiality and integrity. We will discuss both static and dynamic IFC techniques based on security type systems and taint tracking, as well as techniques that track data flows in a program at a different granularity (for example per program variable or per program block). Finally, we will see how programming languages principles can be applied to formally verify that these techniques enforce security. Basic knowledge of programming languages theory is preferred, but not required.

  3. Proof techniques for system verification (Hamed Nemati)

    The main goal of the second part of this course is to show you how we should approach verification of large scale  systems like  micro-kernels and hypervisors. This is a very challenging task in practice. We will study abstraction, decomposition and refinement as techniques that usually used in practice to facilitate verification of such systems. Finally, in our last lecture we see how we can combine fuzzing and formal verification to validate systems that their verification is not feasible in practice.  


  4. Protocol Verification (Robert Künnemann)
    Protocol verification assumes that the cryptography is perfect and tries to ensure that they are used correctly. It is not about defending against super smart mathematicians exploiting biases in key streams, but equally smart hackers confusing one party about the state of another party.

    We will discuss how to get from the Alice-bob notation to a minimalistic, precise specification of the protocol and its setup

    how to formulate our security requirements and how to verify that these requirements hold, using tools that have by now reached an impressive degree of automation.


Registration: open now! (Once you are registered here, don't forget to register in the LSF.)

When: Wed 10h-12h (official starting time is 10:15)

Where: (all links also appear in the calendar events)

Calendar & Lecture planlink (Click "..." next to calendar for subscription link for your favorite application) (work in progress)


  1. IFC (Marco): Zoom+Miro lectures on Wednesday 10-12, Q&A session on Friday 10-12 based on the askbot content (see IFC page)
  2. SYSV (Hamed): flipped classroom: recorded lectures on Monday, Q&A session on Wednesday.
  3. PROTO (ROBERT): live lectures on Wednesday 10-12, Q&A session on Friday 10-12, detailed lecture script.

Exam requirements: three exercise sheets per part, 50% of total points, work in groups allowed

Exam: two oral exams (first and second part), and one project (third part). Passing requirement is >4.0 on two of the three.

Official exam date : tbd.

Course Goals

  • Understand the challenges of some open problems in computer security

  • Learn state-of-the-art techniques to address these problems and how to apply them (as a programmer, protocol designer, web developer etc.)

  • By-product: a taxonomy of where things can go wrong in security on different layers

Learning Objectives

After the course, students will be able to:

  • Apply Information-Flow Control (IFC) techniques to the design of secure programming languages.

  • Analyze the security guarantees of IFC languages through programming languages principles.

  • Discuss problems, solutions, and open challenges presented in IFC research papers.

  • Understand fundamental concepts in verification. 

  • Learn how to use formal techniques to find vulnerabilities in low-level systems.

  • Gain knowledge to be able to read and understand papers in system verification.

  • Model protocols and cryptographic assumptions in the applied-pi calculus.

  • Express authentication and secrecy properties via correspondence and reachability.

  • Exploit automated tools to verify protocols.

Target Audience

Mainly M.Sc students and interested graduate students. Interested and motivated B.Sc students should contact us and argue that (a) they are particularly interested and (b) they have the necessary background in logical reasoning to follow the course.