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 …

A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …

In automata-theoretic model checking we compose the design under verification with a
Büchi automaton that accepts traces violating the specification. We then use graph …

Spot is a library of model-checking algorithms started in 2003. This paper focuses on its
module for translating linear-time temporal logic (LTL) formulas into Büchi automata: one of …

Abstract Model checking is a fully automated, formal method for demonstrating absence of
bugs in reactive systems. Here, bugs are violations of properties in Linear-time Temporal …

This paper presents the linear temporal logic of rewriting (LTLR) model checker under
localized fairness assumptions for the Maude system. The linear temporal logic of rewriting …

We present an Isabelle/HOL formalization of Gabow's algorithm for finding the strongly
connected components of a directed graph. Using data refinement techniques, we extract …

We re-investigate the problem of LTL model-checking for finite-state systems. Typical
solutions, like in Spin, work on the fly, reducing the problem to Buechi emptiness. This can …

Abstract We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that
replaces the synchronized product used in the automata-theoretic approach for LTL model …

We investigate and improve the scalability of multi-core LTL model checking. Our algorithm,
based on parallel DFS-like SCC decomposition, is able to efficiently decompose large SCCs …