DocumentCode
2992077
Title
Fast Verification of Memory Consistency for Chip Multi-Processor
Author
Lv, Zheng ; Chen, Feng ; Chen, Hao ; Lv, Yi
fYear
2011
fDate
3-4 Dec. 2011
Firstpage
1497
Lastpage
1502
Abstract
Verifying the execution of a test program against the memory consistency model is known to be NP-hard. Because of lacking extra observability, verifying the memory consistency model in post-silicon stage is even harder than in pre-silicon stage. In this paper, by identifying the pending windows of microprocessor and introducing the resultant time order restrictions, we propose a low time complexity algorithm for checking end-to-end correctness on real systems. Our MOTEC tool, which implements the above algorithm, has been successfully detected several injected bugs in a CMP emulation environment. It is also worth noting that MOTEC is general enough to support many CMP systems with trivial modifications.
Keywords
formal verification; microprocessor chips; program testing; CMP emulation environment; NP-hard problerm; chip multiprocessor; fast verification; memory consistency; post-silicon stage; presilicon stage; program testing; Complexity theory; Hardware; Multiprocessing systems; Radiation detectors; Random access memory; Software; Upper bound; hardware verification; memory consistency model;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on
Conference_Location
Hainan
Print_ISBN
978-1-4577-2008-6
Type
conf
DOI
10.1109/CIS.2011.334
Filename
6128375
Link To Document