(Enter summary)
Abstract: Ordered Binary Decision Diagrams (OBDDs) have found
widespread use in CAD applications such as formal verification,
logic synthesis, and test generation. OBDDs represent Boolean
functions in a form that is both canonical and compact for many
practical cases. They can be generated and manipulated by efficient
graph algorithms. Researchers have found that many tasks
can be expressed as series of operations on Boolean functions,
making them candidates for OBDD-based methods.
The success of OBDDs... (Update)
Cited by: More
Ordered Binary Decision Diagrams - And Minimal Trellises
(Correct)
Path-Sensitive Analysis for Linear Arithmetic and - Uninterpreted Functions Sumit
(Correct)
A System-Level Co-Verification Environment for ATM Hardware.. - Guido Post Andrea (1998)
(Correct)
Similar documents (at the sentence level):
5.0%: Verification of Arithmetic Functions with Binary Moment Diagrams - Bryant, Chen (1995)
(Correct)
Active bibliography (related documents): More All
0.2: Read-once Projections and Formal Circuit Verification with.. - Bollig, Wegener (1995)
(Correct)
0.2: Analysis of Composition Complexity and How to Obtain.. - Graphs Jain Mohanram (2000)
(Correct)
0.2: Analysis of Composition Complexity, and How to Obtain.. - Jain, Dinos, Wegner, Lu
(Correct)
Similar documents based on text: More All
0.3: Exponential Lower Bounds on the Size of OBDDs Representing.. - Horiyama, YAJIMA (1997)
(Correct)
0.3: Lower Bound of the Size of OBDDs Representing Division - Horiyama, YAJIMA (1996)
(Correct)
0.3: Mod-2-OBDD's - A Generalization of OBDD's and.. - Gergov, Meinel (1993)
(Correct)
Related documents from co-citation: More All
36: Graph-based algorithms for boolean function manipulation
- Bryant - 1986
12: Dynamic Variable Ordering for Ordered Binary Decision Diagrams (context) - Rudell - 1993
12: Symbolic boolean manipulation with ordered binary decision diagrams
- Bryant - 1992
BibTeX entry: (Update)
R.E. Bryant. Binary decision diagrams and beyond: Enabling technologies for formal verification. In Proc. International Conf. on Computer-Aided Design (ICCAD), 1995. http://citeseer.ist.psu.edu/bryant95binary.html More
@inproceedings{ bryant95binary,
author = "Randal E.~Bryant",
title = "Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification",
booktitle = "{IEEE/{ACM}} International Conference on Computer Aided Design, {ICCAD}, San Jose/{CA}",
publisher = "IEEE CS Press, Los Alamitos",
pages = "236--243",
year = "1995",
url = "citeseer.ist.psu.edu/bryant95binary.html" }
Citations (may not include all citations):
1726
Graph-basedalgorithms for Boolean function manipulation
- Bryant - 1986
510
Symbolic Boolean manipulation with ordered binary decision d..
- Bryant - 1992
316
Efficient implementation of a BDD package (context) - Brace, Rudell et al. - 1990
275
Dynamic variable ordering for ordered binary decision diagra.. (context) - Rudell - 1993
181
Algebraic decision diagrams and their applications
- Bahar, Frohm et al. - 1993
173
the complexity of VLSI implementations and graph representat..
- Bryant - 1991
126
Binary decision diagrams (context) - Akers - 1978
113
Logic verification using binary decision diagrams in a logic.. (context) - Malik, Wang et al. - 1988
92
Spectral transforms for large Boolean functions with applica.. (context) - Clarke, McMillan et al. - 1993
82
Efficient representation and manipulation of switching funct.. (context) - Drechsler, Sarabi et al. - 1994
80
Zero-suppressed BDDs for set manipulation in combinatorial p.. (context) - Minato - 1993
62
Evaluations and improvements of a Boolean comparison program.. (context) - Fujita, Fujisawa et al. - 1988
56
Verification of arithmetic circuits with binary moment diagr..
- Bryant, Chen - 1995
54
Hybrid Decision Diagrams: Overcoming the Limitations of MTBD..
- Clarke, Fujita et al. - 1995
49
Edge-valued binary decision diagrams for multi-level hierarc.. (context) - Lai, Sastry - 1992
29
A lower bound for integer multiplication with read-once only..
- Ponzio - 1995
28
Breadth-first manipulation of very large binary-decisiondiag.. (context) - Ochi, Yasuoka et al. - 1993
26
Boolean satisfiability and equivalence checking using genera.. (context) - Ashar, Devadas et al. - 1991
26
EVBDDbased algorithms for integer linear programming, spectr.. (context) - Lai, Pedram et al. - 1994
18
Efficient construction of binary moment diagrams for verifyi.. (context) - Hamaguchi, Morita et al. - 1995
17
Binary Decision Diagrams and Applications for VLSI CAD (context) - Minato - 1995
13
Efficient OBDDbasedBoolean manipulation in CAD beyond curren..
- Bern, Meinel et al. - 1995
4
Efficient Boolean Manipulation with OBDDs can be extended to.. (context) - Gergov, Meinel - 1994
1
Multilevel logic basedon functional decision diagrams (context) - Kebschull, Schubert et al. - 1992
1
The theory of zero-suppressed BDDs and the number of knights.. (context) - Schroer, Wegener - 1994
1
Graph-driven OBDDs---a new data structure for Boolean functi.. (context) - Sieling, Wegener - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ece.concordia.ca/~tahar/elec790h/elec790h.ref.html): More
Formal Verification of Combinational Circuits - Jain, Narayan, Fujita.. (1997)
(Correct)
Symbolic Model Checking: 10 20 States and Beyond - Burch, Clarke, McMillan.. (1990)
(Correct)
Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams - Bryant (1992)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC