Moves News
Paper accepted at TACAS 2016
The paper “Safety-constrained Reinforcement Learning for MDPs” by Sebastian Junges, Nils Jansen, Christian Dehnert, Ufuk Topcu and Joost-Pieter Katoen has been accepted at TACAS 2016 (acceptance rate 25,7%). The paper addresses the problem: Given an MDP with a cost structure, synthesize an optimal policy subject to safety constraints. In particular, the costs of actions are […]
Mysuru 2016 Workshop on Quantitative Verification
We co-organise the Mysuru 2016 Workshop “Trends and Challenges in Quantitative Verification”, together with Igor Walukiewicz, Srivathsan, and Akshay, early February. Further details can be found here.
Paper in Top-100 most cited papers in Software Engineering
The 2003 IEEE TSE paper “Model-Checking Algorithms for Continuous-Time Markov Chains” by Christel Baier, Boudewijn Haverkort, Holger Hermanns, and Joost-Pieter Katoen is ranked 74 in the top-100 of most cited papers in software engineering (and ranked 57 in the top-100 when considering number of citations per year). The top-100 has recently been published in Information […]
Paper accepted by Formal Methods in System Design
The paper entitled “Efficient GPU Algorithms for Parallel Decomposition of Graphs into Strongly Connected and Maximal End Components” by Anton Wijs, Joost-Pieter Katoen, and Dragan Boshnacki, has been accepted to the special issue of the journal FMSD devoted to CAV 2014.
Talk on Conditioning accepted at POPL PPS workshop
The talk on “On the Semantic Intricacies of Conditioning” has been accepted for presentation at the Probabilistic Programming Semantics (PPS) workshop at POPL’16.
Friedrich Gretz successfully defended his Ph.D. dissertation
Friday September 26, Friedrich Gretz successfully defended his PhD dissertation, entitled “Semantics and Loop Invariant Synthesis for Probabilistic Programs” for a jury consisting of Sriram Sankaranarayanan (Boulder, USA), Stefan Kowalewski, Jürgen Giesl, and Joost-Pieter Katoen (all Aachen). Friedrich’s dissertation studies weakest pre-condition semantics, relates this to operational semantics, and extends this to including observations. In addition, […]
PhD thesis on probabilistic counterexamples
The PhD thesis of Nils Jansen titled “Counterexamples in Probabilistic Verification” has recently been published online at the library webpage and can also be found here. The thesis covers multiple approaches and new concepts to the generation and representation of counterexamples for refuted properties on probabilistic systems. All results have been published at several conference proceedings […]
Sebastian Junges awarded with Best Master Thesis Prize in Germany
Sebastian Junges will receive the price for the best Master Thesis in Computer Science 2014/15 in Germany. His work, entitled Simplifying Fault Trees by Graph Rewriting, has been selected by the Fakultätentag Informatik. Sebastian will be awarded the price during the 45th Annual Meeting of the German Informatics Society (Gesellschaft für Informatik e.V. – GI).
Paper accepted by Formal Methods in System Design
The paper entitled Juggrnaut: Using Graph Grammars for Abstracting Unbounded Heap Structures by Jonathan Heinen, Christina Jansen, Joost-Pieter Katoen and Thomas Noll has been accepted for publication by the Formal Methods in System Design journal. This paper presents a novel abstraction framework for heap data structures that employs graph grammars for modelling dynamic data structures, and […]
Paper accepted at SETTA 2015
The paper “Fault trees on a Diet” by Sebastian Junges, Dennis Guck, Joost-Pieter Katoen, Arend Rensink and Mariëlle Stoelinga has been accepted at SETTA’15. The paper presents a novel, fully automated reduction technique for Dynamic Fault Trees (DFTs). The key idea is to interpret DFTs as directed graphs and exploit graph rewriting to simplify them.