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

Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

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 the previous chapter, we equated a CTL formula with the set of states in which the formula
is true. We showed how the CTL operators can thus be characterized as fixed points of …

Many different methods have been devised for automatically verifying finite state systems by
examining state-graph models of system behavior. These methods all depend on decision …

Recent years have seen the development of powerful tools for verifying hardware and
software systems, as companies worldwide realise the need for improved means of …

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 …

Fourty years ago Quine noted that finding a procedure that computes a minimal sum
products for a given propositional formula is very complex, even though propositional …

Formal verification increasingly has become recognized as an answer to the problem of how
to create ever more complex control systems, which nonetheless are required to behave …

Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions
similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the …