In 1987 Angluin proposed an algorithm, termed L⁎ for inferring an unknown regular
language using membership and equivalence queries. This algorithm has found many …

Family-based behavioral analysis operates on a single specification artifact, referred to as
family model, annotated with feature constraints to express behavioral variability in terms of …

We revisit the classic problem of proving safety over parameterised concurrent systems, ie,
an infinite family of finite-state concurrent systems that are represented by some finite …

In this paper, we propose a novel algorithm to learn a Büchi automaton from a teacher who
knows an ω-regular language. The learned Büchi automaton can be a nondeterministic …

Families of dfas (fdfas) provide an alternative formalism for recognizing ωregular languages.
The motivation for introducing them was a desired correlation between the automaton states …

We introduce a novel technique for verification and model synthesis of sequential programs.
Our technique is based on learning an approximate regular model of the set of feasible …

Automata learning is a technique that has successfully been applied in verification, with the
automaton type varying depending on the application domain. Adaptations of automata …

Abstract We present ROLL 1.0, an ω-regular language learning library with command line
tools to learn and complement Büchi automata. This open source Java library implements all …

Termination is a fundamental liveness property for program verification. In this paper, we
revisit the problem of non-termination analysis and propose the first data-driven learning …

Software model checking constitutes an undecidable problem and, as such, even an ideal
tool will in some cases fail to give a conclusive answer. In practice, software model checkers …