Moves News
Two papers accepted at ATVA
Two new papers have been accepted at ATVA 2016 in Chiba, Japan. The paper “Bounded Model Checking for Probabilistic Program” by Nils Jansen, Christian Dehnert, Benjamin Lucien Kaminski, Joost-Pieter Katoen, and Lukas Westhofen describes an automated on-the-fly verification approach for probabilistic programs. It incorporates key features such as conditioning and parametric probabilities. Experiments show the feasibility […]
LICS 2016 invited talk
Joost-Pieter Katoen will give an invited talk on “The Probabilistic Model Checking Landscape” at LICS 2016 in New York City, early July 2016. The accompanying paper can be found here.
Paper accepted at QEST 2016
The paper “Inferring Covariances for Probabilistic Programs” by Benjamin Kaminski, Joost-Pieter Katoen and Christoph Matheja has been accepted at the Int. Conf. on Quantitative Evaluation of SysTems (QEST) in Quebec City, Canada. The paper shows that approximating (co)variances is computationally more difficult than approximating expected values and presents invariant-based techniques for approximating both upper and […]
Two papers accepted at SAFECOMP 2016
Two new papers have been accepted at SAFECOMP 2016 in Trondheim, Norway. The paper “Advancing Dynamic Fault Tree Analysis” by Matthias Volk, Sebastian Junges, and Joost-Pieter Katoen presents a mixture of a new state-space generation technique together with several reduction techniques for dynamic fault trees. Experiments results show improvements of up to five orders of […]
Paper accepted in ACM TECS; best paper at IDEA 2016
The paper “Probabilistic Model Checking for Uncertain Scenario-Aware Data Flow” by Joost-Pieter Katoen and Hao Wu has been accepted for publication in the journal ACM Transactions on Embedded Computing Systems. A short version thereof received the best paper award at the IDEA Workshop during the CPS week 2016. Based on a compositional semantics of exponentially-timed S(A)DF […]
Best Theory Paper at ETAPS 2016
The paper “Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs” by Benjamin Kaminski, Joost-Pieter Katoen, Christoph Matheja, and Federico Olmedo, has received the EATCS Best Paper Award at ETAPS 2016. Out of 473 submissions, this paper was selected as one of the two best theory papers at ETAPS 2016.
Two papers accepted at LICS 2016
The paper “Reasoning about Recursive Probabilistic Programs” by Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen and Christoph Matheja, as well as the paper “On the Satisfiability of Some Simple Probabilistic Logics” by Souymodip Chakraborty and Joost-Pieter Katoen have been accepted at LICS 2016. The former paper presents a wp-calculus and accompanying proof rules for recursive […]
Paper accepted at DSN 2016
The paper “Uncovering Dynamic Fault Trees” by Sebastian Junges, Dennis Guck, Joost-Pieter Katoen and Marielle Stoelinga has been accepted for publication at DSN 2016. The paper presents a thorough discussion of the semantic intricacies of dynamic fault trees and a comparison of existing interpretations of such fault trees.
Paper accepted by Theoretical Computer Science
The paper “Confluence Reduction for Markov Automata” by Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol and Marielle Stoelinga has been accepted for the journal Theoretical Computer Science. The paper describes an on-the-fly symbolic reduction technique for Markov automata akin to partial-order reduction. Experiments show that up to 90% of the potential reductions that could […]
Paper accepted at ESOP 2016
The paper “Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs” by Benjamin Kaminski, Joost-Pieter Katoen, Christoph Matheja and Federico Olmedo has been accepted for publication at ESOP 2016. The paper presents a wp-calculus for probabilistic programs to analyse their expected run-times, together with a set of proof rules for loops, and shows its application to […]