The paper entitled Tree-Like Grammars and Separation Logic by Christoph Matheja, Christina Jansen and Thomas Noll has been accepted at the 13th Asian Symposium on Programming Languages and Systems (APLAS 2015).  This paper investigates the relationship between certain classes of tree grammars and logical formalisms, especially with regard to the corresponding inclusion and entailment problems.

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.

The paper entitled IC3 Software Model Checking on Control Flow Automata by Tim Lange, Martin Neuhäußer (Siemens AG) and Thomas Noll has been accepted at the 15th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2015).  This paper presents a method to exploit a program’s control flow for efficiently model checking its correctness properties.

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!

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 […]

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.  

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 […]

The paper “Conditioning in Probabilistic Programming” by Friedrich Gretz, Nils Jansen, Benjamin Kaminski, Joost-Pieter Katoen, Annabelle McIver, and Federico Olmedo has been accepted at the 31st Mathematical Foundations of Programming Semantics Conference.  The paper provides an operational and wp-semantics for an imperative probabilistic programming language with conditioning, studies their relation, and shows its usage for program […]

Friday April 24, Falak Sher successfully defended his PhD dissertation, entitled “Abstraction and Refinement of Probabilistic Automata using Modal Stochastic Games” for a jury consisting of Lijun Zhang (ISCAS Beijing, China), Stefan Kowalewski, Erich Grädel, and Joost-Pieter Katoen (all Aachen).  Falak’s dissertation is concerned with game-based abstraction-refinement in which (instead of existing works) the underlying […]

The website for this year’s Sommerfest is now live! You can find it at http://sommerfest-informatik.de. This year it is organized by our group, and will take place June 26th. The three main events, Karriere, Kluge Kopfe and Coole Party, promise to make it a great day. Visit the link if you want to know more.