The paper “A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations” by Benjamin L. Kaminski and Joost-Pieter Katoen has been accepted to LICS 2017. The paper presents a wp–style calculus for reasoning about the expected values of mixed–sign unbounded random variables after execution of a probabilistic program.
We launch the new probabilistic model checker Storm. It features the analysis of discrete- and continuous-time variants of both Markov chains and MDPs. It supports the Prism and JANI modeling languages, probabilistic programs, dynamic fault trees and generalized stochastic Petri nets. It has a modular set-up in which solvers and symbolic engines can easily be […]
At ETAPS 2017, a workshop on Learning in Verification takes place. The aim of the workshop is to stimulate discussion on the potential of learning techniques in verification and to report on recent advancements,. The program will consist of presentations of work recently accepted to top conferences and ongoing work. The submissions will thus be […]
It is our greatest pleasure to announce the first edition of the School on Foundations of Programming and Software systems (FoPPS). The school is jointly funded by EATCS, ETAPS, ACM SIGLOG, and ACM SIGPLAN. The topic of the first edition is Probabilistic Programming. It will take place in Braga, Portugal, May 29th – June 4th […]
The paper “Sequential Convex Programming for the Efficient Verification of Parametric MDPs” by Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ivan Papusha, Hasan A. Poonawala, and Ufuk Topcu, and the paper “JANI: Quantitative Model and Tool Interaction” by Carlos E. Budde, Christian Dehnert, Ernst Moritz Hahn, Arnd Hartmanns, Sebastian Junges, and Andrea Turrini have […]
The paper “Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic” by Christina Jansen, Jens Katelaan, Christoph Matheja, Thomas Noll and Florian Zuleger has been accepted at ESOP 2017 in Uppsala, Sweden. It introduces the concept of heap automata, a novel formalism for automatic reasoning about robustness properties of the symbolic-heap fragment of separation logic […]
The paper “Fault Trees on a Diet: Automated Reduction by Graph Rewriting” by Sebastian Junges, Dennis Guck, Arend Rensink, Marielle Stoelinga and Joost-Pieter Katoen has been accepted in the journal Formal Aspects of Computing. The more than 50-page paper shows how graph rewriting can be applied to reduce dynamic fault trees prior to their analysis. […]
The talk on “A Weakest Pre-Expectation Semantics for Mixed-Sign Expectations” has been accepted for presentation at the Probabilistic Programming Semantics (PPS) workshop at POPL’17.
The paper “Quantitative Model Checking of Discrete-Time Markov Processes” by Ilya Tkachev, Alexandru Mereacre, Joost-Pieter Katoen, and Alessandro Abate has been accepted for publication in Information and Computation. The almost 50-page paper focuses on optimizing (repeated) reachability probabilities of events of interest defined over general controlled discrete-time Markov processes. Unlike known results over finite-state models, […]
Dino Distefano (FaceBook and Queen Mary University) received the CAV Award 2016, together with his co-workers, for their work on Separation Logic and demonstrating its applicability on the automated verification of dynamic data structures. Dino is the first Ph.D. student of Joost-Pieter Katoen, who supervised him together with Arend Rensink (Twente).