Christoph Matheja

41_quadr
Email
matheja at cs.rwth-aachen.de
Address
Room 4206
Ahornstraße 55
D-52074 Aachen
Phone
+49 241 80 21210

I am now working as a postdoc in the Programming Methodology Group at ETH Zürich. My new website is found here or, more generally, at cmath.eu.

Before moving to Zürich, I finished my PhD at the Software Modeling and Verification Group (MOVES) headed by Professor J.-P. Katoen in January 2020.

Thesis

My PhD thesis titled “Automated Reasoning and Randomization in Separation Logic” features

  1. a thorough introduction to weakest precondition reasoning about recursive and heap manipulating programs with separation logic,
  2. a novel quantitative separation logic for reasoning about expected values of probabilistic pointer programs, and
  3. automated reasoning with separation logic about temporal properties of pointer programs as well as decision procedures for reasoning about separation logic itself.

Research

My research interests include

  • formal verification of heap-manipulating and probabilistic programs,
  • graph grammars and graph transformations, and
  • static program analysis.

Tools

  • Attestor: A tool for model-checking Java pointer programs
  • HARRSH: A robustness checker for symbolic heap separation logic with inductive definitions based on heap automata 

Supervision

Together with Benjamin Kaminski, I supervised our student research assistant Kevin Batz.  Moreover, together with Christina Jansen, I supervised our student research assistant Hannah Arndt.

I am currently supervising the following thesis projects:

  • Sally Chau, TBA, Master’s thesis.
  • Justus Fesefeldt, TBA, Master’s thesis.
  • Philipp Schroer, Understanding Abstraction of Probabilistic Programs, Bachelor’s thesis.
  • Johannes Schulze, TBA, Master’s thesis.

I have been supervising the following thesis projects and internships:

  • Hannah Arndt, Randomized Meldable Heaps: A more formal proof of a less simple probabilistic data structure, Master’s thesis, 2019.
  • Kevin Batz, TBA, Master’s thesis (together with Benjamin Kaminski and Sebastian Junges), 2019.
  • Fabian Schneider, A Unified Algebraic Domain for Shape Analysis, Master’s thesis, 2018.
  • Felix Bier, From Graph Grammars to Forest Automata and Back, Master’s thesis, 2018.
  • Joshua Peignier (ENS Rennes), Possibility Distribution Semantics for Probabilistic Programs with Nondeterminism, internship, 2017 (together with Benjamin Kaminski).
  • Daniel Cloerkes, A Cyclic Proof System for Graph Grammar Inclusion, Bachelor’s thesis, 2017.
  • Kevin Batz, Proof Rules for Expected Run-Times of Probabilistic Programs, Bachelor’s thesis, 2017 (together with Benjamin Kaminski).
  • Isabelle Tülleners, Graph-based Heap Abstraction for Balanced Data Structures, Bachelor’s thesis 2016.
  • Hanna Franzen, Graph-based Symbolic Execution for Pointer Programs with Data, Bachelor thesis 2016.
  • Hannah Arndt, Heap Abstraction Beyond Context-Freeness, Bachelor thesis, 2016.
  • Victor Lanvin (ENS Cachan), Comparing Automated Tools for Analysing Pointer Programs, internship. 2016 (together with Christina Jansen).

Awards

Our paper How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times (joint work with Kevin Batz, Benjamin Kaminski, and Joost-Pieter Katoen) was nominated for the EATCS Best Paper Award at ETAPS 2018.

Our paper Rule-based Conditioning of Probabilistic Data Integration (joint work with Maurice van Keulen, Benjamin Lucien Kaminski, and Joost-Pieter Katoen) won the best paper award at SUM 2018.

Our paper Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs (joint work with Benjamin Kaminski, Joost-Pieter Katoen, and Federico Olmedo) won the EATCS Best Paper Award for the best theory paper presented at ETAPS 2016

I was awarded the Springorum Medal in 2015 for receiving a master’s degree with distinction.

Teaching

I’m currently involved in the following teaching activities:

Past teaching activities:

