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 …

In this paper, we propose Zero-Suppressed BDDs (O-Sup-BDDs), which are BDDs based on
a new reduction rule. This data structure brings unique and compact representation of sets …

Configurable software verification is a recent concept for expressing different program
analysis and model checking approaches in one single formalism. This paper presents …

Feature modeling is a notation and an approach for modeling commonality and variability in
product families. In their basic form, feature models contain mandatory/optional features …

Switching Theory for Logic Synthesis covers the basic topics of switching theory and logic
synthesis in fourteen chapters. Chapters 1 through 5 provide the mathematical foundation …

For a d-ary Boolean function Φ:{0, 1} d→{0, 1} and an assignment to its variables x=(x 1, x
2,..., xd) we consider the problem of finding those subsets of the variables that are sufficient …

We present a network decomposition method using binary decision diagrams (BDD), a state-
of-the-art data structure to encode, and manipulate Boolean functions, for computing the …

Detecting and understanding reasons for defects and inadvertent behavior in software is
challenging due to their increasing complexity. In configurable software systems, the …

Over the years, the fundamentals of VLSI technology have evolved to include a wide range
of topics and a broad range of practices. To encompass such a vast amount of knowledge …

In this paper we present two new practical and pragmatic algorithms for solving the two key
on-the-fly model-checking problems for linear temporal logic: on demand construction of an …