Sciweavers

DATE
1998
IEEE
103views Hardware» more  DATE 1998»
15 years 3 months ago
Efficient Encoding Schemes for Symbolic Analysis of Petri Nets
Petri nets are a graph-based formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagr...
Enric Pastor, Jordi Cortadella
DAC
1999
ACM
15 years 3 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
STACS
2001
Springer
15 years 3 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel
ISQED
2002
IEEE
175views Hardware» more  ISQED 2002»
15 years 3 months ago
On the Relation between SAT and BDDs for Equivalence Checking
State-of-the-art verification tools are based on efficient operations on Boolean formulas. Traditional manipulation techniques are based on Binary Decision Diagrams (BDDs) and SAT...
Sherief Reda, Rolf Drechsler, Alex Orailoglu
ISCAS
2002
IEEE
116views Hardware» more  ISCAS 2002»
15 years 3 months ago
Antisymmetries in the realization of Boolean functions
New symmetries of degree two are introduced, along with spectral techniques for identifying these symmetries. Some applications of these symmetries are discussed, in particular th...
Jacqueline E. Rice, Jon C. Muzio
PLDI
2003
ACM
15 years 4 months ago
Points-to analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
Marc Berndl, Ondrej Lhoták, Feng Qian, Laur...
ISMVL
2003
IEEE
125views Hardware» more  ISMVL 2003»
15 years 4 months ago
Compact Representations of Logic Functions using Heterogeneous MDDs
In this paper, we propose a compact representation of logic functions using Multi-valued Decision Diagrams (MDDs) called heterogeneous MDDs. In a heterogeneous MDD, each variable ...
Shinobu Nagayama, Tsutomu Sasao
ISCAS
2003
IEEE
122views Hardware» more  ISCAS 2003»
15 years 4 months ago
Reducing the number of variable movements in exact BDD minimization
Ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this paper a new exact BDD minimization algorithm is presented, which is based on state space se...
Rüdiger Ebendt
DATE
2003
IEEE
100views Hardware» more  DATE 2003»
15 years 4 months ago
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals
: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining
Gianpiero Cabodi, Sergio Nocco, Stefano Quer
VOSS
2004
Springer
152views Mathematics» more  VOSS 2004»
15 years 4 months ago
Symbolic Representations and Analysis of Large Probabilistic Systems
Abstract. This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by...
Andrew S. Miner, David Parker