Efficient manipulation of Boolean functions is an important component of many computer-aided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient

Large BDD applications push computing resources to their limits. One solution to overcoming resource limitations is to distribute the BDD data structure across multiple networked workstations. This paper presents an efficient parallel BDD package for a distributed environment such as a network

. BDDs (binary decision diagrams) are ubiquitous in formal verification tools, and the time and memory used by the BDD package is frequently the constraint that prevents application of formal verification. Accordingly, several researchers have investigated using parallel processing for BDDs

BDDs (binary decision diagrams) are ubiquitous in formal verification tools. The time and memory used by the BDD package are frequently the constraints that prevent application of formal verification. Parallelization is an obvious way to try to cope with this. In this paper, we present a

Abstract — Binary Decision Diagrams (BDDs) are useful data structures for symbolic Boolean manipulations. BDDs are used in many tasks in VLSI/CAD, such as equivalence checking, property checking, logic synthesis, and false paths. In this paper we describe a new approach for the realization of a BDD

Abstract. In this paper, we present CacBDD, a new efficient BDD (Binary Decision Diagrams) package. It implements a dynamic cache management algorithm, which takes account of the hit-rate of computed table and available memory. Experiments on the BDD benchmarks of both combinational circuits

Abstract The success of binary decision diagram (BDD)

Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. Algorithms have to be developed to allow efficient BDD manipulation and minimization.

Abstract. Efficient manipulation of Boolean functions is the foundation of many formal verification tasks. Several code libraries and development environments exist in the public domain which perform these tasks using ordered binary decision diagrams as the central data structure. This paper describes a re-implementation of one of these libraries, David Long’s bddlib, in Sun Microsystems ’ Java computer language. Java offers many advantages over traditional C and C++ code in the areas of stability, memory management, portability, clarity, and code reuse. However, with the present generation of Java virtual machines, execution is significantly slower than comparable efficiently compiled native code. 1

In this paper we present a new approach for the realization of a BDD package. This approach does not depend on recursive synthesis operations, i.e. the ternary If-Then-Else-operator (ITE), to perform manipulations of Boolean functions, instead our basic operation MORE is based on exchanges