A Generic Synthesisable Test Bench

被引:0
作者
Naylor, Matthew [1 ]
Moore, Simon [1 ]
机构
[1] Univ Cambridge, Comp Lab, Cambridge CB2 1TN, England
来源
2015 ACM/IEEE INTERNATIONAL CONFERENCE ON FORMAL METHODS AND MODELS FOR CODESIGN (MEMOCODE) | 2015年
基金
英国工程与自然科学研究理事会;
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Writing test benches is one of the most frequently-performed tasks in the hardware development process. The ability to reuse common test bench features is therefore key to productivity. In this paper, we present a generic test bench, parameterised by a specification of correctness, which can be used to test any design. Our test bench provides several important features, including automatic test-sequence generation and shrinking of counter-examples, and is fully synthesisable, allowing rigorous testing on FPGA as well as in simulation. The approach is easy to use, cheap to implement, and encourages the formal specification of hardware components through the reward of automatic testing and simple failure cases.
引用
收藏
页码:128 / 137
页数:10
相关论文
共 19 条
[1]   Shared memory consistency models: A tutorial [J].
Adve, SV ;
Gharachorloo, K .
COMPUTER, 1996, 29 (12) :66-&
[2]  
ALGLAVE J, TACAS 2011, P41
[3]  
[Anonymous], 18002012 IEEE
[4]  
BJESSE P, ICFP 1998, P174
[5]  
Cerny E, 2010, POWER OF ASSERTIONS IN SYSTEM VERILOG, P3, DOI 10.1007/978-1-4419-6600-1_1
[6]   Testing monadic code with QuickCheck [J].
Claessen, K ;
Hughes, J .
ACM SIGPLAN NOTICES, 2002, 37 (12) :47-59
[7]   QuickCheck: A lightweight tool for random testing of Haskell programs [J].
Claessen, K ;
Hughes, J .
ACM SIGPLAN NOTICES, 2000, 35 (09) :268-279
[8]  
Dutertre B, 2014, LECT NOTES COMPUT SC, V8559, P737, DOI 10.1007/978-3-319-08867-9_49
[9]   DATA-ABSTRACTION IMPLEMENTATION, SPECIFICATION, AND TESTING [J].
GANNON, J ;
MCMULLIN, P ;
HAMLET, R .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1981, 3 (03) :211-223
[10]  
Hughes J, 2007, LECT NOTES COMPUT SC, V4354, P1