We present a new release of the parallel and distributed LTL model checker DiVinE. The
major improvement in this new release is an extension of the class of systems that may be …

The problem of decomposing a directed graph into its strongly connected components is a
fundamental graph problem inherently present in many scientific and commercial …

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 …

The current interest in systems biology is to gain a better understanding of how the complex
dynamic behaviour of the cell emerges from mutual interactions of molecular species. When …

Model checking is a popular technique to systematically and automatically verify system
properties. Unfortunately, the well-known state explosion problem often limits the extent to …

Concurrency poses a major challenge for program verification, but it can also offer an
opportunity to scale when subproblems can be analysed in parallel. We exploit this …

Explicit model checking algorithms explore the full state space of a system. State spaces are
usually treated as directed graphs without any specific features. We gather a large collection …

Recent development in computer hardware has brought more widespread emergence of
shared memory, multi-core systems. These architectures offer opportunities to speed up …

This paper extends the piggyback algorithm to enlarge the set of liveness properties it can
verify. Its extension is motivated by an attempt to express in logic the counterexamples it can …

We extend a distributed-memory explicit-state LTL model checking algorithm (OWCTY) with
hash compaction. We provide a detailed description of the improved algorithm and a …