Thomas Noll

Paper at SEFM 2021

The tool paper entitled “A Debugger for Probabilistic Programs” by Alexander Hoppen and Thomas Noll has been accepted for presentation at the 19th International Conference on Software Engineering and Formal Methods (SEFM 2021). The paper presents both a theoretical foundation and a prototype implementation of a recording-based debugger for imperative probabilistic programs supporting randomised choice, […]

Paper at SafeComp 2021

The paper “A Modular Approach To Non-Deterministic Dynamic Fault Trees” by Sascha Müller, Adeline Jordon, Andreas Gerndt (all German Aerospace Center DLR, Braunschweig) and Thomas Noll has been accepted at the 40th International Conference on Computer Safety, Reliability and Security (SafeComp 2021). It presents a modular approach for synthesising recovery strategies from non-deterministic dynamic fault […]

Paper at ICGT 2021

The paper “Automated Detection and Completion of Confluence for Graph Grammars” by Ira Fesefeldt, Christoph Matheja, Thomas Noll, and Johannes Schulte has been accepted as a tool paper at the International Conference on Graph Transformation (ICGT 2021). It presents an approach to check for a given context-free graph grammar whether the corresponding backward graph reduction […]

Job Opportunities as Student Assistants

We are seeking two talented student assistants to support the digitalisation of online bridging courses in Theoretical Computer Science. More concretely, the following tasks need to be performed: the development and implementation of generators for exercise tasks and Moodle plugins and the creation of new and the preparation of existing learning material in Moodle. More […]

Thesis Awards

During the virtual Tag der Informatik, two students of our group have been awarded for their final theses. Florian Keßler received the CS Department Award for his bachelor’s thesis On the Decidability of Entailment Checking in Quantitative Separation Logics, while Jan Svejda received the DSA Industrial Award for his master’s thesis entitled Interpretation-Based Violation Witness Validator. Congratulations!

ICT Young Researcher Award

On October 30, the ICT Young Researcher Award 2020 has been awarded to Christopher Brix, who did his master thesis entitled Proving Non-Existence of Imperceptible Adversarial Examples in Deep Neural Networks Using Symbolic Propagation With Error Bounds in our group. The award is given to students at Bachelor, Master and Ph.D. level at RWTH Aachen […]

Paper in Science of Computer Programming

The paper “Synthesizing and Optimizing FDIR Recovery Strategies From Fault Trees“ by Sascha Müller, Liana Mikaelyan, Andreas Gerndt (DLR German Aerospace Center, Braunschweig) and Thomas Noll has been accepted for publication by the Science of Computer Programming Journal. It investigates the synthesis of efficient recovery strategies for Failure Detection, Isolation and Recovery (FDIR) for space […]

Paper in STTT

The paper entitled “IC3 Software Model Checking” by Tim Lange, Martin R. Neuhäußer (Siemens AG), Thomas Noll, and Joost-Pieter Katoen has been accepted for the International Journal on Software Tools for Technology Transfer (STTT). The paper introduces an extension of the IC3 verification algorithm for computer software that employs an explicit representation of a program’s […]

Paper in Journal of Aerospace Information Systems

The paper entitled “Synthesizing FDIR Recovery Strategies From Non-Deterministic Dynamic Fault Trees” by Sascha Müller, Andreas Gerndt (both from the German Aerospace Center (DLR)), and Thomas Noll has been accepted for publication in the Journal of Aerospace Information Systems. It shows how appropriate recovery strategies for dealing with failures in aerospace control systems can be […]

Paper at IWIL 2018

The paper entitled “Harrsh: A Tool for Unified Reasoning about Symbolic-Heap Separation Logic” by Jens Katelaan, Christoph Matheja, Thomas Noll and Florian Zuleger has been accepted for presentation at the 13th International Workshop on the Implementation of Logics (IWIL 2018). The paper presents a tool for unified reasoning about the symbolic-heap fragment of separation logic. […]