The paper “Parameter-Independent Strategies for pMDPs via POMDPs” by Sebastian Arming, Ezio Bartocci, Krishnendu Chatterjee, Ana Sokolova, and Joost-Pieter Katoen and the paper “Model Checking For Safe Navigation Among Humans” by Sebastian Junges, Nils Jansen, Joost-Pieter Katoen, Ufuk Topcu, Ruohan Zhang and Mary Hayhoe have been accepted at QEST 2018 in Beijing. The first paper shows that strategies for parametric MDPs which optimize the expected reachability probability under a given…
The paper entitled “Rule-based Conditioning of Probabilistic Data Integration” by Maurice van Keulen, Benjamin Kaminski, Joost-Pieter Katoen, and Christoph Matheja has been accepted for the 12th Int. Conf. on Scalable Uncertainty Management. The paper presents how to integrate evidences into a probabilistic database.
We solicit applications for PhD studentships and postdoctoral research positions in the area of verifying probabilistic programs. The positions are funded by the recently acquired ERC Advanced Grant "Formal Reasoning about Probabilistic Programs (FRAPPANT)". What is this project all about? Probabilistic programs describe recipes on how to infer statistical conclusions about data from a complex mixture of uncertain data and real-world observations. They can represent probabilistic graphical…
The paper entitled “Finite-State Controllers of POMDPs using Parameter Synthesis” by Sebastian Junges, Nils Jansen, Ralf Wimmer, Tim Quatmann, Leonore Winterer, Bernd Becker, and Joost-Pieter Katoen has been accepted for the Uncertainty in AI 2018 Conference in Monterrey, USA. The key idea of the paper is that that computing randomised FSCs on POMDPs is equivalent to (and computationally as hard as) synthesis for parametric Markov chains.
The paper entitled “Improving Generalization in Software IC3” by Tim Lange, Frederick Prinz, Martin R. Neuhäußer (Siemens), Thomas Noll and Joost-Pieter Katoen has been accepted for the 25th International Symposium on Model Checking of Software (SPIN 2018) in Malaga, Spain. The paper presents several advancements to the generalization procedure of IC3, focused on software verification. Experimental results show the effect of the various techniques.
The paper entitled “On the Hardness of Analyzing Probabilistic Programs” by Benjamin Kaminski, Joost-Pieter Katoen, and Christoph Matheja has been accepted for publication in the journal Acta Informatica. The papers presents various hardness results for elementary decision problems on probabilistic programs such as “does a program terminate almost surely?”, “does it terminate in finite expected time?”, and “is the co-variance of two variables equal to a constant?”.
The paper entitled “Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms” by Benjamin Kaminski, Joost-Pieter Katoen, Christoph Matheja and Federico Olmedo has been accepted for the prestigious journal Journal of the ACM. This paper presents a wp–style calculus for obtaining bounds on the expected run time of randomized algorithms.Its application includes determining the (possibly infinite) expected termination time of a randomized algorithm and proving positive…
The paper “Graph-Based Shape Analysis Beyond Context-Freeness” by Hannah Arndt, Christina Jansen, Christoph Matheja and Thomas Noll has been accepted for publication at the 16th International Conference on Software Engineering and Formal Methods (SEFM 2018). It introduces a shape analysis for reasoning about relational properties of data structures that are maintained by a pointer program, such as balancedness of trees or lengths of lists.
The papers “Verifying Auto-Generated C Code from Simulink” by Philipp Berger, Joost-Pieter Katoen, Erika Ábrahám, Md Tawhid Bin Waez and Thomas Rambow, as well as the paper “Formal Verification of Automotive Simulink Controller Models: Empirical Technical Challenges, Evaluation and Recommendations” by Johanna Nellen, Thomas Rambow, Md Tawhid Bin Waez, Erika Abraham and Joost-Pieter Katoen, have been accepted for the Formal Methods 2018 symposium. Both papers report on results obtained in joint…
Joost-Pieter Katoen is awarded the prestigious ERC Advanced Grant from the European Research Council. It will allow to fund a project on formal reasoning techniques for probabilistic programs over a period of five years. ERC Advanced Grants are intended to support the very best research to be conducted in EU member states and associated countries. They are to allow exceptional, established leaders in research to pursue ground-breaking high-risk projects that open new directions in their…
Four papers with involvement of the MOVES group have been accepted at CAV 2018: “Sound Value Iteration” by Tim Quatmann and Joost-Pieter Katoen “Let this Graph be your Witness! An Attestor for Verifying Java Pointer Programs” by Hannah Arndt, Christina Jansen, Joost-Pieter Katoen, Christoph Matheja and Thomas Noll “Monitoring CTMCs By Multi-Clock Timed Automata” by Yijun Feng, Joost-Pieter Katoen, Haokun Li, Bican Xia and Naijun Zhan, and “Symbolic Liveness Analysis of Real-World Software” by…
The paper “Branching Bisimulation and Concurrent Object Verification” by Xiaoxiao Yang, Joost-Pieter Katoen, Huimin Lin, Gaoang Liu, and Hao Wu has been accepted for the 48th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2018) in Luxemburg. The paper, a result of the cooperation within the CDZ project CAP with the Institute of Software, Chinese Academy of Sciences in Beijing, proposes the usage of branching bisimulation for proving elementary properties of…
The paper “One Nets Fits All — A unifying semantics of Dynamic Fault Trees using GSPNs” by Sebastian Junges, Joost-Pieter Katoen, Marielle Stoelinga and Matthias Volk has been accepted for Petri Nets 2018. The paper presents a simple, compositional GSPN semantics for DFTs that unifies all existing DFT semantics from the literature.
The paper “Multi-Cost Bounded Reachability in MDPs” by Arnd Hartmanns, Sebastian Junges, Joost-Pieter Katoen and Tim Quatmann has been accepted for TACAS 2018. The paper presents an efficient algorithm for multi-objective model checking problems on Markov decision processes (MDPs) with multiple cost structures.
The paper “How long, O Bayesian network, will I sample thee?” by Kevin Batz, Benjamin Kaminski, Joost-Pieter Katoen and Christoph Matheja has been accepted at the European Symposium on Programming (ESOP 18). The paper shows how to use deductive program verification to deduce the expected time to obtain a single i.i.d-sample from a Bayesian network when using rejection sampling. The approach has been automated and shows that determining expected sampling times of the order of millions years for…