For someone with a hammer the whole world looks like a nail. Within the last 10-13 years
Binar· y Decision Diagmms (BDDs) have become the state-of-the-art data structure in VLSI …

Abstract Binary Decision Diagrams (BDD s) have dominated the area of symbolic model
checking for the past decade. Recently, the use of satisfiability (SAT) solvers has emerged …

Research and development of logic synthesis and verification have matured considerably
over the past two decades. Many commercial products are available, and they have been …

Decision diagram (DD) techniques are very popular in the electronic design automation
(EDA) of integrated circuits, and for good reason. They can accurately simulate logic design …

Binary decision diagrams provide a data structure for representing and manipulating
Boolean functions in symbolic form. They have been especially effective as the algorithmic …

Contemporary FPGA synthesis is a multiphase process that involves technology-
independent logic optimization followed by FPGA-specific mapping to a target FPGA …

To participate in conversations with people, robots must not only see and talk to people, but
must also make use of the conventions of conversation and connection to their human …

This paper presents a scalable method for parallel symbolic reachability analysis on a
distributed-memory environment of workstations. Our method makes use of an adaptive …

A Taylor expansion diagram (TED) is a compact, word-level, canonical representation for
data flow computations that can be expressed as multivariate polynomials. TEDs are based …

We address the problem of finite state machine (FSM) traversal, a key step in most
sequential verification and synthesis algorithms. We propose the use of partitioned ROBDDs …