SIGN IN
SIGN UP
A general decomposition strategy for verifying register renaming
Full Text:
PDF
Buy this Article
Authors:
Hazem I. Shehata
University of Waterloo, Waterloo, Canada
Mark D. Aagaard
University of Waterloo, Waterloo, Canada
Published in:
· Proceeding
DAC '04
Proceedings of the 41st annual Design Automation Conference
Pages 234-237
ACM
New York, NY
, USA
©2004
table of contents
ISBN:1-58113-828-8
doi>
10.1145/996566.996632
2004 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 18
· Downloads (cumulative): 282
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
deduction and theorem proving
experimentation
formal design verification
pipelined circuits
register renaming
single data stream architectures
verification
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder