Bernd Finkbeiner

Prof. Bernd Finkbeiner, Ph.D. is a faculty member at the CISPA Helmholtz Center for Information Security and a professor of computer science at Technical University of Munich. He obtained his Ph.D. in 2003 from Stanford University. Since 2003, he leads the Reactive Systems Group, which became part of CISPA in 2020. His research focus is the development of reliable guarantees for the safety and security of computer systems, including specification, program synthesis and repair, and static and dynamic verification. Major projects include output-sensitive algorithms for reactive synthesis, logics and algorithms for hyperproperties, and the stream-based monitoring of cyber-physical systems.

The erc logo for projects funded under horizon europe
Project Hyper
ERC Advanced Grant 2022-2027
+49 681 87083 2059
CISPA, Saarbrücken
E9 1 / 1.08
Bernd Finkbeiner
Teaching
    Functional Programming and Verification
    Core Lecture · Summer 2026
    The course provides an introduction to functional programming and program verification. We use the programming language OCaml to study the fundamental concepts of functional programming. We cover notions like recursion, higher-order functions, polymorphic types, and constructors, as well as static and dynamic semantics and the verification of functional programs.
    Organized by: Bernd Finkbeiner, Iona Kuhn, Julian Erhard, N. Ege Saraç, Aleksy Feliks Idzikowski, Alexander Glas, Manuel Lerchner, Aziz Abderrahmane Ben Othmane, Cihan Demirci, Conrad Laurenz Fischer, Darina Grigoriu, Ferdinand Schenk, Ilya Kats, Leonie Houzer, Leopold Cario, Matei-Alexandru Florescu, Paul Schadauer, Tjorben Huber, Tobias Vale and Yi Rui Cui Visit Course
    Coinductive Proofs
    Advanced lecture · Summer 2025
    Proofs by induction appear everywhere in theoretical computer science; you certainly encountered them on many occasions, starting with the lecture Programming 1. Another essential proof method, less well-known but equally useful, is coinduction.
    Automata, Games and Verification
    Advanced lecture · Winter 2024/2025
    The theory of automata over infinite objects provides a succinct, expressive, and formal framework for reasoning about reactive systems, such as communication protocols and control systems. Reactive systems are characterized by their nonterminating behaviour and persistent interaction with their environment. In this course we will study the main ingredients of this elegant theory, and its application to automatic verification (model checking) and program synthesis.
Overview Papers
The cover of the iX Magazine.
Künstliche Intelligenz in der Softwareentwicklung: Über die Schulter geschaut.

iX Magazin für professionelle Informationstechnik 8/2021 (in German)

Contact Data Privacy Policy Imprint
Home People Publications
More