We present a simple method for verifying the safety properties of cache coherence protocols
with arbitrarily many nodes. Our presentation begins with two examples. The first example …

Probabilistic techniques for verification of finite-state transition systems offer huge memory
savings over deterministic techniques. The two leading probabilistic schemes are hash …

Many search algorithms are limited by the amount of memory available. Magnetic disk
storage is over two orders of magnitude cheaper than semiconductor memory, and …

In this paper we show that statistical properties of the transition graph of a system to be
verified can be exploited to improve memory or time performances of verification algorithms …

Explicit model checking algorithms explore the full state space of a system. We have
gathered a large collection of state spaces and performed an extensive study of their …

The applicability of model checking is hindered by the state space explosion problem in
combination with limited amounts of main memory. To extend its reach, the large available …

Our modern society relies increasingly on the sound performance of digital systems.
Guaranteeing that these systems actually behave correctly according to their specification is …

Counterexample-and proof-based refinement are complementary approaches to iterative
abstraction. In the former case, a single abstract counterexample is eliminated by each …

Behrmann et al. posed the question whether” To Store or Not To Store”[1] states during
reachability analysis, in order to counter the effects of the well-known state space explosion …

We consider the problem of checking whether an incomplete design can still be extended to
a complete design satisfying a given CTL formula and whether the property is satisfied for all …