ACM Home Page
Please provide us with feedback. Feedback
Test generation using SAT-based bounded model checking for validation of pipelined processors
Full text PdfPdf (161 KB)
Source Great Lakes Symposium on VLSI archive
Proceedings of the 16th ACM Great Lakes symposium on VLSI table of contents
Philadelphia, PA, USA
POSTER SESSION: Poster session 2 table of contents
Pages: 362 - 365  
Year of Publication: 2006
ISBN:1-59593-347-6
Authors
Heon-Mo Koo  University of Florida, Gainesville, FL
Prabhat Mishra  University of Florida, Gainesville, FL
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 24,   Citation Count: 2
Additional Information:

abstract   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/1127908.1127991
What is a DOI?

ABSTRACT

Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient test generation is crucial for the simulation-based verification. We present an efficient test generation methodology using SAT-based bounded model checking (BMC). This paper addresses two important challenges in test generation using SAT-based BMC: determination of bound for each property, and application of design and property decompositions to improve test generation time as well as memory requirement. Our experimental results using a MIPS processor demonstrate the feasibility and usefulness of our approach.


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
N. Amla et al. An analysis of SAT-based model checking techniques in an industrial environment. CHARME 2005.
 
3
A. Biere et al. Bounded model checking. Advances in Computers 2003.
 
4
 
5
 
6
7
 
8
 
9
S. Gurumurthy et al. Automated mapping of pre-computed module-level test sequences to processor instructions. ITC 2005.
 
10
11
 
12
13
 
14
M. R. Prasad et al. A survey of recent advances in SAT-based formal verification. Intl. Journal on Software Tools for Technology Transfer (STTT), 2005.
 
15
16
 
17
www-cad.eecs.berkeley.edu/kenmcmil/smv. Cadence SMV.


Collaborative Colleagues:
Heon-Mo Koo: colleagues
Prabhat Mishra: colleagues