Sciweavers

CCS
2006
ACM
13 years 8 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh
DEXA
2004
Springer
83views Database» more  DEXA 2004»
13 years 8 months ago
Efficient Rule Base Verification Using Binary Decision Diagrams
As their field of application has evolved and matured, the importance of verifying knowledge-based systems is now widely recognized. Nevertheless, some problems have remained. In t...
Christophe Mues, Jan Vanthienen
ICCTA
2007
IEEE
13 years 8 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
ISMIS
1994
Springer
13 years 8 months ago
BDDs and Automated Deduction
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists....
Jean Goubault, Joachim Posegga
DAC
1994
ACM
13 years 8 months ago
HSIS: A BDD-Based Environment for Formal Verification
Functional and timing verification are currently the bottlenecks in many design efforts. Simulation and emulation are extensively used for verification. Formal verification is now...
Adnan Aziz, Felice Balarin, Szu-Tsung Cheng, Ramin...
CCL
1994
Springer
13 years 8 months ago
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
Tomás E. Uribe, Mark E. Stickel
DAC
1996
ACM
13 years 8 months 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
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
13 years 8 months ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani
DAC
1997
ACM
13 years 8 months ago
Safe BDD Minimization Using Don't Cares
In many computer-aided design tools, binary decision diagrams (BDDs) are used to represent Boolean functions. To increase the efficiency and capability of these tools, many algor...
Youpyo Hong, Peter A. Beerel, Jerry R. Burch, Kenn...
ICCAD
1997
IEEE
133views Hardware» more  ICCAD 1997»
13 years 8 months ago
Functional simulation using binary decision diagrams
In many veri cation techniques fast functional evaluation of a Boolean network is needed. We investigate the idea of using Binary Decision Diagrams BDDs for functional simulatio...
Christoph Scholl, Rolf Drechsler, Bernd Becker