ACM Home Page
Please provide us with feedback. Feedback
Verification of arithmetic circuits with binary moment diagrams
Full text PdfPdf (168 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 32nd annual ACM/IEEE Design Automation Conference table of contents
San Francisco, California, United States
Pages: 535 - 541  
Year of Publication: 1995
ISBN:0-89791-725-1
Authors
Randal E. Bryant  Carnegie Mellon University, Pittsburgh, PA
Yirng-An Chen  Carnegie Mellon University, Pittsburgh, PA
Sponsors
EDAC : Electronic Design Automation Consortium
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Citation Count: 71
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/217474.217583
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
4
5
 
6
R. Enders, "Note on the complexity of binary moment diagram representations," unpublished paper, Siemens AG, Munich Germany, 1994.
 
7
J. Jain, J. Bitner, M. Abadir, J. A. Abraham, and D. S. Fussell, "Indexed BDDs: Algorithmic advances in techniques to represent and verify Boolean functions," submitted for publication, 1994.
 
8
U. Kebschull, E. Schubert, and W. Rosentiel, "Multilevel logic based on functional decision diagrams," European Design Automation Conference, 1992, pp. 43-47.
 
9
10
 
11
S.-i. Minato, "Implicit manipulation of polynomials using zerosuppressed BDDs," unpublished manuscript, 1994.
 
12

CITED BY  71

Collaborative Colleagues:
Randal E. Bryant: colleagues
Yirng-An Chen: colleagues