## Symbolic Boolean manipulation with ordered binary-decision diagrams (1992)

### Cached

### Download Links

- [www.cs.utah.edu]
- [www.ics.uci.edu]
- [morpheus.cs.ucdavis.edu]
- [akebono.stanford.edu]
- [www.cs.cmu.edu]
- [www.cs.ubc.ca]
- DBLP

### Other Repositories/Bibliography

by
Randal E Bryant

Venue: | ACM Computing Surveys |

Citations: | 878 - 11 self |

### BibTeX

@ARTICLE{Bryant92symbolicboolean,

author = {Randal E Bryant},

title = {Symbolic Boolean manipulation with ordered binary-decision diagrams},

journal = {ACM Computing Surveys},

year = {1992},

volume = {24},

pages = {293--318}

}

### Years of Citing Articles

### OpenURL

### Abstract

Ordered Binary-Decision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as graph algorithms on OBDD