Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
37
Efficient implementation of a BDD package
- In Proceedings of the 27th ACM/IEEE conference on Design autamation
, 1991
"... 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 implementat ..."
Abstract
-
Cited by 504 (9 self)
- Add to MetaCart
implementation of the if-then-else (ITE) operator. A hash table is used to maintain a strong carwnical form in the ROBDD, and memory use is improved by merging the hash table and the ROBDD into a hybrid data structure. A memory funcfion for the recursive ITE algorithm is implemented using a hash-based cache
Representation of Boolean Functions with ROBDDs
- In Slovene
, 1993
"... Abstract | This paper describes data structures and algorithms for the representation of Boolean functions with reduced ordered binary decision diagrams (ROBDDs). A hash table is used for quick search. Additional information about variables and functions is stored in binary trees. Manipulations on f ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Abstract | This paper describes data structures and algorithms for the representation of Boolean functions with reduced ordered binary decision diagrams (ROBDDs). A hash table is used for quick search. Additional information about variables and functions is stored in binary trees. Manipulations
A Reactive Implementation of Pos Using ROBDDs
, 1996
"... The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitable domain for capturing the kind of dependencies arising in groundness analysis. Its (by now standard) implementation is b ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
of those variable which are deemed to be ground in the context of a ROBDD. This is not surprising, since most currently implemented analyzers need to derive this information only at the end of the analysis and only for presentation purposes. Things are much different when this information is required
A purely functional implementation of ROBDDs in Haskell
"... This paper presents an implementation of the ROBDD data structure in Haskell. It shows that lazy evaluation can be used to improve the performance of some ROBDD algorithms. While standard implementations construct the whole structure no matter which parts are demanded we use lazy evaluation to provi ..."
Abstract
- Add to MetaCart
This paper presents an implementation of the ROBDD data structure in Haskell. It shows that lazy evaluation can be used to improve the performance of some ROBDD algorithms. While standard implementations construct the whole structure no matter which parts are demanded we use lazy evaluation
Efficient ROBDD operations for program analysis
- Procs. of the Nineteenth Australasian Computer Science Conference, 347--356. Australian Computer Science Communications
, 1996
"... Reduced Ordered Binary Decision Diagrams (ROBDDs), also known as Bryant graphs, are a representation for Boolean functions supporting many efficient operations. Because of this, they have often been used to implement the positive Boolean functions for program analysis. Some ROBDD operations heavily ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Reduced Ordered Binary Decision Diagrams (ROBDDs), also known as Bryant graphs, are a representation for Boolean functions supporting many efficient operations. Because of this, they have often been used to implement the positive Boolean functions for program analysis. Some ROBDD operations heavily
Factorizing equivalent variable pairs in ROBDD-based implementations of Pos
- PROCEEDINGS OF THE “SEVENTH INTERNATIONAL CONFERENCE ON ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY (AMAST’98)”, VOLUME 1548 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1999
"... ..."
Efficient ROBDD based computation of common decomposition functions of multi-output boolean functions
, 1995
"... One of the crucial problems multi-level logic synthesis techniques for multi-output boolean functions f = (f 1 ; : : : ; fm ) : f0; 1g n ! f0; 1g m have to deal with is finding sublogic which can be shared by different outputs, i.e., finding boolean functions ff = (ff 1 ; : : : ; ff h ) : f0; 1 ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
; 1g p ! f0; 1g h which can be used as common sublogic of good realizations of f 1 ; : : : ; fm . In this paper we present an efficient robdd based implementation of this Common Decomposition Functions Problem (cdf). Formally, cdf is defined as follows: Given m boolean functions f 1 ; : : : ; fm
A ROBDD-Based Generalized Nodal Control Scheme for Standby Leakage Power Reduction
"... Abstract — We present in this paper the method of Generalized Nodal Control for standby leakage power reduction. First, a sparse set of input and internal nodes to control are identified using a novel algorithm based on Reduced Ordered Binary Decision Diagrams (ROBDDs) and Fiduccia-Mattheyses Partit ..."
Abstract
- Add to MetaCart
Abstract — We present in this paper the method of Generalized Nodal Control for standby leakage power reduction. First, a sparse set of input and internal nodes to control are identified using a novel algorithm based on Reduced Ordered Binary Decision Diagrams (ROBDDs) and Fiduccia
Multiway Decision Graphs for Automated Hardware Verification
, 1996
"... Traditional ROBDD-based methods of automated verification suffer from the drawback that they require a binary representation of the circuit. To overcome this limitation we propose a broader class of decision graphs, called Multiway Decision Graphs (MDGs), of which ROBDDs are a special case. With MDG ..."
Abstract
-
Cited by 91 (15 self)
- Add to MetaCart
Traditional ROBDD-based methods of automated verification suffer from the drawback that they require a binary representation of the circuit. To overcome this limitation we propose a broader class of decision graphs, called Multiway Decision Graphs (MDGs), of which ROBDDs are a special case
Stålmarck’s Procedure 2.19 Reduced Ordered Binary Decision Diagrams (ROBDDs) 2.23 Sequential Circuits Verification 2.55 Relational Representation of FSMs 2.56 Relational Product of FSMs 2.60 Reachability Analysis on FSMs 2.62
"... XNOR, and blocks implementing more complex logic (Boolean) functions. • No logical loops, i.e., topologically there may be loops, but they are not sensitizable under any (valid) input combination, even such loops may be prohibited / not produced by automated analysis / synthesis tools Goal Given two ..."
Abstract
- Add to MetaCart
XNOR, and blocks implementing more complex logic (Boolean) functions. • No logical loops, i.e., topologically there may be loops, but they are not sensitizable under any (valid) input combination, even such loops may be prohibited / not produced by automated analysis / synthesis tools Goal Given
Results 1 - 10
of
37
