## Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification (1995)

### Cached

### Download Links

- [jerry.c-lab.de]
- [www.cs.york.ac.uk]
- [www.cecs.uci.edu]
- [www.cs.cmu.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 104 - 0 self |

### BibTeX

@INPROCEEDINGS{Bryant95binarydecision,

author = {Randal E. Bryant},

title = {Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification},

booktitle = {},

year = {1995},

pages = {236--243}

}

### Years of Citing Articles

### OpenURL

### 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 has inspired efforts to improve their efficiency and to expand their range of applicability. Techniques have been discovered to make the representation more compact and to represent other classes of functions. This has led to improved performance on existing OBDD applications, as well as enabled new classes of problems to be solved. This paper provides an overview of the state of the art in graph-based function representations. We focus on several recent advances of particular importance for forma...