Sciweavers

60 search results - page 12 / 12
» Pairing Functions, Boolean Evaluation and Binary Decision Di...
Sort
View
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
13 years 10 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...
DATE
2008
IEEE
148views Hardware» more  DATE 2008»
13 years 11 months ago
On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen
ICCAD
1994
IEEE
114views Hardware» more  ICCAD 1994»
13 years 9 months ago
Performance-driven synthesis of asynchronous controllers
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
Kenneth Y. Yun, Bill Lin, David L. Dill, Srinivas ...
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 3 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 6 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...