December 18, 2020
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.
December 4, 2020
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!
November 29, 2020
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#
October 30, 2020
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 University who make a significant contribution to research in the field of information and communication technologies and thus increase the visibility…
Read more about ICT Young Researcher AwardOctober 28, 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 Computer Science”. More details can be found here.
October 22, 2020
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.
October 22, 2020
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.
October 5, 2020
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 has dominated the 2019 and 2020 tool competitions on probabilistic model checking.
October 1, 2020
Congratulations to Matthias Volk and Norman Weik who got the 3rd place in the Young Researcher Competition in the Category “Rail” for their contribution “Reliability analysis of railway station infrastructure based on dynamic fault trees” at the TRA VISIONS 2020 Conference, see https://www.travisions.eu/TRAVisions/young%5Fresearcher%5Fresults%5F2020/
October 1, 2020
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 Matheja. The former paper proves relative completeness for a syntex of…
Read more about Two POPL 2021 PapersAugust 10, 2020
We are looking for a motivated, enthusiastic student assistant to help us develop some features related to Bayesian Networks in the probabilistic model checker, Storm. The job description can be found here.
July 19, 2020
The paper entitled “Generating Functions for Probabilistic Programs” by Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman and Tobias Winkler has been accepted for presentation at the 30th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR). The paper presents a denotational semantics for probabilistic programs using generator functions, shows it relation to Kozen’s semantics and present techniques on effectively…
Read more about Paper at LOPSTR 2020July 8, 2020
The paper entitled “Residual Nominal Automata” by Joshua Moerman and Matteo Sammartino (Royal Holloway University of London) has been accepted for the 31st International Conference on Concurrency Theory (CONCUR 2020). Out of 112 submissions, 45 papers are accepted. The paper is about formal languages over infinite alphabets. It investigates the class of languages accepted by “residual automata”. These have good properties for learning them from observations.
June 24, 2020
The paper entitled “Verification of indefinite-horizon POMDPs” by Alexander Bork, Sebastian Junges (UC Berkeley), Joost-Pieter Katoen and Tim Quatmann has been accepted for the 18th Int. Symp. on Automated Technology for Verification and Analysis (ATVA 2020). The key idea is to use abstractions of belief states and apply an abstraction-refinement strategy to verify unbounded reachability properties.
June 21, 2020
The papers entitled “Bayesian Inference by Symbolic Model Checking” by Bahare Salmani and Joost-Pieter Katoen and “Probabilistic Model Checking of AODV” by Mojgan Kamali and Joost-Pieter Katen have been accepted at the 17th Int. Conf. on Quantitative Evaluation of Systems (QEST 2020). Out of 42 submissions to QEST 2020, 10 papers have been unconditionally accepted The first papers investigates the usage of symbolic probabilistic model checking of Bayes’ networks and experimentally compares this…
Read more about Two papers at QEST 2020