Sciweavers

231 search results - page 20 / 47
» On overlays and minimization diagrams
Sort
View
CAV
1993
Springer
127views Hardware» more  CAV 1993»
15 years 1 months ago
Symbolic Equivalence Checking
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
Jean-Claude Fernandez, Alain Kerbrat, Laurent Moun...
72
Voted
ICCAD
1994
IEEE
109views Hardware» more  ICCAD 1994»
15 years 1 months ago
Efficient breadth-first manipulation of binary decision diagrams
We propose new techniques for efficient breadth-first iterative manipulation of ROBDDs. Breadth-first iterative ROBDD manipulation can potentially reduce the total elapsed time by...
Pranav Ashar, Matthew Cheong
SPLC
2007
14 years 10 months ago
Feature Diagrams and Logics: There and Back Again
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 feature...
Krzysztof Czarnecki, Andrzej Wasowski
IMCSIT
2010
14 years 7 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
15 years 3 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...