We describe a new and more efficient algorithm for checking universality and language
inclusion on nondeterministic finite word automata (NFA) and tree automata (TA). To the …

In this paper, we study the structure of underlying automata based constructions for solving
the LTL realizability and synthesis problem. We show how to reduce the LTL realizability …

We present a specification language and a fully automated tool named AutoQ for verifying
quantum circuits symbolically. The tool implements the automata-based algorithm from and …

Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex
recursive data structures, used in compositional verification of programs manipulating such …

We present a general theory that exploits simulation relations on transition systems to obtain
antichain algorithms for solving the reachability and repeated reachability problems …

Mata is a well-engineered automata library written in C++ that offers a unique combination of
speed and simplicity. It is meant to serve in applications such as string constraint solving and …

Regular model checking is a generic technique for verification of infinite-state and/or
parametrised systems which uses finite word automata or finite tree automata to finitely …

In this paper, we present VATA, a versatile and efficient open-source tree automata library
applicable, eg, in formal verification. The library supports both explicit and semi-symbolic …

Several new algorithms for deciding emptiness of Boolean combinations of regular
languages and of languages of alternating automata have been proposed recently …

In recent years, dynamic languages, such as JavaScript or Python, have been increasingly
used in a wide range of fields and applications. Their tricky and misunderstood behaviors …