Moves News

LOPSTR 2020 Best Paper Award

We are happy to announce that the paper “Generating Functions for Probabilistic Programs” by Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman and Tobias Winkler has received the best paper award at LOPSTR 2020, the 30th Int. Symp. on Logic-Based Program Synthesis and Transformation.

Job Opportunities as Student Assistants

We are seeking two talented student assistants to support the digitalisation of online bridging courses in Theoretical Computer Science. More concretely, the following tasks need to be performed: the development and implementation of generators for exercise tasks and Moodle plugins and the creation of new and the preparation of existing learning material in Moodle. More […]

Thesis Awards

During the virtual Tag der Informatik, two students of our group have been awarded for their final theses. Florian Keßler received the CS Department Award for his bachelor’s thesis On the Decidability of Entailment Checking in Quantitative Separation Logics, while Jan Svejda received the DSA Industrial Award for his master’s thesis entitled Interpretation-Based Violation Witness Validator. Congratulations!

Book Foundations of Probabilistic Programming Published

The book “Foundations of Probabilistic Programming”, edited by Gilles Barthe, Joost-Pieter Katoen and Alexandra Silva has been published under gold open access. It contains survey chapters of various leading researchers on formal semantics, verification, analysis and applications of probabilistic programming. Get your free download at: https://www.cambridge.org/core/books/foundations-of-probabilistic-programming/819623B1B5B33836476618AC0621F0EE#

ICT Young Researcher Award

On October 30, the ICT Young Researcher Award 2020 has been awarded to Christopher Brix, who did his master thesis entitled Proving Non-Existence of Imperceptible Adversarial Examples in Deep Neural Networks Using Symbolic Propagation With Error Bounds in our group. The award is given to students at Bachelor, Master and Ph.D. level at RWTH Aachen […]

Ackermann Award 2020

Benjamin Kaminski will receive the prestigious 2020 Ackermann Award for his Ph.D. dissertation on “Advanced Weakest Precondition Calculi for Probabilistic Programs” which he defended in February 2019. The Ackermann Award is an annual award by the EACSL (European Association of Computer Science Logic) and is given to an outstanding dissertation in the area “Logic in […]

Student Assistant Sought for Teaching Job

We are currently looking for a student assistant, with a background on theoratical computer science, to support our lecture “Probabilisitic Programming”. The job description can be found here.

Tutorial at FSTTCS

Joshua Moerman will give a tutorial on Automata Learning at FSTTCS 2020, the 40th conference on Foundations of Software Technology and Theoretical Computer Science. It is part of the workshop Advances in Verification. The workshop will take place virtually on 18 December 2020.

Storm Journal Paper

The paper ” The Probabilistic Model Checker Storm” by Christian Hensel, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann and Matthias Volk has been accepted for the Journal of Software Tools in Technology Transfer. The paper presents the ins and outs of Storm, the model checker for discrete and continuous Markov models (with and without non-determinism) that […]

Two POPL 2021 Papers

We are delighted to announce that the following papers have been accepted for ACM Principles of Programming Languages 2021:  Relatively Complete Verification of Probabilistic Programs by Kevin Batz, Benjamin Kaminski, Joost-Pieter Katoen and Christoph Matheja, and A Pre-Expectation Calculus for Probabilistic Sensitivity by Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Kaminski, Joost-Pieter Katoen and Christoph […]