Tools
Our tool development is quite active and we regularly offer Bachelor's and Master's theses on improving verification algorithms. If you are interested, get in touch!
FSTTCS 2016 - RIGG
In conjunction with our FSTTCS 2016 submission Summaries for Context-Free Games, we developed the tool RIGG (Regular Inclusion Grammar Games) that can solve context-free grammar games with a regular winning condition. Our prototype implements our algorithm based on Kleene-iteration as well as Cachat's algorithm for solving pushdown games, that can also be used to solve the problem. We compared the algorithms on random-generated examples and were able to show that our algorithm outperforms Cachat by three orders of magnitude. More information and details about the performance evaluation can be found here.VMCAI16 - Pointer Race Freedom
In conjunction with our VMCAI submission Pointer Race Freedom we developed a model checker for proving linearizability of lock-free data structures. Our prototype leverages the novel notion of pointer races to improve the scalability of an existing thread-modular shape analysis. Indeed, we were able to show a speed-up of two orders of magnitude. More information and details about the performance evaluation can be found here.Trencher

Petruchio

Moby/PEA
