Sebastian Junges today received the Young Research Award, a prize for excellent young researchers (students and Ph.D. students) in the ICT field, awarded by the ICT Profile Area of RWTH Aachen University. The prize comes with a financial support for Sebastian’s career.

Thursday October 19, Christina Jansen successfully defended her PhD dissertation, entitled “Static Analysis of Pointer Programs: Linking Graph Grammars and Separation Logic” for a jury consisting of Marieke Huisman (University of Twente, NL), Gerhard Woeginger, Horst Lichter, Thomas Noll, and Joost-Pieter Katoen (all Aachen).  Christina’s dissertation is concerned with establishing a connection between data structure […]

The German Research Foundation (DFG) has approved to extend the funding period of the ATTESTOR project for another two-year period. The aim of the follow-up project is to develop novel techniques and tools to support formal reasoning on relational shape properties of (concurrent) pointer programs, allowing e.g. to reason about balanced tree data structures. The […]

The paper entitled “A new proof rule for almost-sure termination” by Annabelle McIver, Carroll Morgan, Benjamin Kaminski, and Joost-Pieter Katoen has been accepted for POPL 2018. The paper presents a proof rule to verify whether a probabilistic program (possibly including non-determinacy) almost surely terminates. The new proof rule enables to capture a larger class of […]

The MOVES group is co-organising a seminar on Analysis and Verification of Pointer Programs, which will be held from October 2 to 5, 2017, as an NII Shonan Meeting at Shonan Village Center in Japan. This meeting will be a scientific event bringing together both theoreticians and practitioners working on different techniques for heap abstraction […]

The paper “Conditioning in Probabilistic Programming” by Federico Olmedo, Friedrich Gretz, Nils Jansen, Benjamin L. Kaminski, Joost-Pieter Katoen and Annabelle McIver has been accepted for the journal ACM Transactions on Programming Languages and Systems. The paper treats the semantic intricacies of introducing conditioning in a probabilistic programming language, its interference with non-determinacy, and divergence.

The paper entitled “Automated Fine Tuning of Probabilistic Self-Stabilizing Algorithms” by Saba Aflaki, Matthias Volk, Borzoo Bonakdarpour, Joost-Pieter Katoen and Arne Storjohann has been selected as Prof. C.V. Ramamoorthy Best Paper Award at the 36th IEEE Int. Symposium on Reliable Distributed Systems in Hongkong. The paper presents automated techniques to find the probability distribution that […]

In honour of the 60th birthday of Ed Brinksma, we co-organize the symposium “ModelEd, TestEd, TrustEd” on 18 October 2017, in the Amphitheatre (Vrijhof), University of Twente, the Netherlands. The symposium will be a scientific event hosting a number of renowned speakers with whom Ed Brinksma has cooperated in the past. The day will culminate […]

The paper entitled “Motion Planning under Partial Observability using Game-Based Abstraction” by Leonore Winterer, Sebastian Junges, Ralf Wimmer, Nils Jansen, Ufuk Topcu, Joost-Pieter Katoen, and Bernd Becker has been accepted for publication at CDC 2017 in Melbourne, Australia. The paper applies model-checking to synthesise motion plans for robots under partial observability, and makes this feasible by […]

The paper entitled “Automated Fine Tuning of Probabilistic Self-Stabilizing Algorithms” by Saba Aflaki, Matthias Volk, Borzoo Bonakdarpour, Joost-Pieter Katoen and Arne Storjohann has been accepted at SRDS 2017 in Hongkong. The paper presents automated techniques to find the probability distribution that achieves minimum average recovery time for randomized distributed self-stabilizing algorithms.