Spot is a C++ 17 library for LTL and ω-automata manipulation, with command-line utilities,
and Python bindings. This paper summarizes its evolution over the past six years, since the …

Abstract Evaluation of scientific contributions can be done in many different ways. For the
various research communities working on the verification of systems (software, hardware, or …

The problem of learning automata from example traces (but no equivalence or membership
queries) is fundamental in automata learning theory and practice. In this paper, we study this …

Software often needs to exist in different variants, which account for varying customer
requirements, environments, or non-functional aspects, such as energy consumption …

Active automata learning is a technique for dynamically learning finite state machine models
of black-box systems. Conformance testing is a well-known bottleneck during learning …

This paper (1) summarizes the history of the RERS challenge for the analysis and
verification of reactive systems, its profile and intentions, its relation to other competitions …

VerifyThis is a series of competitions that aims to evaluate the current state of deductive tools
to prove functional correctness of programs. Such proofs typically require human creativity …

Sharing research artifacts is known to help people to build upon existing knowledge, adopt
novel contributions in practice, and increase the chances of papers receiving attention. In …

A bottleneck in modern active automata learning is to test whether a hypothesized Mealy
machine correctly describes the system under learning. The search space for possible …

In various scientific communities dealing with formal analysis, software competitions have
emerged and contributed to fostering progress in state of the art and providing insight into …