We are seeing an increased push in the use of formal verification techniques in safety-
critical software and hardware in practice. Formal verification has been successfully used to …

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 We present Spot 2.0, a C++ library with Python bindings and an assortment of
command-line tools designed to manipulate LTL and ω-automata in batch. New automata …

Temporal properties are useful for describing and reasoning about software behavior, but
developers rarely write down temporal specifications of their systems. Prior work on inferring …

We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae
into Büchi automata via very weak alternating co-Büchi automata and generalized Büchi …

Manipulation planning from high-level task specifications, even though highly desirable, is a
challenging problem. The large dimensionality of manipulators and complexity of task …

We propose a flexible exchange format for ω-automata, as typically used in formal
verification, and implement support for it in a range of established tools. Our aim is to simplify …

We describe the design and implementation of an automated theorem prover realising a
fully general notion of cyclic proof. Our tool, called Cyclist, is able to construct proofs obeying …

We report here on an experimental investigation of LTL satisfiability checking via a reduction
to model checking. By using large LTL formulas, we offer challenging model-checking …

Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive
system from its temporal logic specification. Two of the main challenges in bringing reactive …