Joost-Pieter Katoen
First School on Foundations of Programming and Software systems — Probabilistic Programming
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 […]
Two papers accepted at TACAS 2017
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 […]
Paper accepted at ESOP 2017
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 […]
Paper accepted in Formal Aspects of Computing
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. […]
Talk on Semantics for Mixed-Sign Expectations accepted at POPL PPS Workshop
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.
Paper accepted in Information & Computation
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, […]
CAV Award 2016
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).
Paper accepted at SETTA’16
The paper “Performance Evaluation on Modern Concurrent Data Structures” by Hao Wu, Xiaoxiao Yang and Joost-Pieter Katoen has been accepted at SETTA 2016 in Beijing. The paper considers the modelling of several concurrent data structures in LOTOS-NT and evaluates their performance by model-based analysis.
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 […]