Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Hardware accelerated constrained random test generation

Hardware accelerated constrained random test generation

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Computers & Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Recent design and verification languages, such as SystemVerilog, support a rich test bench language, which provides significant support towards developing layered, structured, constrained random test bench architectures. Typically, the test bench language offers many features that are not synthesisable and therefore cannot be carried into the hardware for hardware accelerated simulation. One of the main challenges in improving the performance of hardware accelerated simulation is to run the task of random value selection under specified constraints in hardware. This problem (possibly for the first time) is addressed and a two-step approach is presented. In the first step, the constraints are pre-processed in software to generate a set of entailed regions. In the second step, random value selection is performed in hardware using the entailed regions pre-computed in the first step. It is shown that this method has modest area overhead and produces constraint satisfying random valuations within very few cycles. Results on test bench architectures for the ARM AMBA Bus and IBM CoreConnect protocol suites have been reported.

References

    1. 1)
      • SystemVerilog 3.1a Language Reference Manual. http://www.eda.org/sv/SystemVerilog_3.1a.pdf.
    2. 2)
      • Bauer, J., Bershteyn, M., Kaplan, I., Vyedin, P.: `A reconfigurable logic machine for fast event-driven simulation', Proc. Design Automation Conf. (DAC), June 1998, p. 668–671.
    3. 3)
      • E. Tsang . (1993) Foundations of constraint satisfaction.
    4. 4)
      • Design Compiler. www.synopsys.com\products\logic\logic.html.
    5. 5)
      • Chandra, A.K., Iyengar, V.S.: `Constraint solving for test generation–a technique for high level design verification', Proc. Intl. Conf. on Computer Design (ICCD), October 1992, p. 245–248, ISBN: 0-8186-3110-4.
    6. 6)
      • PCI Bus Specification 3.0,http://www.pcisig.com/membersdownloads/specifications/conventional/PCI_LB3.0-2-6-04.pdf.
    7. 7)
      • ILOG CPLEX: High-performance software for mathematical programming. http://www.ilog.com/products/cplex/.
    8. 8)
      • Reference Verification Methodology for Vera, http://www.synopsys.com/products/simulation/pdf/va_vol4_ids1_vera.pdf.
    9. 9)
      • Shimizu, K., Dill, D.: `Deriving a simulation input generator and a coverage metric from a formal specification', Proc. Design Automation Conf. (DAC), June 2002, p. 801–806.
    10. 10)
      • OpenVera LRM 2.0, http://www.open-vera.com.
    11. 11)
      • Kukula, J.H., Shiple, T.R.: `Building circuits from relations', Proc. 12th Int. Conf. on Computer Aided Verification (CAV), LNCS, 2000, 1855, p. 113–123.
    12. 12)
      • AMBA Specification Rev2.0, http://www.arm.com/products/solutions/AMBA_Spec.html.
    13. 13)
      • Albin, K., Yuan, J., Aziz, A., Pixley, C.: `Constraint synthesis for environment modeling in functional verification', Proc. of the Design Automation Conf. (DAC), June 2003, USA, p. 296–299.
    14. 14)
      • Yuan, J., Shultz, K., Pixley, C., Miller, H., Aziz, A.: `Modeling design constraints and biasing in simulation using BDDs', Proc. Int. Conf. on Computer-Aided Design (ICCAD), 1999, p. 584–589.
    15. 15)
      • Suyama, T., Yokoo, M., Sawada, H., Nagoya, A.: `Solving satisfiability problems using reconfigurable computing', Proc. IEEE Trans. on VLSI Systems, February 2001, 9, p. 109–116.
    16. 16)
      • J. Boissonnat , M. Yvinec . Algorithmic geometry.
    17. 17)
      • M. de Berg , M. van Kreveld , M. Overmars , O. Schwarzkopf . (1997) Computational geometry: algorithms and applications.
    18. 18)
      • e Reuse Methodology (eRM), www.verisity.com\products\erm.html.
    19. 19)
      • K. Young-II . TPartition: testbench partitioning for hardware accelerated functional verification. Proc. IEEE Design and Test Comput. , 6 , 484 - 493
    20. 20)
      • R. Dechter . (2003) Constraint processing.
    21. 21)
      • J. Varghese , M. Butts , J. Batcheller . An efficient logic emulation system. Proc. IEEE Trans. VLSI Syst. , 2 , 171 - 174
    22. 22)
      • J. Bergeron , E. Cerny , A. Hunter , A. Nightingale . (2005) Verification methodology manual for systemverilog.
    23. 23)
      • IBM CoreConnect Bus Specification. www-306.ibm.com\chis\techlib\techlib.nsf\techdocs\.
    24. 24)
      • Example Constrained Random Test Benches. http://www.facweb.iitkgp.ernet.in/~pallab/Constraint1.htm.
    25. 25)
      • Cadambi, S., Mulpuri, C., Ashar, P.: `A fast, inexpensive and scalable hardware acceleration technique for functional simulation', Proc. Design Automation Conf. (DAC), June 2002, p. 570–575.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cdt_20070016
Loading

Related content

content/journals/10.1049/iet-cdt_20070016
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address