Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
112
Voted
ASPDAC
2001
ACM
107
views
Hardware
»
more
ASPDAC 2001
»
An efficient solution to the storage correspondence problem for large sequential circuits
15 years 6 months ago
Download
faculty.cs.tamu.edu
Abstract- Traditional state-traversal-basedmethods for verifying sequential circuits are computationally infeasible for circuits with a large number of memory elements. However, if...
Wanlin Cao, D. M. H. Walker, Rajarshi Mukherjee
claim paper
Read More »