Joost-Pieter Katoen
Mysuru 2016 Workshop on Quantitative Verification
We co-organise the Mysuru 2016 Workshop “Trends and Challenges in Quantitative Verification”, together with Igor Walukiewicz, Srivathsan, and Akshay, early February. Further details can be found here.
Paper in Top-100 most cited papers in Software Engineering
The 2003 IEEE TSE paper “Model-Checking Algorithms for Continuous-Time Markov Chains” by Christel Baier, Boudewijn Haverkort, Holger Hermanns, and Joost-Pieter Katoen is ranked 74 in the top-100 of most cited papers in software engineering (and ranked 57 in the top-100 when considering number of citations per year). The top-100 has recently been published in Information […]
Paper accepted by Formal Methods in System Design
The paper entitled “Efficient GPU Algorithms for Parallel Decomposition of Graphs into Strongly Connected and Maximal End Components” by Anton Wijs, Joost-Pieter Katoen, and Dragan Boshnacki, has been accepted to the special issue of the journal FMSD devoted to CAV 2014.
Talk on Conditioning accepted at POPL PPS workshop
The talk on “On the Semantic Intricacies of Conditioning” has been accepted for presentation at the Probabilistic Programming Semantics (PPS) workshop at POPL’16.
Friedrich Gretz successfully defended his Ph.D. dissertation
Friday September 26, Friedrich Gretz successfully defended his PhD dissertation, entitled “Semantics and Loop Invariant Synthesis for Probabilistic Programs” for a jury consisting of Sriram Sankaranarayanan (Boulder, USA), Stefan Kowalewski, Jürgen Giesl, and Joost-Pieter Katoen (all Aachen). Friedrich’s dissertation studies weakest pre-condition semantics, relates this to operational semantics, and extends this to including observations. In addition, […]
CAV 2015
Our new PROPhESY tool for parameter synthesis of Markov chains has been elected (out of 30 artefacts) as runner-up in the Artifact Evaluation at CAV 2015. In addition, Joost-Pieter Katoen gave a three-hour tutorial on probabilistic verification. The tutorial slides can be found here.
Sebastian Junges receives prize for excellent master studies
Sebastian Junges received on last Friday (June 26) a price for his excellent achievements in his master studies Computer Science. Sebastian recently completed his master thesis on “Simplifying Dynamic Fault Trees by Graph Rewriting” and was co-supervised by Marielle Stoelinga (Twente). We congratulate Sebastian with this great result!
Paper accepted at FORMATS 2015
The paper entitled “Multi-Objective Parameter Synthesis in Probabilistic Hybrid Systems” by Martin Fränzle, Sebastian Gerwinn, Paul Kröger (all Oldenburg), Alessandro Abate (Oxford) and Joost-Pieter Katoen has been accepted at the 13th Int. Conf. on Formal Modeling and Analysis of Timed Systems. This paper presents a method to synthesize parameter instances (if such exist) of probabilistic hybrid automata satisfying a […]
Paper accepted at MFCS 40
The paper “On the Hardness of Almost-Sure Termination” by Benjamin Kaminski and Joost-Pieter Katoen has been accepted at the 40th MFCS (Mathematical Foundations in Computer Science) conference in Milano. This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs with non-determinism.
PROPhESY has been CAV Artifact Evaluated
We are happy to announce that our tool PROPhESY: A PRObabilistic ParamEter SYnthesis has successfully passed the CAV 2015 Artifact Evaluation. The purpose of the evaluation is to provide a service by the community to help authors provide more substantial supplements to their papers so future researchers can more effectively build on and compare with […]