Sciweavers

112 search results - page 10 / 23
» Ordered Binary Decision Diagrams and the Davis-Putnam Proced...
Sort
View
DAC
1996
ACM
14 years 21 hour ago
Bit-Level Analysis of an SRT Divider Circuit
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...
Randal E. Bryant
ICCTA
2007
IEEE
13 years 11 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
JUCS
2010
143views more  JUCS 2010»
13 years 6 months ago
Design of Arbiters and Allocators Based on Multi-Terminal BDDs
: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways...
Václav Dvorák, Petr Mikusek
CORR
2000
Springer
100views Education» more  CORR 2000»
13 years 7 months ago
Algorithms for Analysing Firewall and Router Access Lists
Network firewalls and routers use a rule database to decide which packets will be allowed from one network onto another. By filtering packets the firewalls and routers can improve...
Scott Hazelhurst
SCP
1998
134views more  SCP 1998»
13 years 7 months ago
Abstract Interpretation Using Typed Decision Graphs
Interpretation Using Typed Decision Graphs Laurent Mauborgne LIENS, ´Ecole Normale Sup´erieure, 45 rue d’Ulm, 75230 Paris cedex 05, France Abstract. This article presents a way...
Laurent Mauborgne