Skip to search formSkip to main contentSkip to account menu

Binary decision diagram

Known as: Binary Decision Diagrams, Branching program, Branching programs 
In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function. On a more… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
Ordered Binary Decision Diagrams (OBDDs) play a key role in the automated synthesis and formal verification of digital systems… 
1998
1998
Abstract Network firewalls and routers can use a rule database to decide which packets wi ll be allowedfrom one network onto… 
1996
1996
This is a journal article. It was published in RAIRO. Automatique-productique informatique industrielle, 30(8), 1996, pp 1051… 
1996
1996
In this paper we present a new approach for the realization of a BDD package. This approach does not depend on recursive… 
Highly Cited
1995
Highly Cited
1995
Design verification poses a very practical problem during circuit synthesis. Learning based verification techniques prove to be… 
Highly Cited
1995
Highly Cited
1995
A new test generation technique for path delay faults in circuits employing scan/hold type flip-flops is presented. Reduced… 
Highly Cited
1995
Highly Cited
1995
This paper presents a new methodology for formal logic verification for combinational circuits. Specifically, a structural… 
Highly Cited
1992
Highly Cited
1992
A synchronization sequence for a synchronous design D is a sequence of primary input vectors which when applied to any initial… 
1992
1992
Considers the problem of variable ordering in binary decision diagrams (BDD's). The authors present several heuristics for… 
Highly Cited
1990
Highly Cited
1990
  • S. KimuraE. Clarke
  • 1990
  • Corpus ID: 27466873
A parallel algorithm for constructing binary decision diagrams is described. The algorithms treats binary decision graphs as…