Joshua Moerman

Paper at LICS 2021

The paper entitled “Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata” by Mikołaj Bojańczyk, Bartek Klin and Joshua Moerman has been accepted at LICS 2021. This paper introduces a new model, weighted register automata, and shows that it has good decidability properties and that is defines a robust class of languages. This class of automata captures […]

5 Gold medals at RERS 2020

We are happy to announce that our team (Joshua Moerman and Jana Berger) has won 5 gold medals at the RERS challenge 2020. By using a combination of off-the-shelf verification tools, they have managed to crack many of the reachability problems and LTL verification problems. To get more information, please read their report.

Tutorial at FSTTCS

Joshua Moerman will give a tutorial on Automata Learning at FSTTCS 2020, the 40th conference on Foundations of Software Technology and Theoretical Computer Science. It is part of the workshop Advances in Verification. The workshop will take place virtually on 18 December 2020.

Paper at CONCUR 2020

The paper entitled “Residual Nominal Automata” by Joshua Moerman and Matteo Sammartino (Royal Holloway University of London) has been accepted for the 31st International Conference on Concurrency Theory (CONCUR 2020). Out of 112 submissions, 45 papers are accepted. The paper is about formal languages over infinite alphabets. It investigates the class of languages accepted by […]

Paper at CSL 2020

The paper entitled “Separation and Renaming in Nominal Sets” by Joshua Moerman and Jurriaan Rot (UCL, London and Radboud University, the Netherlands) has been accepted for the 28th edition in the series of Computer Science Logic (CSL 2020). Nominal sets provide a foundation for reasoning about names. They are used primarily in syntax with binders, […]