In this article we present a comprehensive survey of various approaches for the verification
of cache coherence protocols based on state enumeration,(symbolic model checking, and …

Since CAR Hoare's text Communicating Sequential Processes was published in 1985, his
notation has been extensively used for teaching and applying concurrency theory. This book …

The state explosion problem remains a major hurdle in applying symbolic model checking to
large hardware designs. State space abstraction, having been essential for verifying designs …

The advent of ever more complex reactive systems in increasingly critical areas calls for the
development of automated verification techniques. Model checking is one such technique …

We study property preserving transformations for reactive systems. The main idea is the use
of simulations parameterized by Galois connections (α, γ), relating the lattices of properties …

In order to contribute to the solution of the software reliability problem, tools have been
designed to analyze statically the run-time behavior of programs. Because the correctness …

Although automated proof checking tools for general-purpose logics have been successfully
employed in the verification of digital systems, there are inherent limits to the efficient …

We describe a set of BDD based algorithms for efficient FSM synthesis and verification. We
establish that the core computation in both synthesis and verification is forming the image …

We show that constraint logic programming (CLP) can serve as a conceptual basis and as a
practical implementation platform for the model checking of infinite-state systems. CLP …

We present an extension to the Mur ϕ verifier to verify systems with replicated identical
components. Verification is by explicit state enumeration in an abstract state space where …