Moves News

Member AKW-NRW

The North Rhine-Westphalian Academy of Sciences, Humanities and the Arts has elected Joost-Pieter Katoen as ordinary member. Katoen is the third computer scientist from RWTH Aachen University that has become a member of AKW-NRW. The other CS members are Wil van der Aalst and Leif Kobbelt.

Paper in STTT

The paper entitled “Scenario-Based Verification of Uncertain Parametric MDPs” by Thom Badings, Nils Jansen, and Sebastian Junges (all Radboud University Nijmegen, NL), Murat Cubuktepe and Ufuk Topcu (UT Austin, USA) and Joost-Pieter Katoen has been accepted in the International Journal on Software Tools for Technology Transfer (special issue devoted to TACAS 2020). The paper focuses on […]

CONCUR Test-of-Time Award

With great pleasure, we announce that the paper entitled “Approximate symbolic model checking of continuous-time Markov chains” by Christel Baier, Holger Hermanns and Joost-Pieter Katoen has been selected for the CONCUR Test-of-Time Award. The purpose of the award is to recognize important achievements in Concurrency Theory that were published at the CONCUR conference and have […]

Successful Dissertation Defense

On April 28, Matthias Volk successfully defended his PhD dissertation entitled: “Dynamic Fault Trees: Analysis, Semantics, and Applications” for a jury consisting of the external examinar Allessandro Cimatti (FBK Trento, IT), the examiner Wil van der Aalst, supervisor Joost-Pieter Katoen and chairman Stefan Kowalewski. The dissertation provides a formal DFT semantics by means of generalized […]

Paper at CAV 2022

The paper entitled “Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions” by Mingshuai Chen, Joost-Pieter Katoen, Lutz Klinkenberg and Tobias Winkler has been accepted at CAV 2022 (Computer-Aided Verification). Out of 209 submissions, 40 regular papers have been accepted at CAV 2022. The paper leverages probability generating functions to prove […]

Two papers at NFM 2022

The paper “BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees” by Daniel Basgöze, Matthias Volk (Twente), Joost-Pieter Katoen, Shahid Khan and Marielle Stoelinga (Twente) as well as the paper “Configurable Benchmarks for C Model Checkers” by Xaver Fink, Philipp Berger and Joost-Pieter Katoen have been accepted for presentation at the NASA Formal […]

Paper at TACAS 2022

The paper entitled “Under-Approximating Expected Total Rewards in POMDPs” by Alexander Bork, Tim Quatmann and Joost-Pieter Katoen has been accepted for the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). The paper has also successfully passed all aspects of the artifact evaluation. The paper presents a novel algorithm […]

Paper at FoSSaCS 2022

The paper entitled “ Model Checking Temporal Properties of Recursive Probabilistic Programs” by Tobias Winkler, Christina Gehnen and Joost-Pieter Katoen has been accepted at the 25th Int. Conf. on Foundations of Software Science and Computation Structure (FoSSaCS 2022). The paper presents decidability and complexity results for checking quantitative properties of visibly omega-regular languages against probabilistic […]

Paper at ESOP 2022

The paper entitled “Foundations for Entailment Checking in Quantitative Separation Logic” by Kevin Batz, Ira Fesefeldt, Marvin Jansen, Joost-Pieter Katoen, Florian Keßler, Christoph Matheja and Thomas Noll has been accepted for ESOP 2022, the 31st European Symposium on Programming. The paper presents the first results on decidability and complexity for entailment checking in quantitative separation […]

Paper at OOPSLA 2022

The paper entitled “Weighted Programming: A Programming Paradigm for Specifying Mathematical Models” by Kevin Batz, Adrian Gallus, Benjamin Kaminski, Joost-Pieter Katoen and Tobias Winkler has been accepted for OOPSLA 2022, which will be held as part of the ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH’22). The papers develops weakest-precondition- and weakest-liberal-precondition-style […]