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
DOI fulltext PDF [bibtex] [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] [issue] Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen, Kevin Batz, Thomas Noll. Quantitative separation logic, Proceedings of the ACM on programming languages 3 (POPL), pages 34, ACM, 2019.
DOI [bibtex] [issue] Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen. On the hardness of analyzing probabilistic programs, Acta informatica 56 (3), pages 255–285, Springer, 2019.
2018
arXiv:1802.10467 [bibtex] [issue] Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen, Kevin Batz, Thomas Noll. Quantitative Separation Logic, 159 Seiten, 2018. https://arxiv.org/abs/1802.10467
DOI [bibtex] [issue] Christoph Matheja, Florian Zuleger, Jens Katelaan, Thomas Noll. Harrsh, 13th International Workshop on the Implementation of Logics (IWIL 2018), Kalpa Publications in Computing, 23-36, 2018.
DOI [bibtex] [issue] Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen, Maurice van Keulen. Rule-Based Conditioning of Probabilistic Data, 12th International Conference on Scalable Uncertainty Management (SUM 2018), Volume 11142 of Lecture Notes in Artificial Intelligence, 290-305, Springer, 2018.
DOI [bibtex] [issue] Benjamin Lucien Kaminski, Christoph Matheja, Federico Olmedo, Joost-Pieter Katoen. Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms, Journal of the ACM 65 (5), pages 30:1-30:68, 2018.
DOI [bibtex] [issue] Christina Jansen, Christoph Matheja, Hannah Arndt, Joost-Pieter Katoen, Thomas Noll. Let this Graph Be Your Witness!, 30th International Conference on Computer Aided Verification (CAV 2018), Volume 10982 of LNCS, 3-11, Springer, 2018.
DOI [bibtex] [issue] Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen, Kevin Batz. How long, O Bayesian network, will I sample thee?, 27th European Symposium on Programming (ESOP 2018), LNCS, 186-213, Springer, 2018.
DOI [bibtex] [issue] Christina Jansen, Christoph Matheja, Hannah Arndt, Thomas Noll. Graph-Based Shape Analysis Beyond Context-Freeness, International Conference on Software Engineering and Formal Methods (SEFM 2018), Volume 10886 of LNCS, 271-286, Springer, 2018.
2017
arXiv:1705.03754 [bibtex] [issue] Christina Jansen, Christoph Matheja, Hannah Arndt, Thomas Noll. Heap Abstraction Beyond Context-Freeness, 44 Seiten, 2017. https://arxiv.org/abs/1705.03754
DOI [bibtex] [issue] Christina Jansen, Christoph Matheja, Florian Zuleger, Jens Katelaan, Thomas Noll. Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic, 26th European Symposium on Programming (ESOP 2017), Volume 10201 of LNCS, 611-638, Springer, 2017.
2016
DOI [bibtex] [issue] Benjamin Lucien Kaminski, Christoph Matheja, Federico Olmedo Beron, Joost-Pieter Katoen. Reasoning about Recursive Probabilistic Programs, The 31st Annual ACM/IEEE Symposium, 672-681, ACM Press, 2016.
arXiv:1610.07041 [bibtex] [issue] Christina Jansen, Christoph Matheja, Florian Zuleger, Jens Katelaan, Thomas Noll. Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic, 115 Seiten, 2016. https://arxiv.org/abs/1610.07041
DOI [bibtex] [issue] Benjamin Lucien Kaminski, Christoph Matheja, Federico Olmedo Beron, Joost-Pieter Katoen. Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs, Volume 9632 of LNCS, 364-389, Springer, 2016.
DOI [bibtex] [issue] Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen. Inferring Covariances for Probabilistic Programs, 13th International Conference on Quantitative Evaluation of Systems (QEST 2016), Volume 9826 of LNCS, 191-206, Springer, 2016.
2015
DOI [bibtex] [issue] Christina Jansen, Christoph Matheja, Thomas Noll. Tree-Like Grammars and Separation Logic, 13th Asian Symposium on Programming Languages and Systems (APLAS 2015) (APLAS 2015), Volume 9458 of LNCS, 90-108, Springer, 2015.