Moves News
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.
Paper accepted at APLAS 2015
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.
CAV 2015
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.
Paper accepted at FMCAD 2015
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.