Ordered Binary-Decision Diagrams (OBDDs) represent Boolean functions as directed
acyclic graphs. They form a canonical representation, making testing of functional properties …

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 …

The phrase model checking refers to algorithms for exploring the state space of a transition
system to determine if it obeys a specification of its intended behavior. These algorithms can …

We describe a framework for compositional verification of finite-state processes. The
framework is based on two ideas: a subset of the logic CTL for which satisfaction is …

The temporal logic model checking algorithm of Clarke, Emerson, and Sistla (1986) is
modified to represent state graphs using binary decision diagrams (BDD's) and partitioned …

We signi cantly reduce the complexity of BDD-based symbolic veri cation by using
partitioned transition relations to represent state transition graphs. This method can be …

The Birth of Model Checking* Page 1 The Birth of Model Checking* Edmund M. Clarke
Department of Computer Science Carnegie Mellon University Pittsburgh, PA, USA emc@cs.cmu.edu …

We investigate the bene ts of using a synchronous data-ow language for programming
critical real-time systems. These bene ts concern ergonomy| since the data ow approach …

Test und Validierung spielen bei Echtzeitsystemen eine zentrale Rolle: Auf die
Spezifikationen, die der Hersteller angibt, muss sich der Kunde hier in besonders hohem …

Growing advances in VLSI technology have led to an increased level of complexity in
current hardware systems. Late detection of design errors typically results in higher costs …