Mattias Ulbrich

Dr. rer. nat. Mattias Ulbrich

Room: 229
Phone: +49 721 608-44338
Fax: +49 721 608-44021
Am Fasanengarten 5
Gebäude 50.34
76131 Karlsruhe


My research focuses on formal deductive software verification on the level of program code. I am particularly intersted in relational verification, i.e., cases where more than one program is considered for the verification:

  • Regression verification, equivalence checking
  • Algorithm Refinement
  • Verification of relational properties of algorithms
  • Information Flow Security (to a lesser extend)

I am also interested in

  • Intermediate Verification Languages and Interaction
  • Dynamic Logic


JML Standard



  • rêve - Automatically check two programs for equivalence
  • rêve for noninterference - Automatically prove noninterference of a C routine
  • SemSlice - Automatically semantic analysis for precise programs slicing
  • Tableau Applet - A Java Applet for a first tableau calculus (w/ some automation), mainly for teaching purposes
  • KeY - Integrated Deductive Software Design
  • ivil - Interactive Verification on Intermediate Language

Recent Publications

Title Author(s) Source
VerifyThis 2017: A Program Verification CompetitionMarieke Huisman
Rosemary Monahan
Wojciech Mostowski
Peter Müller
Mattias Ulbrich
Karlsruhe Institute of Technology 2017,10
An Interaction Concept for Program Verification Systems with Explicit Proof ObjectBernhard Beckert
Sarah Grebing
Mattias Ulbrich
Hardware and Software: Verification and Testing - 13th Haifa Verification Conference (HVC 2017)
Relational Program Reasoning Using Compiler IR – Combining Static Verification and Dynamic AnalysisMoritz Kiefer
Vladimir Klebanov
Mattias Ulbrich
Journal of Automated Reasoning
Automating Regression Verification of Pointer Programs by Predicate AbstractionVladimir Klebanov
Philipp Rümmer
Mattias Ulbrich
Journal on Formal Methods in System Design
Proving JDK's Dual Pivot Quicksort CorrectBernhard Beckert
Jonas Schiffl
Peter H. Schmitt
Mattias Ulbrich
9th Working Conference on Verified Software: Theories, Tools, and Experiments (VSTTE 2017)
SemSlice: Exploiting Relational Verification for Automatic Program SlicingBernhard Beckert
Thorsten Bormer
Stephan Gocht
Mihai Herda
Daniel Lentzsch
Mattias Ulbrich
13th International Conference on integrated Formal Methods (iFM 2017)
Generalised Test Tables: A Practical Specification Language for Reactive SystemsBernhard Beckert
Suhyun Cha
Mattias Ulbrich
Birgit Vogel‑Heuser
Alexander Weigl
13th International Conference on integrated Formal Methods (iFM 2017)
Generation of Monitoring Functions in Production Automation Using Test SpecificationsSuhyun Cha
Sebastian Ulewicz
Birgit Vogel‑Heuser
Alexander Weigl
Mattias Ulbrich
Bernhard Beckert
15th IEEE International Conference on Industrial Informatics (INDIN 2017)

Click here for a full list of my publications.


Supervised Theses

Title Year Type
Relational Equivalence Proofs Between Imperative and MapReduce Algorithms 2017 PdF
Relational Verification of Floating-point Programs 2017 PdF
Exploiting Runtime Data to Derive Formal Environment Models for the Verification of PLC Software 2017 B. Sc.
Specifying and Verifying Real-World Java Code with KeY - Case Study java.math.BigInteger 2017 B. Sc.
Semantic Slicing 2016 PdF
Dynamic Analysis for Automatic Relational Verification 2016 B.Sc.
Dual Pivot Quicksort: Specification and Verification using KeY 2016 B.Sc.
Theory of Refinement of Cyber-Physical Systems into Implementations 2015 B.Sc.
Generating Bounded Counterexamples for KeY Proof Obligations 2014 M.Sc.
Automating Regression Verification 2014 PdF
Proving Well-Definedness of JML Specifications with KeY 2013 StA
Design and Implementation of a Verification Framework for Java Bytecode using Unstructured Dynamic Logic 2012 DA
Introducing the Boogie methodology to USDL 2011 StA
Verifying Alloy Models Using KeY 2011 DA
FunktionsabschlĂĽsse in Dynamischer Logik 2010 StA
Formal Semantics for the Java Modeling Language 2009 DA
Click here to show all supervised theses
M/B.Sc.=Master/Bachelor, PdF=Praxis der Forschung, StA=Studienarbeit, DA=Diplomarbeit



Title Type
Übung zur Vorlesung
Übung zur Vorlesung
Übung zur Vorlesung
Übung zur Vorlesung
Übung zur Vorlesung
Übung zur Vorlesung
Übung zur Vorlesung
Click here to show all teaching activities