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 …

Neural networks provide state-of-the-art results for most machine learning tasks.
Unfortunately, neural networks are vulnerable to adversarial examples: given an input x and …

Decision diagrams (DDs) are the state-of-the-art data structure in VLSI CAD and have been
successfully applied in many other fields. DDs are widely used and are also integrated in …

We describe a method for using abstraction to reduce the complexity of temporal-logic
model checking. Using techniques similar to those involved in abstract interpretation, we …

This paper describes a new symbolic model checker, called NuSMV, developed as part of a
joint project between CMU and IRST. NuSMV is the result of the reengineering …

In this paper we present theory and experimental results on Algebraic Decision Diagrams.
These diagrams extend BDDs by allowing values from an arbitrary finite domain to be …

In this paper, we discuss the use of binary decision diagrams to represent general matrices.
We demonstrate that binary decision diagrams are an efficient representation for every …

In recent years, formal methods have emerged as an alternative approach to ensuring the
quality and correctness of hardware designs, overcoming some of the limitations of …

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 …

A fundamental difficulty in automatic formal verification of finite-state systems is the state
explosion problem—even relatively simple systems can produce very large state spaces …