2020
fulltext PDF [bibtex]
@conference{VPP2020,
title = {Verifying Probabilistic Programs},
author = {Benjamin Lucien Kaminski and Joost-Pieter Katoen and Christoph Matheja},
publisher = {Springer},
booktitle = {LNCS},
volume = {12289},
pages = {298-298},
type = {Conference Paper},
year = {2020},
url = { https://publications.rwth-aachen.de/record/834060},
}×
[issue]
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. Verifying Probabilistic Programs, International Conference on Quantitative Evaluation of System (QEST 2020), Volume 12289 of LNCS, 298-298, Springer, 2020.
DOI fulltext PDF [bibtex]
@conference{PPDRM2020,
title = {PrIC3: Property Directed Reachability for MDPs},
author = {Kevin Batz and Sebastian Junges and Benjamin Lucien Kaminski and Joost-Pieter Katoen and Christoph Matheja and Philipp Schröer},
publisher = {Springer},
booktitle = {LNCS},
volume = {12225},
pages = {512-538},
type = {Conference Paper},
year = {2020},
doi = {10.1007/978-3-030-53291-8_27},
url = { https://publications.rwth-aachen.de/record/816242},
}×
[issue]
Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer. PrIC3: Property Directed Reachability for MDPs, 32nd International Conference on Computer Aided Verification (CAV 2020), Volume 12225 of LNCS, 512-538, Springer, 2020.
arXiv:2010.14548 [bibtex]
@unpublished{RCVPP2020,
title = {Relatively Complete Verification of Probabilistic Programs},
author = {Kevin Batz and Benjamin Lucien Kaminski and Joost-Pieter Katoen and Christoph Matheja},
pages = {49 Seiten},
type = {Preprint},
year = {2020},
url = { https://arxiv.org/abs/2010.14548},
}×
[issue]
Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. Relatively Complete Verification of Probabilistic Programs, 49 Seiten, 2020. https://arxiv.org/abs/2010.14548
arXiv:2004.14835 [bibtex]
@unpublished{PPDRM2020,
title = {PrIC3: Property Directed Reachability for MDPs},
author = {Kevin Batz and Sebastian Junges and Benjamin Lucien Kaminski and Joost-Pieter Katoen and Christoph Matheja and Philipp Schröer},
type = {Preprint},
year = {2020},
url = { https://arxiv.org/abs/2004.14835},
}×
[issue]
Kevin Batz, Sebastian Junges, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer. PrIC3: Property Directed Reachability for MDPs, 2020. https://arxiv.org/abs/2004.14835
DOI fulltext PDF [bibtex]
@phdthesis{A2020,
title = {Automated reasoning and randomization in separation logic},
author = {Christoph Matheja},
institution = {RWTH Aachen University},
pages = {1 Online-Ressource (x, 504 Seiten) : Illustrationen, Diagramme},
type = {PhD Thesis},
year = {2020},
doi = {10.18154/RWTH-2020-00940},
url = { https://publications.rwth-aachen.de/record/780877},
}×
[issue]
Christoph Matheja. Automated reasoning and randomization in separation logic, PhD Thesis, RWTH Aachen University, 1 Online-Ressource (x, 504 Seiten) : Illustrationen, Diagramme, 2020.
2019
DOI fulltext PDF [bibtex]
@article{Q2019,
title = {Quantitative separation logic: a logic for reasoning about probabilistic pointer programs},
author = {Kevin Batz and Benjamin Lucien Kaminski and Joost-Pieter Katoen and Christoph Matheja and Thomas Noll},
publisher = {ACM},
journal = {Proceedings of the ACM on programming languages},
volume = {3(POPL)},
pages = {pages 34},
type = {Journal Article},
year = {2019},
doi = {10.1145/3290347},
url = { https://publications.rwth-aachen.de/record/753722},
}×
[issue]
Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll. Quantitative separation logic: a logic for reasoning about probabilistic pointer programs, Proceedings of the ACM on programming languages 3 (POPL), pages 34, ACM, 2019.
DOI [bibtex]
@article{O2019,
title = {On the hardness of analyzing probabilistic programs},
author = {Benjamin Lucien Kaminski and Joost-Pieter Katoen and Christoph Matheja},
publisher = {Springer},
journal = {Acta informatica},
volume = {56(3)},
pages = {pages 255–285},
type = {Journal Article},
year = {2019},
doi = {10.1007/s00236-018-0321-1},
url = { https://publications.rwth-aachen.de/record/753077},
}×
[issue]
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. On the hardness of analyzing probabilistic programs, Acta informatica 56 (3), pages 255–285, Springer, 2019.
Show all