| A decision procedure for bit-vector arithmetic |
| Full text |
Pdf
(310 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 35th annual Design Automation Conference
table of contents
San Francisco, California, United States
Pages: 522 - 527
Year of Publication: 1998
ISBN:0-89791-964-5
|
|
Authors
|
|
Clark W. Barrett
|
Computer Systems Laboratory, Stanford University, Stanford, CA
|
|
David L. Dill
|
Computer Systems Laboratory, Stanford University, Stanford, CA
|
|
Jeremy R. Levitt
|
O-in Design Automation and Computer Systems Laboratory, Stanford University, Stanford, CA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 25, Citation Count: 14
|
|
|
ABSTRACT
Bit-v ector theories with concatenation and extraction have been shown to be useful and important for hardware verification. We have implemented an extended theory which includes arithmetic. Although deciding equality in suc h a theory is NP-hard, our implementation is efficient for many practical examples. We believ e this to be the first such implementation which is efficient, automatic, and complete.
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
|
|
| |
7
|
Joseph A. Gallian. Contemporary Abstract Algebra. D. C. Heath and Company, second edition, 1990.
|
| |
8
|
|
| |
9
|
Robert B. Jones , David L. Dill , Jerry R. Burch, Efficient validity checking for processor verification, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.2-6, November 05-09, 1995, San Jose, California, United States
|
| |
10
|
Leo G. Marcus. SOVS 13 Users'Manual. The Aerospace Corporation, E1 Segundo, CA 90245, October 1994. Aerospace Report ATR-94(4778)-5.
|
 |
11
|
Michael D. Smith , Monica S. Lam , Mark A. Horowitz, Boosting beyond static scheduling in a superscalar processor, Proceedings of the 17th annual international symposium on Computer Architecture, p.344-354, May 28-31, 1990, Seattle, Washington, United States
|
| |
12
|
|
| |
13
|
|
CITED BY 15
|
|
|
|
|
G. Parthasarathy , M. K. Iyer , K.-T. Cheng , L.-C. Wang, An efficient finite-domain constraint solver for circuits, Proceedings of the 41st annual conference on Design automation, June 07-11, 2004, San Diego, CA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
N. Shekhar , P. Kalla , F. Enescu , S. Gopalakrishnan, Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra, Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, p.291-296, November 06-10, 2005, San Jose, CA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
INDEX TERMS
Primary Classification:
J.
Computer Applications
Additional Classification:
B.
Hardware
B.8
Performance and Reliability
C.
Computer Systems Organization
G.
Mathematics of Computing
G.4
MATHEMATICAL SOFTWARE
Subjects:
Algorithm design and analysis
General Terms:
Algorithms,
Design,
Measurement,
Performance,
Theory
Keywords:
MPEG4,
codec,
design automatian,
flip-flops,
level converters,
low power,
placement,
synthesis,
voltage scaling
|